Sciweavers

5785 search results - page 1040 / 1157
» Approximability of Probability Distributions
Sort
View
136
Voted
IPPS
2005
IEEE
15 years 9 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 difficult because ...
Yan Solihin, Fei Guo, Seongbeom Kim
128
Voted
IPPS
2005
IEEE
15 years 9 months ago
Security-Driven Heuristics and A Fast Genetic Algorithm for Trusted Grid Job Scheduling
In this paper, our contributions are two-fold: First, we enhance the Min-Min and Sufferage heuristics under three risk modes driven by security concerns. Second, we propose a new ...
Shanshan Song, Yu-Kwong Kwok, Kai Hwang
125
Voted
PPOPP
2005
ACM
15 years 9 months ago
Fault tolerant high performance computing by a coding approach
As the number of processors in today’s high performance computers continues to grow, the mean-time-to-failure of these computers are becoming significantly shorter than the exe...
Zizhong Chen, Graham E. Fagg, Edgar Gabriel, Julie...
143
Voted
SIGECOM
2005
ACM
117views ECommerce» more  SIGECOM 2005»
15 years 9 months ago
First-price path auctions
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
Nicole Immorlica, David R. Karger, Evdokia Nikolov...
127
Voted
SIGMETRICS
2005
ACM
118views Hardware» more  SIGMETRICS 2005»
15 years 9 months ago
Nearly insensitive bounds on SMART scheduling
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
Adam Wierman, Mor Harchol-Balter, Takayuki Osogami
« Prev « First page 1040 / 1157 Last » Next »