1017 search results - page 118 / 204 » A routing algorithm for flip-chip design |
GECCO
2006
Springer
14 years 19 days ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
IPTPS
2003
Springer
14 years 2 months ago
2003
Springer
Much of the existing work in peer to peer networking assumes that users will follow prescribed protocols without deviation. This assumption ignores the user’s ability to modify ...
SIGCOMM
2010
ACM
13 years 9 months ago
2010
ACM
IP address lookup is a challenging problem due to the increasing routing table size, and higher line rate. This paper investigates a new way to build an efficient IP lookup scheme...
DAC
2012
ACM
11 years 11 months ago
2012
ACM
In this paper, we propose two methods used in 3D IC placement that effectively exploit the die-to-die thermal coupling in the stack. First, TSVs are spread on each die to reduce t...
DAC
2008
ACM
14 years 10 months ago
2008
ACM
FPGA application developers often attempt to use pipelining, Cslowing and retiming to improve the performance of their designs. Unfortunately, such registered netlists present a f...