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