Abstract
Bounded Slice-line Grid (BSG) is an elegant representation of block placement, because it is very intuitionistic and has the advantage of handling various placement constraints. However, BSG has attracted little attention because its evaluation is very time-consuming. This paper proposes a simple algorithm independent of the BSG size to evaluate the BSG representation inO (n log logn) time, wheren is the number of blocks. In the algorithm, the BSG-rooms are assigned with integral coordinates firstly, and then a linear sorting algorithm is applied on the BSG-rooms where blocks are assigned to compute two block sequences, from which the block placement can be obtained inO (n log logn) time. As a consequence, the evaluation of the BSG is completed inO (n log logn) time, wheren is the number of blocks. The proposed algorithm is much faster than the previous graph-basedO (n 2) algorithm. The experimental results demonstrate the efficiency of the algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Murata H, Fujiyoshi K, Nakatake Set al. VLSI module placement based on rectangle-packing by the sequencepair.IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 1996, 15(12): 1518–1524.
Hong X, Huang G, Dong Set al. Corner block list: An effective and efficient topological representation of nonslicing floorplan and its applications. InProc. ICCAD, IEEE/ACM, San Jose, USA, Nov. 2000, pp. 8–12.
Dong S, Zhou S, Hong Xet al. An optimum placement search algorithm based on extended corner block list.Journal of Computer Science and Technology, Nov. 2002, 17(6): 699–707.
Guo P, Cheng C K, Yoshimura T. AnO-tree representation of non-slicing floorplan and its applications. InProc. 36th DAC, IEEE/ACM, New Orleans, USA, 1999, pp. 268–273.
Lin J-M, Chang Y-W. TCG: A transitive closure graphbased representation for non-slicing floorplans. InProc. 38th DAC, IEEE/ACM, Las Vegas, USA, 2001, pp. 764–769.
Chang Y, Wu G, Wu S. B*-tree: A new representation for non-slicing floorplans. InProc. 37th DAC, IEEE/ACM, Los Angeles, USA, 2000, pp. 458–463.
Nakatake S, Fujiyoshi K, Murata Het al. Module packing based on the BSG-structure and IC layout applications.IEEE Trans. Compter-Aided Design of Integrated Circuits and Systems, June 1998, 17(6): 261–267.
Kang M, Dai W. General floorplanning with L-shaped, T-shaped and soft blocks based on bounded slicing grid structure. InProc. ASP-DAC, IEEE/ACM, Chiba, Japan, 1997, pp. 265–270.
Sakanushi K, Nakatake S, Kajitani Y. The multi-BSG: Stochastic approach to an optimum packing of convexrectilinear blocks. InProc. ICCAD 1998, IEEE/ACM, San Jose, USA, 1998, pp. 267–274.
Nakatake S, Furuya M, Kajitani Y. Module placement on BSG-structure with preplaced modules and rectilinear modules. InProc. ASP-DAC, IEEE/ACM, Yokohama, Japan, 1998, pp. 571–576.
McHugh J A. Algorithmic Graph Theory. Prentice Hall, 1990.
Thomas H Cormenet al. Introduction to Algorithms. MIT Press, 2001.
Tang X, Wong M. FAST-SP: A fast algorithm for block placement based on sequence pain. InProc. ASP-DAC 2001, IEEE/ACM, Yokohama, Japan, 2001, pp. 521–526.
Johnson D B. A priority queue in which initialization and queue operations takeO (log logD) time.Mathematical Systems Theory, 1982, 15: 295–309.
P Van Emde Boas, Kaas R, Zijlstra Z. Design and implementation of an efficient priority queue.Mathematical Systems Theory, 1977, 10: 99–127.
Dong S, Hong X, Chen Set al. VLSI module placement with pre-placed modules and with consideration of congestion using solution space smoothing.IEICE Transaction on Fundamentals of Electronics, Communications and Computer Sciences, 2003, E86-A(12): 3136–3147.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by the National Natural Science Foundation of China (Grant Nos.90307005 and 60121120706), Hong Kong RGC Joint Project No.60218004, the National Natural Science Foundation of USA (Grant No. CCR-0096383) and the National Hi-Tech Development 863 Program of China (Grant No.2002AA1Z1460).
Song Chen received the B.S. degree in computer science from Xi'an Jiaotong University in 2000. Since then, he has been a Ph.D. candidate in the Department of Computer Science and Technology, Tsinghua University. His research interests include VLSI layout algorithms and analog and mixedsignal system layout algorithms.
Xian-Long Hong is a fellow of IEEE and a senior member of Chinese Institute of Electronics. He graduated from Tsinghua University, China, in 1964. Since 1988, he has been a professor in the Department of Computer Science and Technology, Tsinghua University. His research interests include VLSI layout algorithms and DA systems.
She-Qin Dong received the B.S. degree (highest honors) in computer science in 1985, M.S. degree in semiconductor physics and device in 1988, and Ph.D. degree in mechantronic control and automation in 1996, all from Harbin Institute of Technology. From 1997 to 1999, he worked as a postdoctoral fellow in the State Key Lab. of CAD&CG in Zhejiang University. He is currently an associate professor at the Department of Computer Science and Technology of Tsinghua University. His current research interests include CAD for VLSI, parallel algorithms, multi-media ASIC and hardware design.
Yu-Chun Ma received B.S. degree in computer science from Xi'an Jiaotong University in 1999 and she is currently a Ph.D. candidate of the Department of Computer Science and Technology, Tsinghua University. Her research interests include algorithms for VLSI automation design, especially floorplanning.
Chung-Kuan Cheng received the B.S. and M.S. degrees in electrical engineering from “Taiwan University”, and the Ph.D. degree in electrical engineering and computer science from the University of California, Berkeley, in 1984. His research interests include network optimization and design automation on microelectronic circuits. Dr. Cheng has been an associate editor of IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems since 1994. He was awarded Fellow of IEEE in 2000.
Jun Gu received B.S. degree in electrical engineering from the University of Science and Technology of China in 1982 and Ph.D. degree in computer science from the University of Utah in 1989. He was a professor of Calgary University in Canada and is currently a professor of the Department of Computer Science in Hong Kong University of Science and Technology. His research interests include the optimization algorithms, local search and global optimization, and their application in VLSI CAD, system engineering, communication and multi-media fields. He is the chief scientist of the National Basic Research 973 Program “The Application Theories and High Performance Software in Information Technology” of China. Dr. Gu is a member of the ACM, AAAI, International Neural Network Society and Sigma Xi, and a senior member of IEEE.