Sciweavers

376 search results - page 34 / 76
» Hardware-Assisted Fast Routing
Sort
View
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 10 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
INFOCOM
2005
IEEE
14 years 3 months ago
Failure inferencing based fast rerouting for handling transient link and node failures
— With the emergence of Voice over IP and other real-time business applications, there is a growing demand for an IP network with high service availability. Unfortunately, in tod...
Zifei Zhong, Srihari Nelakuditi, Yinzhe Yu, Sanghw...
FPL
2009
Springer
99views Hardware» more  FPL 2009»
14 years 2 months ago
Exploiting fast carry-chains of FPGAs for designing compressor trees
Fast carry chains featuring dedicated adder circuitry is a distinctive feature of modern FPGAs. The carry chains bypass the general routing network and are embedded in the logic b...
Hadi Parandeh-Afshar, Philip Brisk, Paolo Ienne
ICCAD
2008
IEEE
110views Hardware» more  ICCAD 2008»
14 years 6 months ago
NTHU-Route 2.0: a fast and stable global router
—We present in this paper a fast and stable global router called NTHU-Route 2.0 that improves the solution quality and runtime of a state-of-the-art router, NTHU-Route, by the fo...
Yen-Jung Chang, Yu-Ting Lee, Ting-Chi Wang
ICCAD
2006
IEEE
131views Hardware» more  ICCAD 2006»
14 years 6 months ago
Fast wire length estimation by net bundling for block placement
The wire length estimation is the bottleneck of packing based block placers. To cope with this problem, we present a fast wire length estimation method in this paper. The key idea...
Tan Yan, Hiroshi Murata