Factoring: a method for scheduling parallel loops
Communications of the ACM
Distributed computation with communication delays: asymptotic performance analysis
Journal of Parallel and Distributed Computing
Parallel image processing applications on a network of workstations
Parallel Computing
Parallel processing of spaceborne imaging radar data
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Distributed processing of divisible jobs with communication startup costs
GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Allocating independent tasks to parallel processors: an experimental study
Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing
High performance multidimensional analysis of large datasets
Proceedings of the 1st ACM international workshop on Data warehousing and OLAP
Scheduling divisible loads in a three-dimensional mesh of processors
Parallel Computing
On the Influence of Start-Up Costs in Scheduling Divisible Loads on Bus Networks
IEEE Transactions on Parallel and Distributed Systems
Using high-speed WANs and network data caches to enable remote and distributed visualization
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
Scheduling Divisible Loads in Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems
An interleaved parallel volume renderer with PC-clusters
EGPGV '02 Proceedings of the Fourth Eurographics Workshop on Parallel Graphics and Visualization
Concrete Math
Strategies for Parallel Data Mining
IEEE Concurrency
Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Scheduling Distributed Applications: the SimGrid Simulation Framework
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is Not Better
CLUSTER '01 Proceedings of the 3rd IEEE International Conference on Cluster Computing
RUMR: Robust Scheduling for Divisible Workloads
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
An Optimal Scheduling Scheme for Parallel Video Processing
ICMCS '98 Proceedings of the IEEE International Conference on Multimedia Computing and Systems
DVD transcoding via Linux metacomputing
Linux Journal
The Grid 2: Blueprint for a New Computing Infrastructure
The Grid 2: Blueprint for a New Computing Infrastructure
Divisible Load Scheduling in Systems with Limited Memory
Cluster Computing
Self-adaptive skeletal task farm for computational grids
Parallel Computing - Algorithmic skeletons
Improved Methods for Divisible Load Distribution on k-Dimensional Meshes Using Multi-Installment
IEEE Transactions on Parallel and Distributed Systems
A Dynamic Grid Scheduler with a Resource Selection Policy
Advanced Internet Based Systems and Applications
Placing pipeline stages on a Grid: Single path and multipath pipeline execution
Future Generation Computer Systems
PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Adaptive multi-round scheduling strategy for divisible workloads in grid environments
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
Multi-round real-time divisible load scheduling for clusters
HiPC'08 Proceedings of the 15th international conference on High performance computing
HiPC'08 Proceedings of the 15th international conference on High performance computing
Adaptive statistical scheduling of divisible workloads in heterogeneous systems
Journal of Scheduling
A strategyproof mechanism for scheduling divisible loads in bus networks without control processors
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
ETSA: an efficient task scheduling algorithm in wireless sensor networks
ICICA'10 Proceedings of the First international conference on Information computing and applications
Scalability limits of Bag-of-Tasks applications running on hierarchical platforms
Journal of Parallel and Distributed Computing
An incentive-based distributed mechanism for scheduling divisible loads in tree networks
Journal of Parallel and Distributed Computing
Cluster-based optimized parallel video transcoding
Parallel Computing
New method for scheduling heterogeneous multi-installment systems
Future Generation Computer Systems
Requirement-aware strategies for scheduling real-time divisible loads on clusters
Journal of Parallel and Distributed Computing
Future Generation Computer Systems
Hi-index | 0.00 |
Divisible load applications occur in many fields of science and engineering and can be easily parallelized in a master-worker fashion, but pose several scheduling challenges. While a number of approaches have been proposed that allocate load to workers in a single round, using multiple rounds improves overlap of computation with communication. Unfortunately, multiround algorithms are difficult to analyze and have thus received only limited attention. In this paper, we answer three open questions in the multiround divisible load scheduling area: 1) how to account for latencies, 2) how to account for heterogeneous platforms, and 3) how many rounds should be used. To answer 1), we derive the first closed-form optimal schedule for a homogeneous platform with both computation and communication latencies, for a given number of rounds. To answer 2) and 3), we present a novel algorithm, UMR. We evaluate UMR in a variety of realistic scenarios.