TY - GEN
T1 - Circuit partitioning algorithms
T2 - 2nd Annual International Symposium on Algorithms, ISA 1991
AU - Asano, Tetsuo
AU - Tokuyama, Takeshi
N1 - Funding Information:
*This work was partially supported by Grant in Aid for Scientific Research of the Ministry of Education, Science and Cultures of Japan
Funding Information:
Acknowledgment The first author would like to thank Dr. R. S. Teay at IBM Watson Research Center for introducing the problem. The authors would also like to thank Dr. J. Matousek for his valuable discussion. This work was partially supported by Grant in Aid for Scientific Research of the Ministry of Education, Science and Cultures of Japan.
Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1991.
Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.
PY - 1991
Y1 - 1991
N2 - One of the most important problems in VLSI layout design is a circuit partitioning problem, for which a number of algorithms have been presented. Given a set of modules together with a net list, the problem here is to find an optimal partition of the module set into two so that the areas occupied by modules are comparable in the two sides and the number of interconnections between two sides is minimized. For this problem this paper compares the method based on graph representation with the one of solving the bipartition problem after mapping modules into points in the plane.
AB - One of the most important problems in VLSI layout design is a circuit partitioning problem, for which a number of algorithms have been presented. Given a set of modules together with a net list, the problem here is to find an optimal partition of the module set into two so that the areas occupied by modules are comparable in the two sides and the number of interconnections between two sides is minimized. For this problem this paper compares the method based on graph representation with the one of solving the bipartition problem after mapping modules into points in the plane.
UR - http://www.scopus.com/inward/record.url?scp=85031296234&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85031296234&partnerID=8YFLogxK
U2 - 10.1007/3-540-54945-5_53
DO - 10.1007/3-540-54945-5_53
M3 - Conference contribution
AN - SCOPUS:85031296234
SN - 9783540549451
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 94
EP - 103
BT - ISA 1991 Algorithms - 2nd International Symposium on Algorithms, Proceedings
A2 - Lee, R.C.T.
A2 - Hsu, Wen-Lian
PB - Springer Verlag
Y2 - 16 December 1991 through 18 December 1991
ER -