Sciweavers

Share
SODA
2003
ACM
158views Algorithms» more  SODA 2003»
9 years 13 days ago
Faster approximation algorithms for the minimum latency problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, David P. Williamson
ANCS
2007
ACM
9 years 3 months ago
Frame-aggregated concurrent matching switch
Network operators need high-capacity router architectures that can offer scalability, provide throughput and performance guarantees, and maintain packet ordering. However, previou...
Bill Lin, Isaac Keslassy
WAOA
2004
Springer
132views Algorithms» more  WAOA 2004»
9 years 4 months ago
Stochastic Online Scheduling on Parallel Machines
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
Nicole Megow, Marc Uetz, Tjark Vredeveld
IPPS
2005
IEEE
9 years 4 months ago
Predicting Cache Space Contention in Utility Computing Servers
The need to provide performance guarantee in high performance servers has long been neglected. Providing performance guarantee in current and future servers is diļ¬ƒcult because ļ...
Yan Solihin, Fei Guo, Seongbeom Kim
books