Abstract
The physical design placement problem is one of the hardest and most important problems in micro chips production. The placement defines how to place the electrical components on the chip. We consider the problem as a combinatorial optimization problem, whose instance is defined by a set of 2-dimensional rectangles, with various sizes and wire connectivity requirements. We focus on minimizing the placement area and the total wire-length. We propose a local-search method for coping with the problem, based on natural dynamics common in game theory. Specifically, we suggest to perform variants of Best-Response Dynamics (BRD). In our method, we assume that every component is controlled by a selfish agent, who aim at minimizing his individual cost, which depends on his own location and the wire-length of his connections. We suggest several BRD methods, based on selfish migrations of a single or a cooperative of components. We performed a comprehensive experimental study on various test-benches, and compared our results with commonly known algorithms, in particular, with simulated annealing. The results show that selfish local-search, especially when applied with cooperatives of components, may be beneficial for the placement problem.
This research was supported by The Israel Science Foundations (Grant No. 1036/17).
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
References
Adya, S.N., Markov, I.L.: Combinatorial techniques for mixed-Size placement. ACM Trans. Des. Autom. Electron. Syst. 10(1) (2005). https://doi.org/10.1145/1044111.1044116
Alpert, C.J., Mehta, D.P., Sapatnekar, S.S.: Handbook of Algorithms for Physical Design Automation. Auerbach Publications (2008)
Chang, Y.C., Chang, Y.W., Wu, G.M., Wu, S.W.: B\(^*\)-trees: a new representation for non-slicing floorplans. In: Proceedings of the 37th Annual Design Automation Conference, pp. 458–463 (2000). https://doi.org/10.1145/337292.337541
Chu, C.:. Electronic Design Automation: Synthesis, Verification, and Test, Chapter 11: Placement, pp. 635–685. Springer (2009)
Even-Dar, E., Mansour, Y.: Fast convergence of selfish rerouting. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 772–781 (2005)
Feldman, M., Snappir, Y., Tamir, T.: The efficiency of best-response dynamics. In: Proceedings of the the 10th International Symposium on Algorithmic Game Theory (SAGT) (2017)
Gerez, S.H.: Algorithms for VLSI Design Automation. Wiley, New York (1999)
Ghosal, P., Samanta, T.: Symposium on VLSI Thermal-Aware Placement of Standard Cells and Gate Arrays: Studies and Observations. IEEE Computer Society Annual (2008). https://doi.org/10.1109/ISVLSI.2008.37
Huang, E., Korf, R.E.: Optimal rectangle packing: an absolute placement approach. J. Artif. Intell. Res. 46, 47–87 (2012)
Intel Core \(i7\) processors (2008). www.intel.com/content/www/us/en/products/processors/core/i7-processors.html
Jiang, Z., Chen, H., Chen, T., Chang, Y.: Challenges and solutions in modern VLSI placement. In: International Symposium on VLSI Design, Automation and Test (VLSI-DAT) (2007)
Kleinberg, J., Tardos, E.: Chapter 12: Local Search. Algorithm Design, pp. 690–700. Addison-Wesley (2005)
Khachaturyan, A., Semenovskaya, S., Vainshtein, B.: Statistical-Thermodynamic Approach to Determination of Structure Amplitude Phases. Sov. Phys. Crystallography. 24(5), 519–524 (1979)
Kahng, A.B., Lienig, J., Markov, I.L., Hu, J.: VLSI Physical Design: From Graph Partitioning to Timing Closure. Springer (2011). https://doi.org/10.1007/978-90-481-9591-6
Lengauer, T.: Combinatorial Algorithms for Integrated Circuits. Wiley-Teubner (1990). https://doi.org/10.1007/978-3-322-92106-2
Lin, Y., Yu, B., Xu, X., Gao, J., Viswanathan, N., Liu, W., Li, Z., Alpert, C.J., Pan, D.Z.: MrDP: multiple-row detailed placement of heterogeneous-sized cells for advanced nodes. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst. 37(6), 1237–1250 (2018)
Markov, I.L., Hu, J., Kim, M.: Progress and challenges in VLSI placement research. Proc. IEEE 103(11), 1985–2003 (2015)
Murata, H., Kuh, E.S.: Sequence-pair based placement method for hard/soft/pre-placed modules. In: Proceedings of the International Symposium on Physical Design, pp. 167–172 (1998)
Norman, R., Last, J., Haas, I.: Solid-state micrologic elements. In: Solid-State Circuits Conference. Digest of Technical Papers, pp. 82–83 (1960). https://doi.org/10.1109/ISSCC.1960.1157264
Pattanaik, S., Bhoi, S.P., Mohanty, R.: Simulated annealing based placement algorithms and research challenges. J. Global Res. Comput. Sci. 3(6) (2012)
Quinn, N., Breuer, M.: A forced directed component placement procedure for printed circuit boards. IEEE Trans. Circ. Syst. 26(6) (1979)
Reda, S., Chowdhary, A.: Effective linear programming based placement methods. In: Proceedings of the International Symposium on Physical Design, pp. 186–191 (2006)
Rutenbar, R.A.: Simulated annealing algorithms: an overview. IEEE Circ. Dev. Mag. 5(1), 19–26 (1989)
Shahookar, K., Mazumder, P.: VLSI cell placement techniques. ACM Comput. Surv. 23(2), 143–220 (1991)
Yang, Z., Areibi, S.: Global placement techniques for VLSI physical design automation. In: Proceedings of the 15th International Conference on Computer Applications in Industry and Engineering (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Rapoport, M., Tamir, T. (2021). A Game Theoretical Approach for VLSI Physical Design Placement. In: Fidanova, S. (eds) Recent Advances in Computational Optimization. WCO 2019. Studies in Computational Intelligence, vol 920. Springer, Cham. https://doi.org/10.1007/978-3-030-58884-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-58884-7_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-58883-0
Online ISBN: 978-3-030-58884-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)