skip to main content
10.1145/330855.330988acmconferencesArticle/Chapter ViewAbstractPublication PagesglsvlsiConference Proceedingsconference-collections
Article
Free access

Parallel algorithms for FPGA placement

Published: 02 March 2000 Publication History

Abstract

Fast FPGA CAD tools that produce high quality results has been one of the most important research issues in the FPGA domain. Simulated annealing has been the method of choice for placement. However, simulated annealing is a very compute-intensive method. In our present work we investigate a range of parallelization strategies to speedup simulated annealing with application to placement for FPGA. We present experimental results obtained by applying the different parallelization strategies to the Versatile Place and Route (VPR) Tool, implemented on an SGI Origin shared memory multi-processor and an IBM-SP2 distributed memory multi-processor. The results show the tradeoff between execution time and quality of result for the different parallelization strategies.

References

[1]
J. A. Chandy, S. Kim, B. Ramkumar, S. Parkes and P. Banerjee. An Evaluation of Parallel Simulated Annealing Strategies with Applications to Standard Cell Placement. In IEEE Trans. on Computer Aided Design, Vo1.16, April 1997, pp.398-410.
[2]
J. A. Chandy and P. Banerjee. Parallel Simulated Annealing Strategies for VLSI Cell Placement. In Proc. 9th International Conference on VLSI Design, Bangalore- India, Jan. 1996.
[3]
P. Banerjee, M. H. Jones and J. S. Sargent. Parallel simulated annealing algorithms for standard cell placement on hypercube multiprocessors. In IEEE Trans. on Parallel and Distributed Systems, Vol.1, Jan. 1990, pp.91-106.
[4]
S. Kim, J. A. Chandy, S. Parkes, B. Ramkumar and P. Banerjee. ProperPLACE: A portable parallel algorithm for cell placement. In Prec. of International Parallel Processing Symposium, Cancun- Mexico, Apr.1994, pp.932-941.
[5]
S. Y. Lee and K. G. Lee. Asynchronous communication of multiple Markov Chains in parallel Simulated Annealing. In Prec. international Conference on Parallel Processing,Aug. 1992,Vo1.I I I,pp. 169-176.
[6]
W. J. Sun and C. Sechen. A loosely coupled parallel algorithm for standard cell placement. In Digest of papers, International Conference on Computer Aided Design,San Jose,Nov. 1994,pp.137-144.
[7]
C. Sechen and K. W. Lee. An improved simulated annealing algorithm for row-based placement. In Digest of papers, International Conference on Computer Aided Design,Santa Clara,Nov. 1987:pp.478-481.
[8]
J. S. Rose, W. M. Snelgrove and Z. G. Vranesic. Parallel cell placement algorithms with quality equivalent to simulated annealing. In IEEE Trans. Computer Aided Design, Vol.7, Mar. 1988, pp.387-396.
[9]
S. A. Kravitz and R. A. Rutenbar. Placement by simulated annealing on a multiprocessor.ln IEEE Trans. Computer Aided Design,Vol.CAD-6,July 1987,pp.534-549.
[10]
A. Casotto: F. Romeo and A. Sangiovanni-Vincentelli. A parallel simulated annealing algorithm for the placement of macro-cells. In IEEE Trans. Computer Aided Design,Vol.CAD-6,Sept. 1987,pp.838-847.
[11]
S. Brown and J. Rose. FPGA and CPLD Architectures: A Tutorial. In IEEE Design and Test of Computers, Vol.12, Summer 1996, pp.42-57.
[12]
J. Rose and D. Hill. Architectural and Physical Design Challenges for One-Million Gate FPGAs and Beyond. In FPGA'97, ACM Syrup. or, FPGAs, Feb. 1997, pp.129-i32.
[13]
V. Betz and J. Rose. VPR: A New Packing, Placement and Routing Tool for FPGA Research. In 7th International Workshop on Field-Programmable Logic, Londan, August 1997, pp. 213-222.
[14]
M. Huang, F. Romeo and A. Sangiovanni-Vincenteili. An Efficient General Cooling Schedule for Simulated Annealing. In 1CCAD, 1986,pp.381-384.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
GLSVLSI '00: Proceedings of the 10th Great Lakes symposium on VLSI
March 2000
196 pages
ISBN:1581132514
DOI:10.1145/330855
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 ACM 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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 March 2000

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

GLSVLSI00
Sponsor:
  • SIGDA
  • IEEE
  • Northwestern University
GLSVLSI00: Tenth Great Lakes Symposium on VLSI
March 2 - 4, 2000
Illinois, Chicago, USA

Acceptance Rates

Overall Acceptance Rate 312 of 1,156 submissions, 27%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)73
  • Downloads (Last 6 weeks)13
Reflects downloads up to 23 Dec 2024

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media