Armada: timing-driven pipeline-aware routing for FPGAs

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 network presents a new and difficult problem for detailed routing tools. Known as the NDelay Routing Problem, it has been proven to be NP-Complete. Although there have been two heuristics recently 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 m...

• Type: Conference
• Year: 2006
• Where: FPGA
• Authors: Kenneth Eguro, Scott Hauck
• Keywords: FPGA, FPGA 2006, NDelay Routing Problem, Routing, Routing Problem