Sciweavers

1125 search results - page 85 / 225
» On the job rotation problem
Sort
View
CCGRID
2009
IEEE
16 years 1 months ago
Resource Allocation Using Virtual Clusters
— We propose a novel approach for sharing cluster resources among competing jobs. The key advantage of our approach over current solutions is that it increases cluster utilizatio...
Mark Stillwell, David Schanzenbach, Fréd&ea...
ICPP
2003
IEEE
15 years 11 months ago
Towards Real-time Parallel Processing of Spatial Queries
Spatial databases are entering an era of mass deployment in various real-life applications, especially mobile and location-based services. The real-time processing of spatial quer...
Haibo Hu, Manli Zhu, Dik Lun Lee
SIGMETRICS
2003
ACM
131views Hardware» more  SIGMETRICS 2003»
15 years 11 months ago
Classifying scheduling policies with respect to unfairness in an M/GI/1
It is common to evaluate scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling policy’s fairness....
Adam Wierman, Mor Harchol-Balter
RANDOM
1999
Springer
15 years 10 months ago
Scheduling with Unexpected Machine Breakdowns
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...
Susanne Albers, Günter Schmidt
IPPS
1996
IEEE
15 years 10 months ago
Maximizing Speedup through Self-Tuning of Processor Allocation
We address the problem of maximizing application speedup through runtime, self-selection of an appropriate number of processors on which to run. Automatic, runtime selection of pr...
Thu D. Nguyen, Raj Vaswani, John Zahorjan