Loosely coupled parallel algorithm for standard cell placement

被引：0

作者：

Sun, Wern-Jieh ^{[1
]}

Sechen, Carl ^{[1
]}

机构：

[1] Univ of Washington, Seattle, United States

来源：

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems | 1994年

关键词：

Benchmark circuits - Heuristic spanning - Interprocessor communication - Loosely coupled parallel algorithm - Low temperature annealing phase - Parallelism - Processor utilization efficiency - Shared memory multiprocessor - Standard cell placement - UNIX workstations;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We present a loosely coupled parallel algorithm for the placement of standard cell integrated circuits. Our algorithm is a derivative of simulated annealing. The implementation of our algorithm is targeted toward networks of UNIX workstations. This is the very first reported parallel algorithm for standard cell placement which yields as good or better placement algorithm reported which addition, it is the first parallel placement algorithm reported which offers nearly linear speedup, in terms of the number of processors (workstations) used, over the serial version. Despite using the rather slow local area network as the only means of interprocessor communication, the processor utilization is quite high, up to 98% for 2 processors and 90% for 6 processors. The new parallel algorithm has yielded the best overall results ever reported for the set of MCNC standard cell benchmark circuits.

引用

页码：137 / 144

共 50 条

[21] PAFLO: A fast standard-cell detailed placement algorithm
Zhou, HB
Wu, WM
Hong, XL
2002 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS AND WEST SINO EXPOSITION PROCEEDINGS, VOLS 1-4, 2002, : 1401 - 1405
[22] A new timing-driven standard cell placement algorithm
Chi, JC
Feng, JM
Chi, MC
2003 INTERNATIONAL SYMPOSIUM ON VLSI TECHNOLOGY, SYSTEMS, AND APPLICATIONS, PROCEEDINGS OF TECHNICAL PAPERS, 2003, : 184 - 187
[23] Congestion driven incremental placement algorithm for standard cell layout
ACM SIGDA; IEEE Circuits and Systems Society; IEICE (Institute of Electronics, Information and Communication Engineers); IPSJ (Information Processing Society of Japan) (Institute of Electrical and Electronics Engineers Inc., United States):
[24] SOLVING PDEs ON LOOSELY-COUPLED PARALLEL PROCESSORS.
Gropp, William D.
Parallel Computing, 1986, 5 (1-2): : 165 - 173
[25] A Parallel Clustering Algorithm for Placement
Momeni, Amir
Mistry, Perhaad
Kaeli, David
PROCEEDINGS OF THE FIFTEENTH INTERNATIONAL SYMPOSIUM ON QUALITY ELECTRONIC DESIGN (ISQED 2014), 2015, : 349 - 356
[26] An optimal pin assignment algorithm with improvement of cell placement in standard cell layout
Wakabayashi, S
Kishimoto, Y
Koide, T
APCCAS '96 - IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS '96, 1996, : 381 - 384
[27] Study on the hydrodynamic aggregation of parallel self-propelled flexible plates based on a loosely coupled partitioned algorithm
Zhang, Lei
Wang, Chizhong
Sun, Jianglong
Xie, De
OCEAN ENGINEERING, 2021, 223
[28] Asynchronous MMC based parallel SA schemes for multiobjective standard cell placement
Sait, Sadiq M.
Zaidi, Ali Mustafa
Ali, Mustafa Imran
2006 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-11, PROCEEDINGS, 2006, : 4615 - +
[29] An Adaptive Hybrid Genetic Algorithm for VLSI Standard Cell Placement Problem
Chen, Xiongfeng
Lin, Geng
Chen, Jianli
Zhu, Wenxing
2016 3RD INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND CONTROL ENGINEERING (ICISCE), 2016, : 163 - 167
[30] LOCAL UNIFORM MESH REFINEMENT ON LOOSELY-COUPLED PARALLEL PROCESSORS
GROPP, WD
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1988, 15 (05) : 375 - 387

← 1 2 3 4 5 →