Scheduling Algorithms
Scheduling Divisible Loads in Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems
Scheduling Distributed Applications: the SimGrid Simulation Framework
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
A new polynomial-time algorithm for linear programming
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Scheduling Divisible Loads on Star and Tree Networks: Results and Open Problems
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Min, Veeravalli, and Barlas have proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one or more installments [Han Min Wong, Bharadwaj Veeravalli, Scheduling divisible loads on heterogeneous linear daisy chain networks with arbitrary processor release times, IEEE Trans. Parallel Distrib. Syst. 15 (3) (2004) 273-288; Han Min Wong, Bharadwaj Veeravalli, Gerassimos Barlas, Design and performance evaluation of load distribution strategies for multiple divisible loads on heterogeneous linear daisy chain networks, J. Parallel Distrib. Comput. 65 (12) (2005) 1558-1577]. We show using a very simple example that their approach does not always produce a solution and that, when it does, the solution is often suboptimal. We also show how to find an optimal scheduling for any instance, once the number of installments per load is given. Finally, we formally prove that under a linear cost model, as in both the above-mentioned references, an optimal schedule has an infinite number of installments. Therefore such a cost model should not be used to design practical multi-installment algorithms.