9 search results - page 1 / 2 » UMR: A Multi-Round Algorithm for Scheduling Divisible Worklo... |
IPPS
2003
IEEE
13 years 9 months ago
2003
IEEE
In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and co...
PDPTA
2007
13 years 5 months ago
2007
— This paper considers scheduling divisible workloads from multiple sources in linear networks of processors. We propose a two phase scheduling strategy (TPSS) to minimize the ov...
JCM
2007
13 years 4 months ago
2007
—Divisible loads are those workloads that can be partitioned by a scheduler into any arbitrary chunks. The problem of scheduling divisible loads has been defined for a long time,...
PDCAT
2005
Springer
13 years 10 months ago
2005
Springer
Scheduling divisible workloads in distributed systems has been one of the interesting research problems over the last few years. Most of the scheduling algorithms previously intro...
HPDC
2003
IEEE
13 years 9 months ago
2003
IEEE
Divisible workload applications arise in many fields of science and engineering. They can be parallelized in master-worker fashion and relevant scheduling strategies have been pr...