Sciweavers

139 search results - page 20 / 28
» Scheduling equal-length jobs on identical parallel machines
Sort
View
100
Voted
SKG
2006
IEEE
15 years 3 months ago
Remote Memory Management and Prefetching Techniques for Jobs in Grid
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...
S. Radha, S. Mary Saira Bhanu, N. P. Gopalan
IPL
2002
86views more  IPL 2002»
14 years 9 months ago
A polynomial algorithm for lot-size scheduling of two type tasks
We study the problem of scheduling unit time tasks of two types on m parallel identical machines. For each type, given numbers of tasks are required to be completed by the specifi...
Mikhail Y. Kovalyov, Marcus Pattloch, Günter ...
SWAT
2004
Springer
129views Algorithms» more  SWAT 2004»
15 years 3 months ago
Online Scheduling of Splittable Tasks in Peer-to-Peer Networks
We consider online scheduling of splittable tasks on parallel machines. In our model, each task can be split into a limited number of parts, that can then be scheduled independentl...
Leah Epstein, Rob van Stee
JSSPP
1997
Springer
15 years 2 months ago
Memory Usage in the LANL CM-5 Workload
It is generally agreed that memory requirements should be taken into account in the scheduling of parallel jobs. However, so far the work on combined processor and memory schedulin...
Dror G. Feitelson
JSSPP
2005
Springer
15 years 3 months ago
Modeling User Runtime Estimates
User estimates of job runtimes have emerged as an important component of the workload on parallel machines, and can have a significant impact on how a scheduler treats different ...
Dan Tsafrir, Yoav Etsion, Dror G. Feitelson