List scheduling with duplication for heterogeneous computing systems

Journal of Parallel and Distributed Computing

Volumn 70, Issue 4, 2010, Pages 323-329

  Tang, Xiaoyong ^a,b   Li, Kenli ^a   Liao, Guiping ^b   Li, Renfa ^a  

^a HUNAN UNIVERSITY   (China)

^b HUNAN AGRICULTURAL UNIVERSITY   (China)

Author keywords

DAG; Duplication; Heterogeneous computing systems; List scheduling

Indexed keywords

COMPARISON STUDY; HETEROGENEOUS COMPUTING SYSTEM; KEY ATTRIBUTES; LIST SCHEDULING ALGORITHMS; LIST-SCHEDULING; NEW APPROACHES; OPTIMAL SCHEDULING; REAL APPLICATIONS; TASK SCHEDULE; TASK-SCHEDULING;

SCHEDULING ALGORITHMS;

EID: 76849102536     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2010.01.003     Document Type: Article

References (34)

1. Ahmad I., and Kwok Y.-K. On exploiting task duplication in parallel program scheduling. IEEE Trans. Parallel Distrib. Systems 9 9 (1998) 872-892
2. I. Ahmed, Y. Kwork, A comparison of task-duplication-based algorithms for scheduling parallel programs to message-passing systems, in: Proc. 11th Int. Symp. of High-Performance Computing Systems, 1997, pp. 39-50.
3. Bansal S., Kumar P., and Singh K. An improved duplication strategy for scheduling precedence constrained graphs in multiprocessor systems. IEEE Trans. Parallel Distrib. Systems 14 6 (2003) 533-544
4. Bansal S., Kumar P., and Singh K. Dealing with heterogeneity through limited duplication for scheduling precedence constrained task graphs. J. Parallel Distrib. Comput. 65 4 (2005) 479-491
5. Casanova H. Network modeling issues for grid application scheduling. Int. J. Found. Comput. Sci. 16 2 (2005) 145-162
6. Y. Chung, S. Ranka, Application and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors, in: Proc. Super Computing, 1992, pp. 512-521.
7. Daoud M.I., and Kharma N. A high performance algorithm for static task scheduling in heterogeneous distributed computing systems. J. Parallel Distrib. Comput. 68 4 (2008) 399-409
8. Darbha S., and Agrawal D.P. Optimal scheduling algorithm for distributed-memory machines. IEEE Trans. Parallel Distrib. Systems 9 1 (1998) 87-95
9. S. Darbha, D. Agrawal, A fast and scalable scheduling algorithm for distributed memory systems, in: Proc. of Symp. on Parallel and Distributed Processing, 1995, pp. 60-63.
10. Dhodhi M.K., Ahmad I., Yatama A., et al. An integrated technique for task matching and scheduling onto distributed heterogeneous computing system. J. Parallel Distrib. Comput. 62 9 (2002) 1338-1361
11. A. Dogan, F. Özgüner, LDBS: a duplication based scheduling algorithm for heterogeneous computing systems, in: Proceedings of the International Conference on Parallel Processing, ICPP-2002, Canada, 2002, pp. 352-359.
12. El-Rewini H., and Lewis T.G. Scheduling parallel program tasks onto arbitrary target machines. J. Parallel Distrib. Comput. 9 2 (1990) 138-153
13. El-Rewini H., Lewis T.G., and Ali H.H. Task Scheduling in Parallel and Distributed Systems (1994), Prentice Hall, Englewood Cliffs, NJ
14. Gary M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Co, San Francisco
15. Hagras T., and Janecek J. A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems. Parallel Comput. 31 7 (2005) 653-670
16. M. Iverson, F. Ozuner, G. Follen, Parallelizing existing applications in a distributed heterogeneous environment, in: Proceedings of Heterogeneous Computing Workshop, 1995, pp. 93-100.
17. Kim D., and Yi B.G. A two-pass scheduling algorithm for parallel programs. Parallel Comput. 20 6 (1994) 869-885
18. Kwok Y.-K., and Ahmad I. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput. Surv. 31 4 (1999) 406-471
19. Kwok Y.-K., and Ahmad I. Benchmarking and comparison of the task graph scheduling algorithms. J. Parallel Distrib. Comput. 59 3 (1999) 381-422
20. Kwok Y.-K., and Ahmad I. Dynamic critical-path scheduling: An effective technique for allocating task graphs onto multiprocessors. IEEE Trans. Parallel Distrib. Systems 7 5 (1996) 506-521
21. Liu G.Q., Poh K.L., and Xie M. Iterative list scheduling for heterogeneous computing. J. Parallel Distrib. Comput. 65 5 (2005) 654-665
22. Papadimitriou C.H., and Yannakakis M. Towards an architecture-independent analysis of parallel algorithms. SIAM J. Comput. 19 2 (1990) 322-328
23. Park H.J., and Kim B.K. An optimal scheduling algorithm for minimizing the computing period of cyclic synchronous tasks on multiprocessors. J. Syst. Softw. 56 3 (2001) 213-229
24. Peterson L.L., and Davie B.S. Computer Networks: A Systems Approach. third ed. (2003), Morgan Kaufmann Publishers, Los Altos, CA
25. Radulescu A., and van Gemund A.J.C. Low-cost task scheduling for distributed-memory machines. IEEE Trans. Parallel Distrib. Systems 13 6 (2002) 648-658
26. Shi Z., and Dongarra J.J. Scheduling workflow applications on processors with different capabilities. Future Gener. Comput. Syst. 22 6 (2006) 665-675
27. Sih G.C., and Lee E.A. A compile-time scheduling heuristic for interconnection-constrained heterogeneous machine architectures. IEEE Trans. Parallel Distrib. Systems 4 2 (1993) 175-187
28. Sinnen O., and Sousa L.A. Communication contention in task scheduling. TIEEE Trans. Parallel Distrib. Systems 16 6 (2005) 503-515
29. Sinnen O., and Sousa L.A. List scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures. Parallel Comput. 30 1 (2004) 81-101
30. Tang X., and Kenli L. D PADUA, Communication contention in APN list scheduling algorithm. Science in China Series F: Information Sciences 52 1 (2009) 59-69
31. H. Topcuoglu, S. Hariri, M.Y. Wu, Task scheduling algorithms for heterogeneous machines, in: Proceedings of the Heterogeneous Computing Workshop, Mexico, 1999, pp. 3-14.
32. Topcuoglu H., Hariri S., and Wu M.-Y. Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Systems 13 3 (2002) 260-274
33. Woodside C.M., and Monforton G.G. Fast allocation of processes in distributed and parallel systems. IEEE Trans. Parallel Distrib. Systems 4 2 (1993) 164-174
34. Zhao H., and Sakellariou R. An experimental investigation into the rank function of the heterogeneous earliest finish time scheduling algorithm. Proceedings of 9th International Euro-Par Conference (2003), Springer-Verlag 189-194