Resource-aware allocation strategies for divisible loads on large-scale systems

IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

Volumn , Issue , 2009, Pages

  Benoit, Anne ^a   Marchal, Loris ^a   Pineau, Jean François ^b   Robert, Yves ^a   Vivien, Frédéric ^a  

^a UNIVERSITÉ DE LYON   (France)

^b LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; LARGE SCALE SYSTEMS;

ALLOCATION STRATEGY; COMMUNICATION COST; COMPLEXITY RESULTS; DIVISIBLE LOADS; PRE-EMPTIVE SCHEDULING; RESOURCE AWARE; SINGLE- MACHINES;

SCHEDULING ALGORITHMS;

EID: 70449877810     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2009.5160912     Document Type: Conference Paper

References (12)

1. 4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Operations Research Letters, 24(4):175-180, May 1999.
2. S. Baruah, J. Haritsa, and N. Sharma. On-line scheduling to maximize task completions. In Proc. IEEE Real-Time Systems Symposium, pages 228-236. IEEE Computer Society Press, 1994.
3. A. Benoit, L. Marchal, J.-F. Pineau, Y. Robert, and F. Vivien. Offline and online scheduling of concurrent bags-of-tasks on heterogeneous platforms. In APDCM 2008. IEEE Computer Society Press, 2008.
4. P. Bhat, C. Raghavendra, and V. Prasanna. Efficient collective communication in distributed heterogeneous systems. Journal of Parallel and Distributed Computing, 63:251-263, 2003.
5. M. L. Dertouzos. Control robotics: the procedural control of physical processes. In Proceedings of IFIP Congress, pages 897-813. IFIP, 1974.
6. M. Gallet, Y. Robert, and F. Vivien. Comments on "design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks". J. Parallel and Distributed Computing, 68(7):1021-1031, 2008.
7. B. Hong and V. K. Prasanna. Adaptive allocation of independent tasks to maximize throughput. IEEE Trans. Parallel Distributed Systems, 18(10):1420-1435, 2007.
8. B. Kalyanasundaram and K. R. Pruhs. Maximizing job completions online. J. Algorithms, 49(1):63-85, 2003.
9. E. L. Lawler. A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Ann. Oper. Res., 26(1-4):125-133, 1990.
10. J. Lenstra, R. Graham, E. Lawler, and A. Kan. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5:287-326, 1979.
11. T. Robertazzi. Ten reasons to use divisible load theory. IEEE Computer, 36(5):63-68, 2003.
12. S. Viswanathan, B. Veeravalli, and T. G. Robertazzi. Resource-aware distributed scheduling strategies for large-scale computational cluster/grid systems. IEEE Trans. Parallel Distributed Systems, 18(10):1450-1461, 2007.