Sciweavers

10 search results - page 1 / 2
» FPGA Implementation of a Maze Routing Accelerator
Sort
View
FPL
2003
Springer
91views Hardware» more  FPL 2003»
14 years 2 days ago
FPGA Implementation of a Maze Routing Accelerator
This paper describes the implementation of the L3 maze routing accelerator in an FPGA. L3 supports fast single-layer and multi-layer routing, preferential routing, and rip-up-and-r...
John A. Nestor
GLVLSI
2002
IEEE
127views VLSI» more  GLVLSI 2002»
13 years 11 months ago
A new look at hardware maze routing
This paper describes a new design for a hardware accelerator to support grid-based Maze Routing. Based on the direct mapped approach of Breuer and Shamsa [3], this work refines th...
John A. Nestor
FPGA
2003
ACM
116views FPGA» more  FPGA 2003»
14 years 2 days ago
Hardware-assisted simulated annealing with application for fast FPGA placement
To truly exploit FPGAs for rapid turn-around development and prototyping, placement times must be reduced to seconds; latebound, reconfigurable computing applications may demand p...
Michael G. Wrighton, André DeHon
BMCBI
2008
214views more  BMCBI 2008»
13 years 7 months ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
FPGA
2000
ACM
141views FPGA» more  FPGA 2000»
13 years 10 months ago
Tolerating operational faults in cluster-based FPGAs
In recent years the application space of reconfigurable devices has grown to include many platforms with a strong need for fault tolerance. While these systems frequently contain ...
Vijay Lakamraju, Russell Tessier