841 search results - page 27 / 169 » Job Scheduling in Rings |
95
Voted
FOCS
2008
IEEE
15 years 7 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...
114
click to vote
ANOR
2010
14 years 10 months ago
2010
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...
124
click to vote
GPC
2008
Springer
15 years 1 months ago
2008
Springer
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...
114
Voted
JSSPP
2005
Springer
15 years 6 months ago
2005
Springer
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, ...
128
Voted
STOC
1997
ACM
15 years 4 months ago
1997
ACM
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...