Scalable and deterministic timing-driven parallel placement for FPGAs
Authors:
Open Access
- 27 February 2011
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 153-162
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Parallelizing Simulated Annealing-Based Placement Using GPGPU2010
- VPR 5.02009
- Area and delay trade-offs in the circuit and architecture design of FPGAs2008
- High-quality, deterministic parallel placement for FPGAs on commodity hardware2008
- Un/DoPack2006 IEEE/ACM International Conference on Computer Aided Design, 2006
- Hardware-assisted simulated annealing with application for fast FPGA placement2003
- Parallel algorithms for FPGA placement2000
- Fast, contention-free combining tree barriers for shared-memory multiprocessorsInternational Journal of Parallel Programming, 1994
- Parallel simulated annealing algorithms for cell placement on hypercube multiprocessorsIEEE Transactions on Parallel and Distributed Systems, 1990
- Placement by Simulated Annealing on a MultiprocessorIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987