DocumentCode
2646065
Title
An algorithm to determine mutually exclusive operations in behavioral descriptions
Author
Li, Jian ; Gupta, Rajesh K.
Author_Institution
Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
fYear
1998
fDate
23-26 Feb 1998
Firstpage
457
Lastpage
463
Abstract
Scheduling and binding are two major tasks in architectural synthesis from behavioral descriptions. The information about the mutually exclusive pairs of operations is very useful in reducing both the total delay of the schedule and the resource usage in the final circuit implementation. In this paper, we present an algorithm to identify the largest set of mutually exclusive operation pairs in behavioral descriptions. Our algorithm uses data-flow analysis on a tabular model of system functionality, and is shown to work better than the existing methods for identifying mutually exclusive operations
Keywords
data flow analysis; high level synthesis; scheduling; CAD; architectural synthesis; behavioral descriptions; data-flow analysis; mutually exclusive operations; operation scheduling; resource binding; system functionality; tabular model; Algorithm design and analysis; Circuit synthesis; Computer science; Data analysis; Delay; Hardware design languages; Integrated circuit interconnections; Processor scheduling; Resource management;
fLanguage
English
Publisher
ieee
Conference_Titel
Design, Automation and Test in Europe, 1998., Proceedings
Conference_Location
Paris
Print_ISBN
0-8186-8359-7
Type
conf
DOI
10.1109/DATE.1998.655898
Filename
655898
Link To Document