Abstract
We consider the well-known problem of efficient cell placement on a fixed die. We investigate minimization of half perimeter that is required for a design that in turn results into minimal routed wire length and thus wire delay. We describe a new method, Kapees, for large scale standard cell placement. Our technique is based on recursive partitioning of placement circuit which is modeled as a hypergraph. It uses partitioning during the global placement phase and a greedy approach is followed to reduce the wire length during detailed placement phase. Our results show a significant improvement in comparison to Cadence Encounter’s Amoeba and Capo tools by 9% and 5%, respectively.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Caldwell, A.E., Kahng, A.B., Markov, I.L.: Can recursive bisection alone produce routable, placements? In: Proceedings of Design Automation Conference, pp. 477–482 (2000)
Wang, M., Yang, X., Sarrafzadeh, M.: Dragon2000: standard-cell placement tool for large industry circuits. In: Proceedings of IEEE/ACM International Conference on Computer Aided Design (ICCAD), pp. 260–263 (2000)
Agnihotri, A., Yildiz, M.C., Khatkhate, A., Mathur, A., Ono, S., Madden, P.H.: Fractional cut: improved recursive bisection placement. In: Proceedings of International Conference on Computer Aided Design (ICCAD), pp. 307–310 (November 2003)
Sechen, C., Sangiovanni-Vincentelli, A.: The timberwolf placement and routing package. IEEE Journal of Solid-State Circuits 20(2), 510–522 (1985)
Kahng, A.B., Wang, Q.: Implementation and extensibility of an analytic placer. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 24(5), 734–747 (2005)
Cong, J., Xie, M.: A robust detailed placement for mixed-size ic designs. In: Proceedings of Asia and South Pacific Conference on Design Automation, pp. 188–194 (January 2006)
Shahookar, K., Mazumder, P.: VLSI cell placement techniques. ACM Computing Surveys 23(2), 143–220 (1991)
Chang, C.C., Cong, J., Romesis, M., Xie, M.: Optimality and scalability study of existing placement algorithms. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 23(4), 537–549 (2004)
Alpert, C.J., Caldwell, A.E., Kahng, A.B., Markov, I.L.: Hypergraph partitioning with fixed vertices (VLSI CAD). IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 19(2), 267–272 (2000)
Selvakkumaran, N., Karypis, G.: Theto - a fast and high-quality partitioning driven global placer. Technical report, in university of minnesota - computer science and engineering technical reports (2003)
Chen, T.C., Hsu, T.C., Jiang, Z.W., Chang, Y.W.: Ntuplace: a ratio partitioning based placement algorithm for large-scale mixed-size designs. In: Proceedings of the 2005 International Symposium on Physical Design, ISPD 2005, pp. 236–238. ACM, New York (2005)
Capo: Tool, http://vlsicad.eecs.umich.edu/BK/PDtools/tar.gz/Placement-bin/ (accessed 17 January 2013)
Karypis, G., Kumar, V.: Multilevel k-way hypergraph partitioning. In: Proceedings of 36th Design Automation Conference, pp. 343–348 (1999)
Kennings, A., Markov, I.: Analytical minimization of half-perimeter wirelength. In: Proceedings of Design Automation Conference (ASP-DAC), pp. 179–184 (June 2000)
Yang, X., Choi, B.K., Sarrafzadeh, M.: A standard-cell placement tool for designs with high row utilization. In: Proceedings of the 2002 IEEE International Conference on Computer Design: VLSI in Computers and Processors, pp. 45–47 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pawanekar, S., Kapoor, K., Trivedi, G. (2013). Kapees: A New Tool for Standard Cell Placement. In: Gaur, M.S., Zwolinski, M., Laxmi, V., Boolchandani, D., Sing, V., Sing, A.D. (eds) VLSI Design and Test. Communications in Computer and Information Science, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-42024-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-42024-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-42023-8
Online ISBN: 978-3-642-42024-5
eBook Packages: Computer ScienceComputer Science (R0)