Sciweavers

1017 search results - page 127 / 204
» A routing algorithm for flip-chip design
Sort
View
CN
2011
88views more  CN 2011»
13 years 2 months ago
Multi-hour network planning based on domination between sets of traffic matrices
—In multi-hour network design, periodic traffic variations along time are considered in the dimensioning process. Then, the non coincidence of traffic peaks along the day or the ...
Pablo Pavón-Mariño, Belen Garcia-Man...
ALGOSENSORS
2009
Springer
14 years 2 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal
NOCS
2010
IEEE
13 years 5 months ago
Asynchronous Bypass Channels: Improving Performance for Multi-synchronous NoCs
Abstract--Networks-on-Chip (NoC) have emerged as a replacement for traditional shared-bus designs for on-chip communications. As with all current VLSI designs, however, reducing po...
Tushar N. K. Jain, Paul V. Gratz, Alexander Sprint...
ISPD
2007
ACM
116views Hardware» more  ISPD 2007»
13 years 9 months ago
A morphing approach to address placement stability
Traditionally, research in global placement has focused on relatively few simple metrics, such as pure wirelength or routability estimates. However, in the real world today, desig...
Philip Chong, Christian Szegedy
WICON
2010
13 years 5 months ago
Optimized Content Caching and Request Capture in CNF Networks
In order to meet the overwhelming demands of content retrieval for mobile end users, a novel architecture for the next-generation Internet called Cache-and-Forward (CNF) has been p...
Lijun Dong, Dan Zhang, Yanyong Zhang, Dipankar Ray...