Name
Abstract | ||
|---|---|---|
While previous research has shown that FPGAs can efficiently implement many types of computations, their flexibility inherently limits their clock rate. Several research groups have attempted to address this by developing new architectures that include registered switchpoints within their interconnect. Unfortunately, this pipelined communication presents a new and difficult problem for detailed routing tools. Known as the N-Delay Routing Problem, it has been proven to be NP-Complete. Although there have been two heuristics developed to address this issue, both have certain limitations and neither approach considers timing during the routing process. While timing-driven conventional routing is largely considered to be a solved problem, there are several issues inherent to the N-Delay Routing problem make addressing timing particularly difficult. In this paper we discuss the nature of these problems and present a new timing-driven pipeline-aware router that produces as much as 60% better critical path delay than previous efforts. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1145/1117201.1117227 | FPGA |
Keywords | Field | DocType |
timing-driven pipeline-aware routing,difficult problem,timing-driven conventional routing,new architecture,previous research,routing process,new timing-driven pipeline-aware router,research group,detailed routing tool,n-delay routing problem,previous effort,critical path,reconfigurable computing | Equal-cost multi-path routing,Multipath routing,Link-state routing protocol,Triangular routing,Static routing,Hierarchical routing,Policy-based routing,Computer science,Parallel computing,Routing domain,Real-time computing,Distributed computing | Conference |
ISBN | Citations | PageRank |
1-59593-292-5 | 9 | 0.72 |
References | Authors | |
8 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ken Eguro | 1 | 195 | 15.97 |
| Scott Hauck | 2 | 2539 | 232.71 |