DocumentCode
292843
Title
The dynamic locking heuristic-a new graph partitioning algorithm
Author
Hoffmann, Achim G.
Author_Institution
Sch. of Comput. Sci. & Eng., New South Wales Univ., Kensington, NSW, Australia
Volume
1
fYear
1994
fDate
30 May-2 Jun 1994
Firstpage
173
Abstract
In layout design finding efficiently good solutions to the hypergraph bipartitioning problem is of great importance. This paper introduces a new algorithm, the dynamic locking algorithm, which has empirically shown a significant improvement in the partitioning result compared to known algorithms
Keywords
VLSI; circuit layout CAD; graph theory; integrated circuit layout; network topology; VLSI chips; dynamic locking heuristic; graph partitioning algorithm; hypergraph bipartitioning problem; layout design; partitioning result; Australia; Circuit synthesis; Clustering algorithms; Computer science; Heuristic algorithms; Partitioning algorithms; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1994. ISCAS '94., 1994 IEEE International Symposium on
Conference_Location
London
Print_ISBN
0-7803-1915-X
Type
conf
DOI
10.1109/ISCAS.1994.408783
Filename
408783
Link To Document