Journal of Computer Science and Technology
Quick Search in JCST
 Advanced Search 
      Home | PrePrint | SiteMap | Contact Us | FAQ
 
Indexed by   SCIE, EI ...
Bimonthly    Since 1986
Journal of Computer Science and Technology 2003, Vol. 18 Issue (6) :0-0    DOI:
Articles Current Issue | Archive | Adv Search << | >>
Deterministic VLSI Block Placement Algorithm Using Less Flexibility First Principle

Abstract
Reference
Related Articles
Download: [PDF 359KB]     Export: BibTeX or EndNote (RIS)  
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.
Articles by authors
DONG SheQin
HONG XianLong
WU YuLiang GU Jun
KeywordsVLSI floorplanning   placement   NP-hard   VLSI physical design     
Revised 2003-11-10
Cite this article:   
DONG SheQin , HONG XianLong , WU YuLiang and GU Jun .Deterministic VLSI Block Placement Algorithm Using Less Flexibility First Principle[J]  Journal of Computer Science and Technology, 2003,V18(6): 0-0
URL:  
http://jcst.ict.ac.cn:8080/jcst/EN/
Copyright 2010 by Journal of Computer Science and Technology