68 search results - page 6 / 14 » Improving Parallel Job Scheduling by Combining Gang Scheduli... |
KR
1992
Springer
13 years 11 months ago
1992
Springer
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
RTSS
2000
IEEE
13 years 11 months ago
2000
IEEE
In this paper, we study the problem of scheduling task sets with (m,k) constraints. In our approach, jobs of each task are partitioned into two sets: mandatory and optional. Manda...
GRID
2008
Springer
13 years 8 months ago
2008
Springer
To make the most effective application placement decisions on volatile large-scale heterogeneous Grids, schedulers must consider factors such as resource speed, load, and reliabil...
JSSPP
2007
Springer
14 years 1 months ago
2007
Springer
The number of distributed high performance computing architectures has increased exponentially these last years. Thus, systems composed by several computational resources provided ...
APSCC
2008
IEEE
14 years 1 months ago
2008
IEEE
—This paper examines the problem of predicting job runtimes by exploiting the properties of parameter sweeps. A new parameter sweep prediction framework GIPSy (Grid Information P...