No abstract

The global routing problem is formulated as a multiterminal, multicommodity flow problem with integer flows. An epsilon bound 2-terminal multicommodity flow algorithm with fractional flows is adapted to handle multitermirtal commodities. We show that under certain conditions, our approach derives an approximate optimal solution. The experimental results with benchmark data are quite promising.

No abstract

Multichip Module (MCM) technologies introduce new levels of complexity in the design and analysis of systems. As a result, early assessment of feasibility and cost are crucial to a successful design effort. We propose an efficient but effective global router based on a multiterminal multicommodity flow model to perform the estimation.

No abstract