DocumentCode
3534250
Title
Improving the memory footprint and runtime scalability of FPGA CAD algorithms
Author
Chin, Scott Y L ; Wilton, Steven J E
Author_Institution
Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC, Canada
fYear
2009
fDate
Aug. 31 2009-Sept. 2 2009
Firstpage
717
Lastpage
718
Abstract
Advances in process technology have allowed for a dramatic increase in the capacity of FPGAs and this scaling is continuing at a steady pace. However, this scaling places increasing demands on the FPGA CAD tools. Already, for very large designs, compile-times of an entire work day are common, and memory requirements that exceed what would be found in a common desktop workstation are the norm. As FPGAs continue to grow, the problem will become worse. 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 who use these devices. The proposed research focuses on both the memory and runtime scalability of FPGA CAD tools. We have presented work on effective methods to improve the memory scalability. This work is summarized in Section 3. We are currently focusing on the runtime scalability portion of the project. Our current progress and proposed research on this part was summarized in Section 4.
Keywords
field programmable gate arrays; logic CAD; FPGA CAD algorithms; desktop workstation; memory footprint; process technology; runtime scalability portion; Circuits; Costs; Design automation; Field programmable gate arrays; Logic; Moore´s Law; Routing; Runtime; Scalability; Workstations;
fLanguage
English
Publisher
ieee
Conference_Titel
Field Programmable Logic and Applications, 2009. FPL 2009. International Conference on
Conference_Location
Prague
ISSN
1946-1488
Print_ISBN
978-1-4244-3892-1
Electronic_ISBN
1946-1488
Type
conf
DOI
10.1109/FPL.2009.5272331
Filename
5272331
Link To Document