Sciweavers

1017 search results - page 48 / 204
» Throughput-centric routing algorithm design
Sort
View
DAC
2002
ACM
14 years 11 months ago
Towards global routing with RLC crosstalk constraints
Conventional global routing minimizes total wire length and congestion. Experiments using large industrial benchmark circuits show that up to 24% of nets in such routing solutions...
James D. Z. Ma, Lei He
ICPADS
2005
IEEE
14 years 3 months ago
Distributed Spanning Tree Algorithms for Large Scale Traversals
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Sylvain Dahan
ICC
2008
IEEE
137views Communications» more  ICC 2008»
14 years 4 months ago
On the Effect of Localization Errors on Geographic Routing in Sensor Networks
—Recently, network localization systems that are based on inter-node ranges have received significant attention. Geographic routing has been considered an application which can u...
Bo Peng, Rainer Mautz, Andrew H. Kemp, Washington ...
FPL
2008
Springer
138views Hardware» more  FPL 2008»
13 years 11 months ago
An efficient run-time router for connecting modules in FPGAS
It is often desirable to change the logic and/or the connections within an FPGA design on-the-fly without the benefit of a workstation or vendor CAD software. This paper presents ...
Jorge Surís, Cameron Patterson, Peter Athan...
DAC
2006
ACM
14 years 11 months ago
BoxRouter: a new global router based on box expansion and progressive ILP
In this paper, we propose a new global router, BoxRouter, powered by the concept of box expansion and progressive integer linear programming (ILP). BoxRouter first uses a simple P...
Minsik Cho, David Z. Pan