Skip to main content
SpringerLink
Log in

Deterministic VLSI block placement algorithm using Less Flexibility First principle

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In this paper, a simple while effective deterministic algorithm for solving the VLSI block placement problem is proposed considering the packing area and interconnect wiring simultaneously. The algorithm is based on a principle inspired by observations of ancient professionals in solving their similar problems. Using the so-called Less Flexibility First principle, it is tried to pack blocks with the least packing flexibility on its shape and interconnect requirement to the empty space with the least packing flexibility in a greedy manner. Experimental results demonstrate that the algorithm, though simple, is quite effective in solving the problem. The same philosophy could also be used in designing efficient heuristics for other hard problems, such as placement with preplaced modules, placement with L/T shape modules, etc.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Kirkpatrick S. Optimization by simulated annealing.Science 100, 1983, pp. 671–680.

    Article  MathSciNet  Google Scholar 

  2. Rebaudengo M, Reorda M S. GALLO: A genetic algorithm for floorplan area optimization.IEEE Tran. CAD, 1995, 15(8): 943–951.

    Google Scholar 

  3. Wong D F, Liu C L. A new algorithm for floorplan design. InProc. 23rd ACM/IEEE Design Automation Conference (DAC), 1986, pp. 101–107.

  4. Onodera H, Taniguchi Y, Tamaru K. Branch-and-bound placement for building block layout. In28th ACM/IEEE DAC, USA, 1991, pp. 433–439.

  5. Murata H, Fujyoshi K, Nakatake Set al. Rectangularpacking-based module placement.ACM/IEEE Int. Conf. Computer Aided Design (ICCAD), USA. 1995, pp. 472–479.

  6. Nakatake S, Fujiyoshi K, Murata H, Kajitani Y. Module placement on BSG-structure and IC layout applications.ACM/IEEE ICCAD, USA, 1996, pp. 484–491.

  7. Xu J, Guo P N, Cheng C K. Cluster refinement for block placement. In34th ACM/IEEE Design Automation Conference (DAG), USA, 1997, pp. 762–765.

  8. Guo P N, Cheng C K, Yoshimura T. An O-tree representation of non-slicing floorplan and its applications. In36th ACM/IEEE Design Automation Conference (DAC), USA, 1999, pp. 268–273.

  9. Hong Xianlong, Huang Gang, Cai Yiciet al. Corner block list: An efficient and effective topological representation of non-slicing floorplan.ACM/IEEE 2000 Int. Conf. Computer Aided Design (ICCAD), USA, 2000, pp. 8–12.

  10. Bentley J L. Multidimensional binary search trees used for associative searching.Communication of ACM, 1975, 18(9): 509–517.

    Article  MATH  MathSciNet  Google Scholar 

  11. Dong Sheqin, Hong Xianlong, Qi Xinet al. VLSI module placement with pre-placed modules and with consideration of congestion using solution space smoothing.ACM/IEEE ASP-DAC, Japan 2003, pp.741–744.

  12. Zhong Xiu. Research on the less flexibility first optimization algorithm [thesis]. Dept. of Comput, Sci. & Tech, Tsinghua Univ., 2002.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Tsinghua University, 100084, Beijing, P.R. China

    Dong SheQin & Hong XianLong

  2. Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong, P.R. China

    Wu YuLiang

  3. Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong, P.R. China

    Gu Jun

Authors
  1. Dong SheQin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hong XianLong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wu YuLiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gu Jun
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dong SheQin.

Additional information

This work is supported by the National Natural Science Foundation of China (Grant No.60218004) and the National Grand Fundamental Research 973 Program of China (Grant No.G19980304111).

DONG SheQin received the B.S. degree in computer science in 1985, M.S. degree in semiconductor physics and device in 1988, and Ph.D. degree in mechanical 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 at Zhejiang University. He is currently an associate professor of the Department of Computer Science and Technology, Tsinghua University. His current research interests include CAD for VLSI, parallel algorithms, multi-media ASIC and hardware design.

WU YuLiang finished his B.S. and M.S. degrees in computer science at Florida International University and University of Miami in 1983 and 1984 respectively. He received Ph.D. degree in electrical and computer engineering from University of California at Santa Barbara in 1994. Before he joined the Chinese University of Hong Kong in Junuary 1996, he had worked at Cadence Design Systems Incorporation as a senior MTS since December 1994, where he worked in the R&D of the silicon synthesis product (PBS) targeting at binding the gap between logic and physical level optimizations for deep-submicron chip designs. His current research interests are mainly related to hard optimization problems in object packings, optimal FPGA architecture designs, and logical/physical design automation (CAD) of VLSI designs.

For the biography ofHONG XianLong/GU Jun please refer to P.639, No.5, Vol.18 of this journal.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dong, S., Hong, X., Wu, Y. et al. Deterministic VLSI block placement algorithm using Less Flexibility First principle. J. Comput. Sci. & Technol. 18, 739–746 (2003). https://doi.org/10.1007/BF02945462

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02945462

Keywords

Search

Navigation