375 search results - page 18 / 75 » On-Line Scheduling of Parallel Jobs |
SODA
2001
ACM
13 years 9 months ago
2001
ACM
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 ...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
IPPS
1999
IEEE
13 years 12 months ago
1999
IEEE
The Irix 6.5 scheduling system provides intrinsic support for batch processing, including support for guaranteed access to resources and policy-based static scheduling. Long range ...
IPPS
2000
IEEE
14 years 2 days ago
2000
IEEE
Buffered coscheduling is a scheduling methodology for time-sharing communicating processes in parallel and distributed systems. The methodology has two primary features: communica...
EOR
2008
13 years 7 months ago
2008
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...