skip to main content
10.1145/3287624.3287675acmconferencesArticle/Chapter ViewAbstractPublication PagesaspdacConference Proceedingsconference-collections
research-article

A shape-driven spreading algorithm using linear programming for global placement

Published: 21 January 2019 Publication History

Abstract

In this paper, we consider the problem of finding the global shape for placement of cells in a chip that results in minimum wirelength. Under certain assumptions, we theoretically prove that some shapes are better than others for purposes of minimizing wirelength, while ensuring that overlap-removal is a key constraint of the placer. We derive some conditions for the optimal shape and obtain a shape which is numerically close to the optimum. We also propose a linear-programming-based spreading algorithm with parameters to tune the resultant shape and derive a cost function that is better than total or maximum displacement objectives, that are traditionally used in many numerical global placers. Our new cost function also does not require explicit wirelength computation, and our spreading algorithm preserves to a large extent, the relative order among the cells placed after a numerical placer iteration. Our experimental results demonstrate that our shape-driven spreading algorithm improves wirelength, routing congestion and runtime compared to a bi-partitioning based spreading algorithm used in a state-of-the-art academic global placer for FPGAs.

References

[1]
Ulrich Brenner and Markus Struzyna, "Faster and Better Global Placement by a New Transportation Algorithm", Design Automation Conference, 2005
[2]
Peter Spindler and Ulf Schlichtmann, "Kraftwerk2-A Fast Force-Directed Quadratic Placement Approach Using an Accurate Net Model", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (Volume:27, Issue: 8), 2008
[3]
Tung-Chieh Chen, Zhe-Wei Jiang, Tien-Chang Hsu, Hsin-Chen Chen, and Yao-Wen Chang, "NTUplace3: An Analytical Placer for Large-Scale Mixed-Size Designs With Preplaced Blocks and Density Constraints", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (Volume: 27, Issue: 7), 2008
[4]
Jingwei Lu, Pengwen Chen 2, Chin-Chih Chang, Lu Sha, Dennis J-.H. Huang, Chin-Chi Teng and Chung-Kuan Cheng, "ePlace: Electrostatics Based Placement Using Nesterovs Method", Design Automation Conference, 2014
[5]
Tao Lin, Chris Chu, Joseph R. Shinnerl, Ismail Bustany and Ivailo Nedelchev, "POLAR: A High Performance Mixed-Size Wirelengh-Driven Placer With Density Constraints", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (Volume:34, Issue: 3), 2015
[6]
Wuxi Li, Shounak Dhar and David Z. Pan, "UTPlaceF: A Routability-Driven FPGA Placer with Physical and Congestion Aware Packing", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (Volume:37, Issue:4), 2018
[7]
Ameya R. Agnihotri and Patrick H. Madden, "Fast Analytic Placement using Minimum Cost Flow", Asia and South Pacific Design Automation Conference, 2007
[8]
Ulrich Brenner, Anna Pauli and Jens Vygen, "Almost Optimum Placement Legalization by Minimum Cost Flow and Dynamic Programming", International Symposium on Physical Design, 2004
[9]
Nima Karimpour Darav, Ismail S. Bustany, Andrew Kennings, David Westwick and Laleh Behjat, "Eh?Legalizer: A High Performance Standard-Cell Legalizer Observing Technology Constraints", ACM Transactions on Design Automation of Electronic Systems, (Volume: 23, Issue: 4), May 2018
[10]
Ulrich Brenner, "BonnPlace Legalization: Minimizing Movement by Iterative Augmentation", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (Volume: 32, Issue: 8), 2013
[11]
Minsik Cho, Haoxing Ren, Hua Xiang and Ruchir Puri, "History-based VLSI legalization using network flow", Design Automation Conference, 2010
[12]
http:/www.ispd.cc/contests/16/ispd2016_contest.html

Cited By

View all
  • (2019)FPGA-Accelerated Spreading for Global Placement2019 IEEE High Performance Extreme Computing Conference (HPEC)10.1109/HPEC.2019.8916251(1-7)Online publication date: Sep-2019

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ASPDAC '19: Proceedings of the 24th Asia and South Pacific Design Automation Conference
January 2019
794 pages
ISBN:9781450360074
DOI:10.1145/3287624
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

In-Cooperation

  • IEICE ESS: Institute of Electronics, Information and Communication Engineers, Engineering Sciences Society
  • IEEE CAS
  • IEEE CEDA
  • IPSJ SIG-SLDM: Information Processing Society of Japan, SIG System LSI Design Methodology

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 January 2019

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Conference

ASPDAC '19
Sponsor:

Acceptance Rates

Overall Acceptance Rate 466 of 1,454 submissions, 32%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)6
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2019)FPGA-Accelerated Spreading for Global Placement2019 IEEE High Performance Extreme Computing Conference (HPEC)10.1109/HPEC.2019.8916251(1-7)Online publication date: Sep-2019

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media