Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Guelph

$25,000.00

An Intelligent, Parallel Framework for Field-Programmable Gate-Array Placement and Routing

EF 2017-18

Résumé
Since their inception circa 1984, Field Programmable Gate Arrays (FPGAs) have seen an enormous growth in usage because they can dramatically reduce design turn-around time and manufacturing costs for prototype circuits and small to high-volume products. This is made possible by the availability of reconfigurable logic blocks, macro blocks, and programmable interconnections on a FPGA. It has been estimated that the world-wide FPGA market will reach $10 billion by 2016, with communication, automotive, medical, computer storage, military and wireless all important end markets. However, as the feature size continues to shrink and device capacity continues to increase in modern FPGAs, the design-automation industry is facing an old problem: the time spent for placement and routing is still dominating the FPGA compilation process. While current placement and routing tools produce quality solutions, compile times can be on the order of hours or even days for the largest designs. Long run times not only adversely impact engineering productivity and costs, they act as a serious impediment to the adoption of FPGAs by software developers who are used to compilation times of seconds or minutes. The primary goal of this research proposal is to develop an intelligent, parallel framework that can help a designer reduce the amount of time spent compiling circuits for FPGAs by performing placement and routing more efficiently and intelligently. The novelty of this proposal lies in combining state-of-the-art machine-learning and data-mining techniques with innovative parallel placement and routing methods running on multicore and many-core parallel architectures. A key feature of the proposed framework is its ability to learn from past placement and routing problems to more effectively and efficiently solve future placement and routing problems.The overall significance of this work will be to provide Canadian industry with scalable, parallel FPGA placement and routing tools that can produce high-quality solutions, while avoiding excessively long compile times. The resulting tools will help reduce the design cycle time and, consequently, design cost. Both design time and design cost are very important considerations for companies manufacturing electronic products based on FPGAs.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
RGPIN-2014-03818
Name nom
Grewal, Gary
Department département
Computing and Information Science, School of
Organization id
24
Institution établissement
University of Guelph
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2017
Competition year année de concours
2014
Award amount
25000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1510
Committee name en
Electrical and Computer Engineering
Committee name fr
Génie électrique et informatique
Area of application code
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
Research subject code
2519
Research subject group en
Electrical and electronic engineering
Research subject group fr
Génie électrique et électronique
Research subject en
Microelectronics
Research subject fr
Microélectronique
Partie
4
Nb partie
5
Application title
An Intelligent, Parallel Framework for Field-Programmable Gate-Array Placement and Routing
Keyword
NSERC
Application summary
Since their inception circa 1984, Field Programmable Gate Arrays (FPGAs) have seen an enormous growth in usage because they can dramatically reduce design turn-around time and manufacturing costs for prototype circuits and small to high-volume products. This is made possible by the availability of reconfigurable logic blocks, macro blocks, and programmable interconnections on a FPGA. It has been estimated that the world-wide FPGA market will reach $10 billion by 2016, with communication, automotive, medical, computer storage, military and wireless all important end markets. However, as the feature size continues to shrink and device capacity continues to increase in modern FPGAs, the design-automation industry is facing an old problem: the time spent for placement and routing is still dominating the FPGA compilation process. While current placement and routing tools produce quality solutions, compile times can be on the order of hours or even days for the largest designs. Long run times not only adversely impact engineering productivity and costs, they act as a serious impediment to the adoption of FPGAs by software developers who are used to compilation times of seconds or minutes. The primary goal of this research proposal is to develop an intelligent, parallel framework that can help a designer reduce the amount of time spent compiling circuits for FPGAs by performing placement and routing more efficiently and intelligently. The novelty of this proposal lies in combining state-of-the-art machine-learning and data-mining techniques with innovative parallel placement and routing methods running on multicore and many-core parallel architectures. A key feature of the proposed framework is its ability to learn from past placement and routing problems to more effectively and efficiently solve future placement and routing problems.The overall significance of this work will be to provide Canadian industry with scalable, parallel FPGA placement and routing tools that can produce high-quality solutions, while avoiding excessively long compile times. The resulting tools will help reduce the design cycle time and, consequently, design cost. Both design time and design cost are very important considerations for companies manufacturing electronic products based on FPGAs.