Static task scheduling with a unified objective on time and resource domains

Computer Journal

Volumn 49, Issue 6, 2006, Pages 731-743

  Demiroz, Betul ^a   Topcuoglu, Haluk Rahmi ^a  

^a MARMARA UNIVERSITY   (Turkey)

Author keywords

Genetic algorithms; Heuristics; Parallel computing; Task graphs; Task scheduling

Indexed keywords

COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION;

STATIC TASK SCHEDULING; TASK GRAPHS; WEIGHTING SCHEME;

PARALLEL PROCESSING SYSTEMS;

EID: 33750127985     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxl030     Document Type: Article

References (43)

1. Garey, M. R. and Johnson, D. S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., New York.
2. Ullman, J. D. (1975) NP-Complete scheduling problems. J. Comput. Syst. Sci., 10, 384-393.
3. Hu, T. C. (1961) Parallel sequencing and assembly line problems. Operat. Res., 9, 841-848.
4. Coffman, E. G. (1976) Computer and Job-Shop Scheduling Theory, John Wiley and Sons, New York.
5. Topcuoglu, H., Hariri, S. and Wu, M. (2002) Performance effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parall. Distrib. Syst., 13, 260-274.
6. Sih, G. C. and Lee, E. A. (1993) A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Trans. Parall. Distrib. Syst., 4, 175-186.
7. El-Rewini, H. and Lewis, T. G. (1990) Scheduling parallel program tasks onto abitrary target machines. J. Parall. Distrib. Comput., 9, 138-153.
8. Iverson, M., Ozguner, F. and Follen, G. (1995) Parallelizing existing applications in a distributed heterogeneous environment. In Proc. Heterogeneous Computing Workshop, Santa Barbara, CA, April 25, pp. 93-100. IEEE Computer Society, Los Alamitos.
9. Maheswaran, M. and Siegel, H. J. (1998) A dynamic matching and scheduling algorithm for heterogeneous computing systems. In Proc. Heterogeneous Computing Workshop, Orlando, FL, March 30, pp. 57-69. IEEE Computer Society, Los Alamitos.
10. Wang, L., Siegel, H. J. and Roychowdhury, V. P. (1996) A genetic-algorithm-based approach for task matching and scheduling in heterogeneous computing environments. In Proc. Heterogeneous Computing Workshop, Honolulu, HI, April 15-19, pp. 72-85. IEEE Computer Society, Los Alamitos.
11. Singh, H. and Youssef, A. (1996) Mapping and scheduling heterogeneous task graphs using genetic algorithms. In Proc. of Heterogeneous Computing Workshop, Honolulu, HI, April 15-19, pp. 86-97. IEEE Computer Society, Los Alamitos.
12. Hagras, T. and Janecek, J. (2005) A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems. Parall. Comput., 31, 653-670.
13. Qin, X., Jiang, H. and Swanson, D. R. (2002) An efficient fault-tolerant scheduling algorithm for real-time tasks with precedence constraints in heterogeneous systems. In Proc. Int. Conf. Parallel Processing, Vancouver, Canada, August 18-21, pp. 360-368. IEEE Computer Society, Los Alamitos.
14. Qin, X., Jiang, H., Zhu, Y. and Swanson, D. R. (2003) Dynamic load balancing for I/O-intensive tasks on heterogeneous clusters. In Proc. Int. Conf. High Performance Computing. Hyderabad, India, December 17-20, pp. 300-309. Springer-Verlag, Berlin.
15. Boeres, C. and Lima, A. (2003) Hybrid task scheduling: Integrating static and dynamic heuristics. In Proc. 15th Symp. Computer Architecture and High Performance Computing, SBAC-PAD03, Sao Paulo, Brazil, November 10-12, pp. 199-206. IEEE Computer Society, Los Alamitos.
16. Sakellariou, R. and Zhao, H. (2004) A hybrid heuristic for DAG scheduling on heterogeneous systems. In Proc. Int. Parallel and Distributed Processing Symp., IPDPS 2004, Santa Fe, NM, April 26-30, IEEE Computer Society, Los Alamitos.
17. Liu, G. Q., Poh, K. L. and Xie, M. (2005) Iterative list scheduling for heterogeneous computing. J. Parall. Distrib. Comput., 65, 654-665.
18. Ge, Y. and Yun, D. (1996) Simultaneous compression of makespan and number of processors using CRP. In Proc. Int. Parallel Processing Symp., Honolulu, HI, April 15-19, pp. 332-338. IEEE Computer Society, Los Alamitos.
19. Roig, C., Ripoll, A., Senar, M., Guirado, F. and Luque, E. (2002) A new model for static mapping of parallel applications with task and date parallelism. In Proc. of Int. Parallel and Distributed Processing Symp., IPDPS 2002, Fort Lauderdale, FL, April 15-19, pp. 78-85. IEEE Computer Society, Los Alamitos.
20. Han, J. and Li, Q. (2004) A novel static task scheduling algorithm in distributed computing environment. In Proc. Int. Parallel and Distributed Processing Symp., IPDPS 2004, Santa Fe, NM, April 26-30. IEEE Computer Society, Los Alamitos.
21. Dilworth, R. P. (1950) A decomposition theorem for partially ordered sets. Ann. Math., 51, 161-166.
22. Abdeddaim, Y., Kerbaa, A. and Maler, O. (2003) Task graph scheduling using timed automata. In Proc. Int. Parallel and Distributed Processing Sympo., IPDPS 2003, Nice, France, April 22-26. IEEE Computer Society, Los Alamitos.
23. Cormen, T., Leiserson, C., Rivest, R. and Stein, C. (2001) Introduction to Algorithms, Second Edition, The MIT Press, Cambridge.
24. Goldberg, D. E. (1989) Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA.
25. Mitchell, M. (1998) An Introduction to Genetic Algorithms. Paperback Edition, MIT Press, Cambridge.
26. Michalewicz, Z. (1999) Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, Berlin.
27. Eiben, A. E. and Smith, J. E. (2003) Introduction to Evolutionary Computing, Springer-Verlag, Berlin.
28. Back, T., Fogel, D. B. and Michalewicz, Z. (1997) Handbook of Evolutionary Computation, Physics Publishing and Oxford University Press, New York.
29. Hou, E. S. H., Ansari, N. and Ren, H. (1994) A genetic algorithm for multiprocessor scheduling. IEEE Trans. Parall. Distrib. Syst., 5, 113-120.
30. Shroff, P., Watson, D. W., Flann, N. S. and Freund, R. (1996) Genetic simulated annealing for scheduling data-dependent tasks in heterogeneous environments. In Proc. Heterogeneous Computing Workshop, Honolulu, HI, April 15-19, pp. 98-104. IEEE Computer Society, Los Alamitos.
31. Kwok, Y. and Ahmad, I. (1997) Efficient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithms. J. Parall. Distrib. Comput., 47, 58-77.
32. Ahmad, I. and Dhodhi, M. K. (1996) Multiprocessor scheduling in a genetic paradigm. Parall. Comput., 22, 395-406.
33. Dhodhi, M. K., Ahmad, I. and Storer, R. (1995) SHEMUS: Synthesis of heterogeneous multiprocessor systems. Microprocess. Microsys., 19, 311-319.
34. Correa, R. C., Ferreira, A. and Rebreyend, P. (1996) Integrating list heuristics into genetic algorithms for multiprocessor scheduling. In Proc. IEEE Symp. Parallel and Distributed Processing, New Orleans, Louis, October, pp. 462-469, IEEE Computer Society, Los Alamitos.
35. Correa, R. C., Ferreira, A. and Rebreyend, P. (1999) Scheduling multiprocessor tasks with genetic algorithms. IEEE Trans. Parall. Distrib. Sys., 10, 825-837.
36. Wu, A. S., Yu, H., Jin, S., Lin, K. and Schiavone, G. (2004) An incremental genetic algorithm approach to multiprocessor scheduling. IEEE Trans. Parall. Distrib. Syst., 15, 824-834.
37. Rebreyend, P., Sandnes, F. E. and Megson, G. M. (1998) Static Multiprocessor Task Graph Scheduling in the Genetic Paradigm: A Comparison of Genotype Representations, Ecole Normale Supérieure de Lyon, Laboratoire de l'Informatique du Parallélisme, Lyon, France, Research Report No. 98-25.
38. Sandnes, F. E. and Megson, G. M. (1997) Improved static multiprocessor scheduling using cyclic task graphs: A genetic approach. In Proc. PARCO 97, Bonn, Germany, September 19-22, pp. 703-710. Elsevier, North-Holland, Amsterdam.
39. Wu, M. and Gajski, D. (1990) Hypertool: A programming aid for message passing systems. IEEE Trans. Parall. Distrib. Sys., 1, 330-343.
40. Cosnard, M., Marrakchi, M., Robert, Y. and Trystram, D. (1988) Parallel Gaussian elimination on an MIMD computer. Parall. Comput., 6, 275-295.
41. Gerasoulis, A. and Yang, T. (1994) Performance bounds for parallelizing Gaussian-Elimination and Gauss-Jordan on message-passing machines. Appl. Numer. Math. J., 16, 283-297.
42. Chung, Y. and Ranka, S. (1992) Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors. In Proc. Supercomputing, Minneapolis, MN, November 16-20, pp. 512-521. IEEE Computer Society, Los Alamitos.
43. Topcuoglu, H. and Sevilmis, C. (2002) Task scheduling with conflicting objectives. In Proc. Int. Conf. Advances in Information Systems, ADVIS 2002, Izmir, Turkey, October 23-25, pp. 346-355. Springer-Verlag, Berlin.