Sciweavers

4342 search results - page 220 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
SPAA
2003
ACM
15 years 10 months ago
Throughput-centric routing algorithm design
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
Brian Towles, William J. Dally, Stephen P. Boyd
FOCS
2006
IEEE
15 years 11 months ago
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Ko...
165
Voted
DSN
2003
IEEE
15 years 10 months ago
An Algorithm for Automatically Obtaining Distributed and Fault-Tolerant Static Schedules
Our goal is to automatically obtain a distributed and fault-tolerant embedded system: distributed because the system must run on a distributed architecture; fault-tolerant because...
Alain Girault, Hamoudi Kalla, Mihaela Sighireanu, ...
RTAS
2005
IEEE
15 years 10 months ago
Optimal Time-Variant Resource Allocation for Internet Servers with Delay
The increasing popularity of high-volume performancecritical Internet applications calls for a scalable server design that allows meeting individual response-time guarantees. Cons...
Xiliang Zhong, Cheng-Zhong Xu, Minghua Xu, Jianbin...
ISVLSI
2007
IEEE
161views VLSI» more  ISVLSI 2007»
15 years 11 months ago
CMP-aware Maze Routing Algorithm for Yield Enhancement
— Chemical-Mechanical Polishing (CMP) is one of the key steps during nanometer VLSI manufacturing process where minimum variation of layout pattern densities is desired. This pap...
Hailong Yao, Yici Cai, Xianlong Hong