841 search results - page 88 / 169 » Job Scheduling in Rings |
193
click to vote
JSSPP
2004
Springer
16 years 5 days ago
2004
Springer
As we continue to evolve into large-scale parallel systems, many of them employing hundreds of computing engines to take on mission-critical roles, it is crucial to design those s...
201
click to vote
JCO
2010
15 years 5 months ago
2010
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...
195
click to vote
NCA
2007
IEEE
16 years 1 months ago
2007
IEEE
The advancement of optical networking technologies has enabled e-science applications that often require transport of large volumes of scientific data. In support of such data-in...
185
click to vote
SIGMETRICS
2005
ACM
16 years 11 days ago
2005
ACM
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
172
click to vote
ICALP
2004
Springer
16 years 5 days ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...