Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
CONSTRUCTIVE AND LOCAL SEARCH HEURISTIC TECHNIQUES FOR FPGA PLACEMENT
 

Summary: CONSTRUCTIVE AND LOCAL SEARCH HEURISTIC TECHNIQUES
FOR FPGA PLACEMENT
Xiaojun Bao and Shawki Areibi
School of Engineering
University of Guelph
CANADA N1G 2W1
E-mail:

xbao, sareibií @uoguelph.ca
ABSTRACT
The logic capacity of FPGAs has increased so rapidly in the
last decade (up to 40-million gates) that it will take a con-
siderable amount of time for users to synthesize and com-
pile these circuits. These prohibitively long compile times
may adversely affect instant manufacturability of FPGAs and
become intolerable to users seeking very high speed com-
pile. This paper presents two novel placement heuristic al-
gorithms that significantly reduce the amount of computa-
tion time required to achieve acceptable-quality placements.
The first algorithm is a Cluster Seed Search technique (CSS)

  

Source: Areibi, Shawki M - School of Engineering, University of Guelph

 

Collections: Engineering