Abstract
The main objective of the module placement problem is to place a set of modules such as standard cells, gate arrays, and sea-of-gates on a very large and highly complex chip and minimize the total wire-length between the modules, given a special netlist which addresses the connectivity between the modules. Our attention is mainly focus on the global placement based on two assumptions that all modules are point module, i.e. are of equal size and the connections to the nets are assumed to be at the center of the module and all nets are two-pin nets. Multi-pin nets are processed and replaced with two-pin nets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C-K. Cheng and E. S. Kuh. Module placement based on resistive network optimization.IEEE Transactions on Computer-Aided Design of Integrated CircuitsandSystems, 3:218–225, 1984.
G. H. Golub and C. F. Van Loan.Matrix Computations.Johns Hopkins University Press, Baltimore, 2nd edition, 1989.
K. Hall. An r-dimensional quadratic placement algorithm.Management Science17(3):219–229, November 1970.
C. Lanczos. An iteration method for the solution of the eigenvalues problem of linear differential and integral operators.Journal of Research of National Bureau of Standards45:255–282, 1950.
C. C. Paige and M. A. Saunders. Solution of sparse indefinite systems of linear equations.SIAMJournalon Numerical Analysis, 12(4):617–629, 1975.
C. Sechen and A. Sangivovanni-Vincentelli. The TimberWolf placement and routing package.IEEEJournalfor Solid State Circuits, SC-20:510–522, 1985.
R-S. Tsay and E. Kuh. A fast sea-of-gates placement algorithm. InProceedings of 25th ACM/IEEE Design Automation Conferencepages 318–322, 1988.
R-S. Tsay, E. Kuh, and C-P. Hsu. Module placement for large chips based on sparse linear equations.InternationalJournalof Circuit Theory and Applications,16:411423, 1988.
Z. Xing and P. Banerjee. A parallel hierarchical algorithm for module placement based on sparse linear equations. InProceedings of the 1996InternationalConference on Circuits and Systems, Atlanta, GA, May 1996.
T. Yang. An efficient hierarchical algorithm for module placement for large chips. In Proceedings ofThe 7thInternationalSymposium on Integrated Circuits,Technology,SystemsandApplications (ISIC-97), September 1997. Singapore.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Yang, T. (2001). An Efficient Parallel Hierarchical Algorithm for Module Placement. In: Ebisuzaki, T., Makino, J. (eds) New Horizons of Computational Science. Astrophysics and Space Science Library, vol 263. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-0864-8_38
Download citation
DOI: https://doi.org/10.1007/978-94-010-0864-8_38
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-3848-5
Online ISBN: 978-94-010-0864-8
eBook Packages: Springer Book Archive