DocumentCode
1007083
Title
Rip-up, reroute strategy accelerates routing process
Author
Bowen, Oliver
Author_Institution
Residential Syst. Group, Lutron Electron., Coopersburg, PA, USA
Volume
25
Issue
2
fYear
2006
Firstpage
18
Lastpage
23
Abstract
This article describes the extension of an already existing routing system and explores the feasibility of combining this with a field-programmable gate array (FPGA)-based maze routing accelerator to speed up the routing process. The routing system makes use of a rip-up and reroute strategy and utilizes an evolution algorithm to make routing decisions. The FPGA hardware accelerator speeds up the process of routing individual nets. The routing processes may be significantly shortened by using the software to determine when nets are to be ripped up and rerouted and the hardware accelerator to perform individual routes. A timing model is developed and measurements are taken to determine the feasibility of the proposal. Theoretical results show that improved routing performance is possible with a combination of hardware and software. Preliminary timing estimates and experiments show that combining the two routing systems could speed up a complex routing problem by a factor of approximation.
Keywords
field programmable gate arrays; integrated circuit design; network routing; FPGA-based maze routing accelerator; evolution algorithm; feasibility; field-programmable gate array; reroute strategy; rip-up strategy; routing process; Acceleration; Data structures; Hardware; Integrated circuit interconnections; Joining processes; Propagation delay; Routing; Software performance; Terminology; Wire;
fLanguage
English
Journal_Title
Potentials, IEEE
Publisher
ieee
ISSN
0278-6648
Type
jour
DOI
10.1109/MP.2006.1649005
Filename
1649005
Link To Document