Linear Recursive Networks and Their Applications in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Distributed processing of divisible jobs with communication startup costs
GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Parallelizing Image Feature Extraction on Coarse-Grain Machines
IEEE Transactions on Pattern Analysis and Machine Intelligence
Journal of Parallel and Distributed Computing
Divisible task scheduling — concept and verification
Parallel Computing - Special issue on task scheduling problems for parallel and distributed systems
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
On the Influence of Start-Up Costs in Scheduling Divisible Loads on Bus Networks
IEEE Transactions on Parallel and Distributed Systems
Parallel Processor Configuration Design with Processing/Transmission Costs
IEEE Transactions on Computers
A Novel Data Distribution Technique for Host-Client Type Parallel Applications
IEEE Transactions on Parallel and Distributed Systems
Mathematics and Computers in Simulation
Scheduling Divisible Loads in Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Parallel Computation in Biological Sequence Analysis
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
DEXA '01 Proceedings of the 12th International Workshop on Database and Expert Systems Applications
Experiments with Scheduling Divisible Tasks in Clusters of Workstations
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Partitioning Unstructured Meshes for Homogeneous and Heterogeneous Parallel Computing Environments
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
IEEE Transactions on Parallel and Distributed Systems
Resource-Aware Distributed Scheduling Strategies for Large-Scale Computational Cluster/Grid Systems
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
In this paper, we consider the problem of scheduling multiple divisible loads on heterogeneous linear daisy chain networks. Our objective is to design a load distribution strategy such that the total processing time of a set of loads is minimized. We assume that the set of loads are resident in one of the farthest end processors, which has a scheduler that will distribute the load to the other processors in the network. When distributing a load from the set, the distribution pattern of the previous load has to be taken into consideration to ensure that no processors are left idle and there are no collisions in the communication links. We design single and multi-installments strategies to achieve the above objective. We derive certain important conditions to determine whether an optimum solution exists. We propose two heuristic strategies when an optimum solution is unattainable. Using all the above strategies, we conduct four different simulation experiments to track the performance of strategies under several real-life situations. We conducted four different simulation experiments based on the two heuristic strategies to identify the best combination suitable for our multiple-loads distribution strategy. We also run simulations for a homogeneous system to quantify the performance under 3 different policies, that is, when the loads are (a) unsorted, (b) sorted with smallest load first (SLF) and (c) sorted with largest load first (LLF). A detailed analysis of the simulation results is presented and based on these, recommendations are made for the choice of strategies. Finally, we compare the performance of a single-load distribution strategy against the multiple-loads distribution strategy designed in this paper to quantify the exact performance gain that can be achieved. Illustrative examples are also provided for ease of understanding.