Grant: Collaborative Research and Development Grants
University of British Columbia
$13,175.00
Memory footprint and run-time scalability for FPGA CAD algorithms
FY 2008-09
Summary
In this project, we will investigate methods of improving the scalability of computer-aided design tools that map circuits to Field-Programmable Gate Arrays (FPGAs). Field-Programmable Gate Arrays provide a low-risk, low-cost implementation path for a wide variety of digital circuits. To map circuits to these devices, engineers employ a suite of compilation tools. These tools require significant computing resources, especially when mapping circuits to state-of-the-art FPGAs. As the capacity of FPGAs grow, the problem will become even more severe. Unless the scalability of FPGA CAD tools is addressed, the long run times and large memory footprints will become a hindrance to future FPGA scaling, leading to increased costs and design times for companies which use these devices.
This work will benefit the research and industrial communities in two ways. First, the techniques themselves may be useful for FPGA vendors and CAD tool developers as they create algorithms that map circuits to future devices. These devices will be larger than those that exist today, and a technique for controlling the growth in memory requirements will be essential. Our techniques will be demonstrated in a routing tool that is very representative of those tools used in industry, meaning that our techniques will be applicable as industry adopts our ideas in their tools.
Second, we will make an implementation of our ideas publicly available to other researchers. We will incorporate our ideas into a popular academic router, which is already used by researchers world-wide. This will enable researchers to investigate programmable logic architectures that are much larger than what they can currently study. In the long term, this will lead to innovations that will further accelerate the development of FPGA technology.
Program
Collaborative Research and Development Grants
Recipient
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
362380-2007
Name nom
Wilton, Steven
Department département
Electrical and Computer Engineering
Organization id
2
Institution établissement
University of British Columbia
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2007
Award amount
13175
Program id
CRDPJ
Program nane en
Collaborative Research and Development Grants
Program name fr
Subventions de recherche et développement coopérative
Group en
Research partnerships programs
Group fr
Programmes de partenariat
Committee code
96
Committee name en
RPP Internal Decision Cttee
Committee name fr
Cté de décision interne - PPR
Area of application code
803
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer communications
Area of application fr
Téléinformatique
Research subject code
2504
Research subject group en
Electrical and electronic engineering
Research subject group fr
Génie électrique et électronique
Research subject en
Integrated circuits
Research subject fr
Circuits intégrés
Partie
1
Nb partie
2
Application title
Memory footprint and run-time scalability for FPGA CAD algorithms
Keyword
NA
Application summary
In this project, we will investigate methods of improving the scalability of computer-aided design tools that map circuits to Field-Programmable Gate Arrays (FPGAs). Field-Programmable Gate Arrays provide a low-risk, low-cost implementation path for a wide variety of digital circuits. To map circuits to these devices, engineers employ a suite of compilation tools. These tools require significant computing resources, especially when mapping circuits to state-of-the-art FPGAs. As the capacity of FPGAs grow, the problem will become even more severe. Unless the scalability of FPGA CAD tools is addressed, the long run times and large memory footprints will become a hindrance to future FPGA scaling, leading to increased costs and design times for companies which use these devices.
This work will benefit the research and industrial communities in two ways. First, the techniques themselves may be useful for FPGA vendors and CAD tool developers as they create algorithms that map circuits to future devices. These devices will be larger than those that exist today, and a technique for controlling the growth in memory requirements will be essential. Our techniques will be demonstrated in a routing tool that is very representative of those tools used in industry, meaning that our techniques will be applicable as industry adopts our ideas in their tools.
Second, we will make an implementation of our ideas publicly available to other researchers. We will incorporate our ideas into a popular academic router, which is already used by researchers world-wide. This will enable researchers to investigate programmable logic architectures that are much larger than what they can currently study. In the long term, this will lead to innovations that will further accelerate the development of FPGA technology.