Module allocation and comparability graphs

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.<<ETX>>

[1]  Wolfgang Rosenstiel,et al.  System synthesis using behavioural descriptions , 1990, Proceedings of the European Design Automation Conference, 1990., EDAC..

[2]  C. Lekkeikerker,et al.  Representation of a finite graph by a set of intervals on the real line , 1962 .

[3]  Fadi J. Kurdahi,et al.  Module assignment and interconnect sharing in register-transfer synthesis of pipelined data paths , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[4]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[5]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[6]  Daniel P. Siewiorek,et al.  Automated Synthesis of Data Paths in Digital Systems , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.