1017 search results - page 48 / 204 » Throughput-centric routing algorithm design |
115
Voted
DAC
2002
ACM
16 years 4 months ago
2002
ACM
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...
121
Voted
ICPADS
2005
IEEE
15 years 9 months ago
2005
IEEE
— 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...
168
Voted
ICC
2008
IEEE
15 years 10 months ago
2008
IEEE
—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...
134
Voted
FPL
2008
Springer
15 years 5 months ago
2008
Springer
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 ...
147
Voted
DAC
2006
ACM
16 years 4 months ago
2006
ACM
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...