Sciweavers

841 search results - page 27 / 169
» Job Scheduling in Rings
Sort
View
FOCS
2008
IEEE
14 years 5 months ago
The Power of Reordering for Online Minimum Makespan Scheduling
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...
Matthias Englert, Deniz Özmen, Matthias Weste...
ANOR
2010
130views more  ANOR 2010»
13 years 8 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...
GPC
2008
Springer
13 years 12 months ago
Using Moldability to Improve Scheduling Performance of Parallel Jobs on Computational Grid
In a computational grid environment, a common practice is try to allocate an entire parallel job onto a single participating site. Sometimes a parallel job, upon its submission, ca...
Kuo-Chan Huang, Po-Chi Shih, Yeh-Ching Chung
JSSPP
2005
Springer
14 years 4 months ago
AnthillSched: A Scheduling Strategy for Irregular and Iterative I/O-Intensive Parallel Jobs
Irregular and iterative I/O-intensive jobs need a different approach from parallel job schedulers. The focus in this case is not only the processing requirements anymore: memory, ...
Luís Fabrício Wanderley Góes,...
STOC
1997
ACM
129views Algorithms» more  STOC 1997»
14 years 3 months ago
Better Bounds for Online Scheduling
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...
Susanne Albers