Theory of linear and integer programming
Theory of linear and integer programming
Partitioning Techniques for Large-Grained Parallelism
IEEE Transactions on Computers
Parallel image processing applications on a network of workstations
Parallel Computing
Modeling communication pipeline latency
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Divisible task scheduling — concept and verification
Parallel Computing - Special issue on task scheduling problems for parallel and distributed systems
Parallel Processor Configuration Design with Processing/Transmission Costs
IEEE Transactions on Computers
Mathematics and Computers in Simulation
Scheduling Divisible Loads in Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems
Concrete Math
Scheduling and Load Balancing in Parallel and Distributed Systems
Scheduling and Load Balancing in Parallel and Distributed Systems
Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job
IEEE Transactions on Computers
Optimal Scheduling Algorithms for Communication Constrained Parallel Processing
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
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
A Realistic Network/Application Model for Scheduling Divisible Loads on Large-Scale Platforms
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Optimal Multi-installments Algorithm for Divisible Load Scheduling
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Heterogeneity-Aware Workload Distribution in Donation-Based Grids
International Journal of High Performance Computing Applications
Resource-Aware Distributed Scheduling Strategies for Large-Scale Computational Cluster/Grid Systems
IEEE Transactions on Parallel and Distributed Systems
Dynamic partitioning of loop iterations on heterogeneous PC clusters
The Journal of Supercomputing
Journal of Parallel and Distributed Computing
The performance of bags-of-tasks in large-scale distributed systems
HPDC '08 Proceedings of the 17th international symposium on High performance distributed computing
Journal of Parallel and Distributed Computing
A Dynamic Grid Scheduler with a Resource Selection Policy
Advanced Internet Based Systems and Applications
Implementation of a Performance-Based Loop Scheduling on Heterogeneous Clusters
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Heuristics for multi-round divisible loads scheduling with limited memory
Parallel Computing
Performance-based workload distribution on grid environments
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
Performance-based data distribution for data mining applications on grid computing environments
The Journal of Supercomputing
Adaptive statistical scheduling of divisible workloads in heterogeneous systems
Journal of Scheduling
Static worksharing strategies for heterogeneous computers with unrecoverable failures
Euro-Par'09 Proceedings of the 2009 international conference on Parallel processing
Fully polynomial time approximation schemes for scheduling divisible loads
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
A strategyproof mechanism for scheduling divisible loads in tree networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
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
Scheduling divisible MapReduce computations
Journal of Parallel and Distributed Computing
Job control in heterogeneous computing systems
Journal of Computer and Systems Sciences International
Performance evaluation of MapReduce using full virtualisation on a departmental cloud
International Journal of Applied Mathematics and Computer Science - SPECIAL SECTION: Efficient Resource Management for Grid-Enabled Applications
Scheduling divisible loads with return messages on heterogeneous master-worker platforms
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
The architecture of SIG computing environment and its application to image processing
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
An incentive-based distributed mechanism for scheduling divisible loads in tree networks
Journal of Parallel and Distributed Computing
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
Cluster-based optimized parallel video transcoding
Parallel Computing
Scheduling divisible loads on heterogeneous desktop systems with limited memory
Euro-Par'11 Proceedings of the 2011 international conference on Parallel Processing
Requirement-aware strategies for scheduling real-time divisible loads on clusters
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Many applications in scientific and engineering domains are structured as large numbers of independent tasks with low granularity. These applications are thus amenable to straightforward parallelization, typically in master-worker fashion, provided that efficient scheduling strategies are available. Such applications have been called divisible loads because a scheduler may divide the computation among worker processes arbitrarily, both in terms of number of tasks and of task sizes. Divisible load scheduling has been an active area of research for the last 15 years. A vast literature offers results and scheduling algorithms for various models of the underlying distributed computing platform. Broad surveys are available that report on accomplishments in the field. By contrast, in this paper, we propose a unified theoretical perspective that synthesizes previously published results, several novel results, and open questions, in a view to foster novel divisible load scheduling research. Specifically, we discuss both one-round and multiround algorithms, and we restrict our scope to the popular star and tree network topologies, which we study with both linear and affine cost models for communication and computation.