Scheduling workflow applications on processors with different capabilities

Future Generation Computer Systems

Volumn 22, Issue 6, 2006, Pages 665-675

  Shi, Zhiao ^a   Dongarra, Jack J ^a,b  

^a University of Tennessee Knoxville   (United States)

^b OAK RIDGE NATIONAL LABORATORY   (United States)

Author keywords

DAG; Heterogeneous systems; List scheduling; Task scheduling; Workflow

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; SCHEDULING;

HETEROGENEOUS SYSTEMS; LIST SCHEDULING; SCHEDULING WORKFLOW; TASK SCHEDULING; WEIGHTED DIRECTED ACYCLIC GRAPHS;

PROGRAM PROCESSORS;

EID: 33646148944     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.future.2005.11.002     Document Type: Article

References (36)

1. J. Yu, R. Buyya, A taxonomy of workflow management systems for grid computing, Tech. Rep., University of Melbourne, Australia, March 2005
2. Kwok Y.-K., and Ahmad I. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput. Surv. 31 4 (1999) 406-471
3. Kwok Y.-K., and Ahmad I. Benchmarking and comparison of the task graph scheduling algorithms. J. Parallel Distrib. Comput. 59 3 (1999) 381-422
4. El-Rewini H., Lewis T.G., and Ali H.H. Task Scheduling in Parallel and Distributed Systems (1994), Prentice Hall, Englewood Cliffs, NJ
5. J. Blythe, S. Jain, E. Deelman, Y. Gil, K. Vahi, A. Mandal, K. Kennedy, Task scheduling strategies for workflow-based applications in grids, 2005
6. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W. H. Freeman & Co., New York
7. Topcuouglu H., Hariri S., and Wu M.Y. Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. 13 3 (2002) 260-274
8. Wu M.Y., and Gajski D.D. Hypertool: A programming aid for message-passing systems. IEEE Trans. Parallel Distrib. Syst. 1 3 (1990) 330-343
9. Sih G.C., and Lee E.A. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Trans. Parallel Distrib. Syst. 4 2 (1993) 175-187
10. El-Rewini H., and Lewis T.G. Scheduling parallel program tasks onto arbitrary target machines. J. Parallel Distrib. Comput. 9 2 (1990) 138-153
11. Liu G., Poh K., and Xie M. Iterative list scheduling for heterogeneous computing. J. Parallel Distrib. Comput. 65 5 (2005) 654-665
12. R. Sakellariou, H. Zhao, A hybrid heuristic for dag scheduling on heterogeneous systems, in: Proceedings of 13th Heterogeneous Computing Workshop, HCW2004, Santa Fe, NM, 2004
13. Yang T., and Gerasoulis A. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Trans. Parallel Distrib. Syst. 5 9 (1994) 951-967
14. Kim S., and Browne J. A general approach to mapping of parallel computation upon multiprocessor architectures. Proceedings of International Conf. Parallel Processing vol. 2 (1988) 1-8
15. J. Liou, M. Falls, An efficient clustering heuristic for scheduling dags on multiprocessors, in: Proc. Symp. Parallel and Distributed Processing, 1996
16. Kruatrachue B., and Lewis T. Grain size determination for parallel processing. IEEE Softw. 5 1 (1988) 23-32
17. Chung Y.-C., and Ranka S. Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors. Supercomputing'92: Proceedings of the 1992 ACM/IEEE Conference on Supercomputing (1992), IEEE Computer Society Press, Los Alamitos, CA 512-521
18. Park G.-L., Shirazi B., and Marquis J. DFRN: A new approach for duplication based scheduling for distributed memory multiprocessor systems. IPPS'97: Proceedings of the 11th International Symposium on Parallel Processing (1997), IEEE Computer Society, Washington, DC 157-166
19. Ahmad I., and Kwok Y. A new approach to scheduling parallel programs using task duplication. Proc. Int'l Conf Parallel Processing vol. 2 (1994) 47-51
20. Hou E.S.H., Ansari N., and Ren H. A genetic algorithm for multiprocessor scheduling. IEEE Trans. Parallel Distrib. Syst. 5 2 (1994) 113-120
21. Braun T.D., Siegel H.J., Beck N., Boloni L.L., Reuther A.I., Theys M.D., Yao B., Freund R.F., Maheswaran M., Robertson J.P., and Hensgen D. A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems. HCW'99: Proceedings of the Eighth Heterogeneous Computing Workshop (1999), IEEE Computer Society, Washington, DC 15
22. H. Singh, A. Youssef, Mapping and scheduling heterogeneous task graphs using genetic algorithms, in: Proc. Heterogeneous Computing Workshop, 1996, pp. 86-97
23. P. Shroff, D. Watson, N. Flann, K. Freund, Genetic simulated annealing for scheduling data-dependent tasks in heterogeneous environments, in: Proc. Heterogeneous Computing Workshop, 1996, pp. 98-104
24. L. Wang, H. Siegel, V. Roychowdhury, A genetic-algorithm-based approach for task matching and scheduling in heterogeneous computing environments, in: Proc. Heterogeneous Computing Workshop, 1996
25. R. Correa, A. Ferreria, P. Rebreyend, Integrating list heuristics into genetic algorithms for multiprocessor scheduling, in: Proc. Eighth IEEE Symp. Parallel and Distributed Processing, SPDP'96, 1996
26. Kwok Y.-K., and Ahmad I. Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors. IEEE Trans. Parallel Distrib. Syst. 7 5 (1996) 506-521
27. Radulescu A., and Gemund A.J.C.V. Fast and effective task scheduling in heterogeneous systems. HCW'00: Proceedings of the 9th Heterogeneous Computing Workshop (2000), IEEE Computer Society, Washington, DC 229
28. 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
29. Casanova H. Network modeling issues for grid application scheduling. Int. J. Found. Comput. Sci. 16 2 (2005) 145-162
30. Brucker P. Scheduling Algorithms (2004), Springer-Verlag
31. Chang R.S., and Lee R.C.T. On a scheduling problem where a job can be executed only by a limited number of processors. Comput. Oper. Res. 15 5 (1988) 471-478
32. Chen Y.L., and Chin Y.H. Scheduling unit-time jobs on processors with different capabilities. Comput. Oper. Res. 16 5 (1989) 409-417
33. Adam T.L., Chandy K.M., and Dickson J.R. A comparison of list schedules for parallel processing systems. Commun. ACM 17 12 (1974) 685-690
34. Hwang J.-J., Chow Y.-C., Anger F.D., and Lee C.-Y. Scheduling precedence graphs in systems with interprocessor communication times. SIAM J. Comput. 18 2 (1989) 244-257
35. Shah S.P., He D.Y., Sawkins J.N., Druce J.C., Quon G., Lett D., Zheng G.X., Xu T., and Ouellette B.F. Pegasys: software for executing and integrating analyses of biological sequences. BMC Bioinformatics 5 (2004) 40
36. A. YarKhan, K. Seymour, K. Sagi, Z. Shi, J. Dongarra, Recent development in gridsolve, Int. J. High Perform. Comput. Appl. 20 (1) (2006) (special issue) (in press)