Sciweavers

136 search results - page 2 / 28
» Congestion reduction in traditional and new routing architec...
Sort
View
DFG
2009
Springer
13 years 11 months ago
Models of Non-atomic Congestion Games - From Unicast to Multicast Routing
Abstract. We give an overview of important results for non-atomic congestion games in their traditional form along with self-contained and short proofs and then present new results...
Lasse Kliemann, Anand Srivastav
DAC
2006
ACM
14 years 5 months ago
A new hybrid FPGA with nanoscale clusters and CMOS routing
In this paper we propose a hybrid FPGA using nanoscale clusters with an architecture similar to clusters of traditional CMOS FPGAs. The proposed cluster is made of a crossbar of n...
Reza M. Rad, Mohammad Tehranipoor
GLVLSI
2007
IEEE
328views VLSI» more  GLVLSI 2007»
13 years 11 months ago
New timing and routability driven placement algorithms for FPGA synthesis
We present new timing and congestion driven FPGA placement algorithms with minimal runtime overhead. By predicting the post-routing critical edges and estimating congestion accura...
Yue Zhuo, Hao Li, Qiang Zhou, Yici Cai, Xianlong H...
ICCAD
2000
IEEE
91views Hardware» more  ICCAD 2000»
13 years 9 months ago
A Timing-Constrained Algorithm for Simultaneous Global Routing of Multiple Nets
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provi...
Jiang Hu, Sachin S. Sapatnekar
ICCAD
2010
IEEE
176views Hardware» more  ICCAD 2010»
13 years 2 months ago
An auction based pre-processing technique to determine detour in global routing
Global Routing has been a traditional EDA problem. It has congestion elimination as the first and foremost priority. Despite of the recent development for popular rip-up and rerout...
Yue Xu, Chris Chu