Hardware accelerated FPGA placement

Authors:
Christian Fobel;Gary Gréwal;Andrew Morton
Affiliations:
Computing and Information Science, University of Guelph, Guelph, ON, Canada N1G2W1;Computing and Information Science, University of Guelph, Guelph, ON, Canada N1G2W1;Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada N2L3G1
Venue:
Microelectronics Journal
Year:
2009

Citing 9
Cited 0

VLSI cell placement techniques

ACM Computing Surveys (CSUR)
Analytical placement: A linear or a quadratic objective function?

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Can recursive bisection alone produce routable placements?

Proceedings of the 37th Annual Design Automation Conference
Reconfigurable computing: a survey of systems and software

ACM Computing Surveys (CSUR)
Effective partition-driven placement with simultaneous level processing and global net views

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
VPR: A new packing, placement and routing tool for FPGA research

FPL '97 Proceedings of the 7th International Workshop on Field-Programmable Logic and Applications
FPGA Design Automation: A Survey

Foundations and Trends in Electronic Design Automation
Digital Integrated Circuits

Digital Integrated Circuits
Measuring the Gap Between FPGAs and ASICs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A key advantage of field-programmable gate arrays (FPGAs) over full-custom and semi-custom devices is that they provide relatively quick implementation from concept to physical realization. However, as modern FPGAs reach close to one million logic blocks, more efficient and scalable FPGA placement algorithms are needed. This paper investigates the feasibility of using hardware acceleration, in the form of FPGAs, to improve the performance of placement algorithms. An iterative algorithm is presented which exploits the fine-grain parallelism in routing individual nets. Overall, our results show that speedups of 3-4 times can be obtained, without sacrificing solution quality.