.png){kind=icon}
返回
A parallel circuit-partitioned algorithm for timing-driven standard cell placement
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.1998.1523.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Simulated annealing based standard cell placement for VLSI designs has long been acknowledged as a computation-intensive process, and as a result, several research efforts have been undertaken to parallelize this algorithm. Parallel placement is most needed for very large circuits. Since these circuits do not fit in memory, the traditional approach has been to partition and place individual modules. This causes a degradation in placement quality in terms of area and wirelength. Our algorithm is circuit-partitioned and can handle arbitrarily large circuits on duster-of-workstations-type parallel machines, such as the Intel Paragon and IBM SP-2. Most previous work in parallel placement has minimized just area and wirelength, but with current deep submicron designs, minimizing wirelength delay is most important. As a result the algorithm discussed in this paper also supports timing driven placement for partitioned circuits. The algorithm, called mpiPLACE, has been tested on several large industry benchmarks on a variety of parallel architectures. (C) 1999 Academic Press.
Keyword:
OPTIMIZATION
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
Strength investigation of a small size floating dock unit by 3D-FEM models in head design waves通过头部设计波中的3D-FEM模型对小型浮船坞单元进行强度研究
OAAI
OAAI分享收藏
查看更多内容