Congestion Minimization in Modern Placement Circuits

Taghavi, Taraneh; Yang, Xiaojian; Choi, Bo-Kyung; Wang, Maogang; Sarrafzadeh, Majid

doi:10.1007/978-0-387-68739-1_6

Cited by 2 publications

(3 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The average runtimes for sPL and abcPL are shown in Figure 20 Figure 13: Quality ratios on PEKU with 1% nonlocal nets. 6,8,10,12,14,16, and 18 for the variation of the wirelength and in Figures 5,7,9,11,13,15,17,and 19 for the variation of the quality ratio. This trend is similar to the performance improvement of Dragon and abcPL.…”

Section: Resultsmentioning

confidence: 98%

“…Dragon [9,16] is a top-down hierarchical placement tool that deploys min-cut based partitioning and simulated annealing to place designs with thousands of macroblocks and millions of standard cells. Dragon emphasizes congestion during placement, in addition to traditional wirelength minimization.…”

Section: Related Workmentioning

confidence: 99%

“…Simulated annealing (SA) has been heavily researched for SCP and has proven to be successful (e.g., Dragon [16]). Dragon replaces the current solution by a random neighboring state solution constructed from the current solution by moving a randomly selected cell or groups of cells to a new position.…”

Section: Spl Placermentioning

confidence: 99%

See 2 more Smart Citations

A Swarm Random Walk Based Method for the Standard Cell Placement Problem

Altwaijry

Menaï

2014

Mathematical Problems in Engineering

View full text Add to dashboard Cite

The standard cell placement (SCP) problem is a well-studied placement problem, as it is an important step in the VLSI design process. In SCP, cells are placed on chip to optimize some objectives, such as wirelength or area. The SCP problem is solved using mainly four basic methods: simulated annealing, quadratic placement, min-cut placement, and force-directed placement. These methods are adequate for small chip sizes. Nowadays, chip sizes are very large, and hence, hybrid methods are employed to solve the SCP problem instead of the original methods by themselves. This paper presents a new hybrid method for the SCP problem using a swarm intelligence-based (SI) method, called SwarmRW (swarm random walk), on top of a min-cut based partitioner. The resulting placer, called sPL (swarm placer), was tested on the PEKU benchmark suite and compared with several related placers. The obtained results demonstrate the effectiveness of the proposed approach and show that sPL can achieve competitive performance.

show abstract