A fast minimum cost flow algorithm for VLSI layout compaction

A fast minimum cost flow algorithm for VLSI layout compaction

Since the layout compaction problem is dual to the minimum cost flow problem, flow algorithms can be applicable to the layout compaction. In this paper, an existing flow algorithm is investigated in terms of the layout compaction, and a fast flow algorithm is devised on the basis of the primal-dual...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Arungsrisangchai, I., Shigehiro, Y., Shirakawa, I., Takahashi, H.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Compaction
Computer science
Constraint optimization
Constraint theory
Costs
Information systems
Linear programming
Productivity
Systems engineering and theory
Very large scale integration
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Since the layout compaction problem is dual to the minimum cost flow problem, flow algorithms can be applicable to the layout compaction. In this paper, an existing flow algorithm is investigated in terms of the layout compaction, and a fast flow algorithm is devised on the basis of the primal-dual method. Experimental results show that the proposed algorithm is the fastest dedicatedly for the compaction problem.
DOI:10.1109/ISCAS.1997.621455