Using Eigenvectors to Partition Circuits

References

• Alpert C. J. The ISPD98 circuit benchmark suite. Proc. 1998 Internat. Sympos. Physical Design. (1998) (ACM Press, New York) 80–85Crossref, Google Scholar
• Alpert C. J., Kahng A. B., Yao S. Z. Spectral partitioning with multiple eigenvectors. Discrete Appl. Math. (1999) 90:3–26Crossref, Google Scholar
• Alpert C. J., Caldwell A. E., Kahng A. B., Markov I. Hypergraph partitioning with fixed vertices. IEEE Trans. Comput.-Aided Design Circuits Systems (2000) 19:267–272Crossref, Google Scholar
• Barnes E. R. An algorithm for partitioning the nodes of a graph. SIAM J. Algebraic Discrete Methods (1982) 3:541–550Crossref, Google Scholar
• Caldwell A., Markov I., Kahng A. B. The ISPD99 benchmark suite. (1999) Google Scholar
• Chan P. K., Schlag M., Zien J. Spectral K-way ratio-cut partitioning. IEEE Trans. Comput.-Aided Design Integrated Circuits Systems (1994) 13:1088–1096Crossref, Google Scholar
• Demmel J. W.Applied Numerical Linear Algebra (1997) (Society of Industrial and Applied Mathematics Press, Philadelphia, PA) Crossref, Google Scholar
• Fiedler M. Algebraic connectivity of graphs. Czechoslovak Math. J. (1973) 23:298–305Crossref, Google Scholar
• Frankle J., Karp R. M. Circuit placements and cost bounds by eigenvector decomposition. Proc. 1986 Internat. Conf. Comput.-Aided Design, San Jose, CA (1986) (ACM Press, New York) 414–417Google Scholar
• Hall K. M. An r-dimensional quadratic placement algorithm. Management Sci. (1970) 17:219–229Link, Google Scholar
• Hendrickson B., Leland R., van Driessche R. Enhancing data locality by using terminal propagation. Proc. 29th Hawaii Internat. Conf. System Sci. (1996) 565–574Crossref, Google Scholar
• Ihler E., Wagner D., Wagner F. Modelling hypergraphs by graphs with the same mincut properties. Inform. Processing Lett. (1993) 45:171–175Crossref, Google Scholar
• Karypis G., Kumar V. hMETIS: A hypergraph partitioning package, version 1.5.3. (1998) (Department of Computer Science/Army HPC Research Center, University of Minnesota, Minneapolis, MN) Google Scholar
• Karypis G., Aggarwal R., Kumar V., Shekhar S. Multilevel hypergraph partitioning: Application in VLSI domain. Proc. 34th ACM/IEEE Design Automation Conf. (1997) (ACM Press, New York) 526–529Crossref, Google Scholar
• Kozminski K. Benchmarks for layout synthesis-evolution and current status. Proc. 28th IEEE/ACM Design Automation Conf. (1991) (ACM Press, New York) 265–270Google Scholar
• Otten R. H. J. M. Eigensolutions in top-down layout design. Proc. Internat. Sympos. Circuits Systems (1982) (IEEE Press, Piscataway, NJ) 1017–1020Google Scholar
• Pothen A., Simon H. D., Liou K. P. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. (1990) 11:430–452Crossref, Google Scholar
• Riess B. M., Doll K., Johannes F. M. Partitioning very large circuits using analytical placement techniques. Proc. ACM Design Automation Conf. (1994) (ACM Press, New York) 646–651Crossref, Google Scholar
• Tsay R.-S., Kuh E. S. A unified approach to partitioning and placement. IEEE Trans. Circuits Systems (1991) 38:521–533Crossref, Google Scholar
• Watkins D. S.Fundamentals of Matrix Computations (1991) (Wiley, New York) Google Scholar