Sciweavers

1125 search results - page 52 / 225
» On the job rotation problem
Sort
View
PE
2010
Springer
137views Optimization» more  PE 2010»
13 years 8 months ago
Tail-robust scheduling via limited processor sharing
From a rare events perspective, scheduling disciplines that work well under light (exponential) tailed workload distributions do not perform well under heavy (power) tailed worklo...
Jayakrishnan Nair, Adam Wierman, Bert Zwart
IOR
2010
94views more  IOR 2010»
13 years 7 months ago
Utility-Maximizing Resource Control: Diffusion Limit and Asymptotic Optimality for a Two-Bottleneck Model
We study a stochastic network that consists of two servers shared by two classes of jobs. Class 1 jobs require a concurrent occupancy of both servers while class 2 jobs use one se...
Heng-Qing Ye, David D. Yao
TCS
2010
13 years 4 months ago
Resource allocation with time intervals
We study a resource allocation problem where jobs have the following characteristics: Each job consumes some quantity of a bounded resource during a certain time interval and indu...
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 10 months ago
Improved Approximations for Multiprocessor Scheduling Under Uncertainty
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T...
STOC
1999
ACM
106views Algorithms» more  STOC 1999»
14 years 2 months ago
Scheduling in the Dark
We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when ...
Jeff Edmonds