A Non-Slicing Floorplanning and Placement Algorithm Using a New Constraint Graph Based Model
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    To use a stochastic optimization algorithm to search an optimum placement, the representation of the configuration of a placement is the most important and fundamental issue. A new Constraint Graph based representation SL was devised in the paper to represent the non slicing structure of placement. A nearly O(n) placement algorithm can be designed over the SL representation. With the assumption of the meta grid, we can derive a new concise representation for non slicing structures from SL representation.With assumption of the meta-grid,we can derive a new concise representation for non-slicing structures from SL.We name the new representation as Stairway Grid(SG)model.It needs n(2「lg n」)bits fora placement of nrectangular blocks.The solution space of SGrepresentation,it takes onlyO(n)time to transform it to its corresponding placement.It had been proved that all slicing structures could be represented by SG.And SGmodel also can represent non-slicing structure.Experimental results on SG model demonstrated that it is a concise and effective representation of non-slicing structure.

    Reference
    Related
    Cited by
Get Citation

董社勤,洪先龙,黄钢,顾均.基于新约束图模型的布图规划和布局算法.软件学报,2001,12(11):1586-1594

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063