155 search results - page 22 / 31 » Online Scheduling of Equal-Length Jobs on Parallel Machines |
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
JSSPP
1995
Springer
13 years 11 months ago
1995
Springer
In this paper, we describe a new job scheduling class, called \Time Space Sharing Scheduling" (TSSS) for dynamically partitionable parallel machines. As an instance of TSSS, ...
SKG
2006
IEEE
14 years 1 months ago
2006
IEEE
Predominant resources for execution of any application are computational power and memory. On one side, computational power has grown many folds faster than memory capacity. On th...
ICS
2005
Tsinghua U.
14 years 1 months ago
2005
Tsinghua U.
Traditionally, scheduling in high-end parallel systems focuses on how to minimize the average job waiting time and on how to maximize the overall system utilization. Despite the d...