A SA-based parallel method for FPGA placement
- 1 January 2018
- journal article
- research article
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Electronics Express
- Vol. 15 (24) , 20180943
Abstract
In this paper, we present a serially-equivalent parallel method to accelerate FPGA placement. Our method is based on Simulated Annealing(SA) Algorithm: moves of placement blocks are processed concurrently on multiple threads. Two strategies are adopted here to guarantee serial equivalency: task switch of the master thread is used to handle data conflicts aroused by parallel; an efficient SA-based parallel framework is designed to obtain orderly flow of data. Our method is tested by doing placement for Xilinx xc4vlx200 FPGA chip. In a quad-core processor, a speedup of 1.8x,2.7x,3.4x is achieved on 2,3,4 threads. Compared to serial placer, placement results of our parallel placer are deterministic and have no quality loss.Keywords
This publication has 10 references indexed in Scilit:
- UTPlaceF 3.0: A parallelization framework for modern FPGA global placement: (Invited paper)2017
- VTR 7.0ACM Transactions on Reconfigurable Technology and Systems, 2014
- Speeding Up FPGA Placement: Parallel Algorithms and Methods2014
- Weight-based FPGA placement algorithm with wire effect considered2013
- Titan: Enabling large and complex benchmarks in academic CAD2013
- Deterministic Timing-Driven Parallel Placement by Simulated Annealing Using Half-Box Window Decomposition2011
- Efficient and Deterministic Parallel Placement for FPGAsACM Transactions on Design Automation of Electronic Systems, 2011
- Parallelizing FPGA placement using Transactional Memory2010
- High-quality, deterministic parallel placement for FPGAs on commodity hardware2008
- Optimization by Simulated AnnealingScience, 1983