Parallel algorithms for slicing based final placement

Abstract: "This paper presents parallel algorithms for solving the final placement problem of rectangular modules assuming predefined neighborhood relations between the modules to be placed. By enumerating all arrangements, i.e. slicing structures, of local module subsets optimum solutions are...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Spruth, Henning (VerfasserIn)
Weitere Verfasser:	Sigl, Georg (VerfasserIn), Johannes, Frank M. (VerfasserIn)
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	München 1992
Schriftenreihe:	Technische Universität <München>: TUM-I 9209
Schlagworte:	Combinatorial optimization > Integrated circuits > Very large scale integration
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Bestellen

Beschreibung
Zusammenfassung:	Abstract: "This paper presents parallel algorithms for solving the final placement problem of rectangular modules assuming predefined neighborhood relations between the modules to be placed. By enumerating all arrangements, i.e. slicing structures, of local module subsets optimum solutions are obtained. They are combined in a global evaluation step such that the local solutions fit well into the global arrangement. Increased size of the enumerated local subproblems leads to placements that are closer to global optimum. However, this requires significantly larger computing resources. Parallel computers provide huge amounts of computing power and distributed memory that can be used to meet these high computational demands Therefore, we propose new algorithms for the enumeration on message-passing parallel computers. Experimental results show that significant speedups as well as better results can be achieved.
Beschreibung:	14 S. graph. Darst.