DocumentCode
2823570
Title
Module allocation and comparability graphs
Author
Stok, Leon ; Philipsen, Wim J M
Author_Institution
Design Autom. Section, Eindhoven Univ. of Technol., Netherlands
fYear
1991
fDate
11-14 Jun 1991
Firstpage
2862
Abstract
A description is presented of the constraints on the library and the schedule for the module allocation graphs to be comparability graphs. An exact algorithm for module allocation on module allocation graphs that are comparability graphs is presented. This algorithm takes into account the first-order effects of the interconnection weights
Keywords
circuit layout CAD; graph theory; CAD; comparability graphs; exact algorithm; first-order effects; high level data path synthesis; interconnection weights; module allocation graphs; Costs; Design automation; Flow graphs; Heuristic algorithms; Hydrogen; Libraries; Polynomials; Sections;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1991., IEEE International Sympoisum on
Print_ISBN
0-7803-0050-5
Type
conf
DOI
10.1109/ISCAS.1991.176141
Filename
176141
Link To Document