Sciweavers

173 search results - page 10 / 35
» Special Cases of Online Parallel Job Scheduling
Sort
View
HPDC
2006
IEEE
14 years 1 months ago
When Jobs Play Nice: The Case For Symbiotic Space-Sharing
Using a large HPC platform, we investigate the effectiveness of “symbiotic space-sharing”, a technique that improves system throughput by executing parallel applications in comb...
Jonathan Weinberg, Allan Snavely
ICALP
2000
Springer
13 years 11 months ago
Parallel Machine Scheduling Problems with Controllable Processing Times
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
Klaus Jansen, Monaldo Mastrolilli
CORR
2007
Springer
131views Education» more  CORR 2007»
13 years 7 months ago
Approximation Algorithms for Multiprocessor Scheduling under Uncertainty
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
Guolong Lin, Rajmohan Rajaraman
SODA
2001
ACM
125views Algorithms» more  SODA 2001»
13 years 9 months ago
Parallel processor scheduling with delay constraints
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
Daniel W. Engels, Jon Feldman, David R. Karger, Ma...
IPL
2006
97views more  IPL 2006»
13 years 7 months ago
A tight lower bound for job scheduling with cancellation
The Job Scheduling with Cancellation problem is a variation of classical scheduling problems in which jobs can be cancelled while waiting for execution. In this paper we prove a t...
Feifeng Zheng, Francis Y. L. Chin, Stanley P. Y. F...