Sciweavers

1017 search results - page 141 / 204
» A routing algorithm for flip-chip design
Sort
View
CCR
2006
117views more  CCR 2006»
13 years 7 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
NOMS
2010
IEEE
173views Communications» more  NOMS 2010»
13 years 6 months ago
Dynamic resource allocation and power management in virtualized data centers
—We investigate optimal resource allocation and power management in virtualized data centers with time-varying workloads and heterogeneous applications. Prior work in this area u...
Rahul Urgaonkar, Ulas C. Kozat, Ken Igarashi, Mich...
ISPD
2003
ACM
105views Hardware» more  ISPD 2003»
14 years 28 days ago
Partition-driven standard cell thermal placement
The thermal problem has been emerged as one of the key issues for next-generation IC design. In this paper, we propose a scheme to achieve better thermal distribution for partitio...
Guoqiang Chen, Sachin S. Sapatnekar
IFIP
1999
Springer
13 years 12 months ago
Frontier: A Fast Placement System for FPGAs
In this paper we describe Frontier, an FPGA placement system that uses design macro-blocks in conjuction with a series of placement algorithms to achieve highly-routable and high-...
Russell Tessier
ICCAD
2005
IEEE
110views Hardware» more  ICCAD 2005»
14 years 4 months ago
Computational geometry based placement migration
Placement migration is a critical step to address a variety of postplacement design closure issues, such as timing, routing congestion, signal integrity, and heat distribution. To...
Tao Luo, Haoxing Ren, Charles J. Alpert, David Zhi...