223 search results - page 11 / 45 » Improving First-Come-First-Serve Job Scheduling by Gang Sche... |
JSSPP
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we examine the concept of giving every job a trial run before committing it to run until completion. Trial runs allow immediate job failures to be detected shortly a...
SAINT
2007
IEEE
14 years 1 months ago
2007
IEEE
In traditional job scheduling systems for the Grid, a single or a few machines handle information of all computing resources and scheduling tasks. This centralized approach is not...
PLDI
2012
ACM
11 years 10 months ago
2012
ACM
Parallel programs are known to be difficult to analyze. A key reason is that they typically have an enormous number of execution interleavings, or schedules. Static analysis over...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
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...