Optimal algorithm for scheduling large divisible workload on heterogeneous system

Applied Mathematical Modelling

Volumn 32, Issue 9, 2008, Pages 1682-1695

  Mingsheng, Shang ^a  

^a UNIVERSITY OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

Divisible load theory; Heterogeneous computing; Non blocking mode of communication; Optimal scheduling sequence; Start up overheads

Indexed keywords

MESSAGE PASSING; NUMERICAL ANALYSIS; OPTIMAL SYSTEMS; PROGRAM PROCESSORS; TELECOMMUNICATION LINKS;

DIVISIBLE LOAD THEORY; HETEROGENEOUS COMPUTING; OPTIMAL SCHEDULING SEQUENCE; START-UP OVERHEADS;

ALGORITHMS;

ALGORITHMS; MESSAGE PASSING; NUMERICAL ANALYSIS; OPTIMAL SYSTEMS; PROGRAM PROCESSORS; TELECOMMUNICATION LINKS;

EID: 43949110272     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2007.06.014     Document Type: Article

References (15)

1. Robertazzi T.G. Ten reasons to use divisible load theory. Computer 36 5 (2003) 63-68
2. Bharadwaj V., Ghose D., and Robertazzi T.G. Divisible load theory: a new paradigm for load scheduling in distributed systems. Cluster Comput. 6 1 (2003) 7-17
3. Siegel H.J., and Ali S. Techniques for mapping tasks to machines in heterogeneous computing systems. J. Syst. Architec. 46 (2000) 627-639
4. http://www.ee.sunysb.edu/~tom/dlt.html.
5. Kim H.J. A novel optimal load distribution algorithm for divisible load. Cluster Comput. 6 1 (2003) 41-46
6. Kim H.J., and Mani V. Divisible load scheduling in single-level tree networks: optimal sequencing and arrangement in the nonblocking mode of communication. Comput. Math. Appl. 46 10-11 (2003) 1611-1623
7. Suresh S., Mani V., and Omkar S.N. The effect of start-up delays in scheduling divisible load on bus networks: an alternate approach. Comput. Math. Appl. 46 10-11 (2003) 1545-1557
8. Bharadwaj V., Li X.L., and Ko C.C. On the influence of start-up costs in scheduling divisible load on bus networks. IEEE Trans. Parallel Distrib. Syst. 11 12 (2000) 1288-1305
9. M. Drozdowski, Selected problems of scheduling tasks in multiprocessor computer systems, Politechnika Poznanska, Book No. 321, Poznan, Poland, 1997. Available from: .
10. O. Beaumont, A. Legrand, Y. Robert, Optimal algorithms for scheduling divisible workload on heterogeneous systems, in: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS'03), 4, 2003, pp. 98-111.
11. Bharadwaj V., Ghose D., Mani V., et al. Scheduling Divisible Load in Parallel and Distributed Systems (1996), IEEE Computer Society Press, Los Almitos, California
12. Charcranoon S., Robertazzi T.G., and Luryi S. Parallel processor configuration design with processing/transmission costs. IEEE Trans. Comput. 49 9 (2000) 987-991
13. Moritz C.A., and Frank M.I. LoGPC: modeling network contention in message-passing programs. IEEE Trans. Parallel Distrib. Syst. 12 4 (2001) 404-415
14. Sohn J., and Robertazzi T.G. Optimal load sharing for a divisible job on a bus network. IEEE Trans. Aerospace Electron. Syst. 32 1 (1996) 34-40
15. Pawe Wolniewicz, Divisible Job Scheduling in Systems with Limited Memory, PhD Thesis of Poznan Supercomputing and Networking Center, Poland, 2003.