412 search results - page 9 / 83 » Parallel Machine Scheduling Problems with Controllable Proce... |
CLUSTER
2005
IEEE
14 years 10 days ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
CLOUD
2010
ACM
13 years 11 months ago
2010
ACM
This paper investigates what it entails to provide I/O service diļ¬erentiation and performance isolation for virtual machines on individual multicore nodes in cloud platforms. Sh...
WAOA
2010
Springer
13 years 4 months ago
2010
Springer
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...
ESWA
2008
13 years 6 months ago
2008
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
ECCC
2000
13 years 6 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...