An integrated technique for task matching and scheduling onto distributed heterogeneous computing systems

Journal of Parallel and Distributed Computing

Volumn 62, Issue 9, 2002, Pages 1338-1361

  Dhodhi, Muhammad K ^a   Ahmad, Imtiaz ^b   Yatama, Anwar ^b   Ahmad, Ishfaq ^c  

^a NOKIA RESEARCH CENTER   (United States)

^b KUWAIT UNIVERSITY   (Kuwait)

^c The University of Texas at Arlington   (United States)

Author keywords

Distributed heterogeneous computing; Evolutionary computation; Genetic algorithms; Heterogeneous processing; Heuristics; Matching and scheduling

Indexed keywords

EID: 0036749209     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.2002.1850     Document Type: Article

References (35)

1. T. L. Adam, K. M. Chandy, and J. R. Dickson, A comparison of list schedules for parallel processing systems, Comm. ACM 17(12) (December 1974), 685-690.
2. I. Ahmad and M. K. Dhodhi, Task assignment using a problem-space genetic algorithm, Concurrency: Pract. Exp. 7(5) (August 1995), 411-428.
3. I. Ahmad and M. K. Dhodhi, Multiprocessor scheduling in a genetic paradigm, Parallel Comput. 22 (1996), 395-406.
4. L. Davis, Job shop scheduling with genetic algorithms, in "Proceedings of the First International Conference on Genetic Algorithms," pp. 136-140, 1985.
5. M. K. Dhodhi, F. H. Hielscher, R. H. Storer, and J. Bhasker, Datapath synthesis using a problem-space genetic algorithm, IEEE Trans. Comput.-Aided Des. Integrated Circuits Systems 14(8) (August 1995), 934-944.
6. M. M. Eshagian and M. E. Shaaban, Cluster-M programming paradigm, Internat. J. High Speed Comput. 6(2) (June 1994), 287-309.
7. D. Fernandez-Baca, Allocating modules to processors in a distributed system, IEEE Trans. Software Eng. 15(11) (November 1989), 1427-1436.
8. R. F. Freund and D. Conwell, Superconcurrency: A form of distributed heterogeneous super-computing, Supercomputing Rev. 3 (October 1990), 47-50.
9. R. F. Freund, Optimal selection theory for superconcurrency, in "Proceedings of the Supercomputing," pp. 699-703, November 1989.
10. M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide for the Theory of NP-Completeness," San Francisco, CA, 1979.
11. D. E. Goldberg, "Genetic Algorithms in Search, Optimization and Machine Learning," Addison-Wesley, Reading, MA, 1989.
12. J. Heitkpetter and D. Beasley (Eds.), "The Hitchhikers Guide to Evolutionary Computation: A List of Frequently Asked Questions (FAQ)," USENET: comp.ai.genetic, December 1997.
13. E. S. H. Hou, N. Ansari, and H. Ren, A genetic algorithm for multiprocessor scheduling, IEEE Trans. Parallel Distrib. Systems 5(2) (February 1994), 113-120.
14. T. C. Hu, Parallel sequencing and assembly line problems, Oper. Res. 9 (6) (November 1961), 841-848.
15. M. A. Iverson, F. Ozguner, and G. J. Follen, Parallelizing existing applications in a distributed heterogeneous environment, in "Proceedings of the Heterogeneous Computing Workshop," pp. 93-100, April 1995.
16. A. A. Khokhar, V. K. Prasanna, M. E. Shaaban, and Cho-li Wang, Heterogeneous computing: Challenges and opportunities, IEEE Comput. 26(6) (June 1993), 18-27.
17. Y. K. Kwok and I. Ahmad, Efficient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm, J. Parallel Distrib. Comput. 47(1) (November 1997), 58-77.
18. G. Liao, E. R. Altman, V. K. Agarwal, and G. R. Gao, A comparative study of multiprocessor list scheduling heuristics, in "Proceedings of the Twenty-Seventh Annual Hawaii International Conference on System Sciences," pp. 68-77, January 1994.
19. V. M. Lo, Heuristic algorithms for task assignment in distributed systems, IEEE Trans. Comput. 37(11) (November 1988), 1384-1397.
20. N. Mansour and G. Fox, Allocating data to distributed-memory multiprocessors by genetic algorithms, Concurrency: Pract. Exp. 6(6) (September 1994), 485-504.
21. Z. Michalewicz, "Genetic Algorithms + Data Structures = Evolution Programs," Springer-Verlag, New York, 1992.
22. B. Naharai, A. Youssef, and H. A. Choi, Matching and scheduling in a generalized optimal selection theory, in "Proceedings of the Heterogeneous Computing Workshop," pp. 3-8, April 1994.
23. P. Shroff, D. W. Watson, N. S. Flann, and R. F. Freund, Genetic simulated annealing for scheduling data-dependent tasks in heterogeneous environments, in "Proceedings of the Heterogeneous Computing Workshop," pp. 98-104, April 1996.
24. H. J. Siegel, J. K. Antonio, R. C. Metzger, M. Tan, and Y. A. Li, Heterogeneous computing, in "Parallel and Distributed Computing Handbook" (A. Y. Zomaya, Ed.), McGraw-Hill, New York, 1996.
25. H. Singh and A. Youssef, Mapping and scheduling heterogeneous task graphs using genetic algorithms, in "Proceedings of the Heterogeneous Computing Workshop," pp. 86-97, April 1996.
26. R. H. Storer, D. S. Wu, and R. Vaccari, New search spaces for sequencing problems with application to job shop scheduling, Manage. Sci. 38(10) (October 1992), 1495-1509.
27. G. Syswerda, Schedule optimization using genetic algorithms, in "Handbook of Genetic Algorithms" (L. Davis, Ed.), pp. 332-349, Van Nostrand Reinhold, New York, 1991.
28. M. Tan, J. K. Antonio, H. J. Siegel, and Y. A. Li, Scheduling and data relocation for sequentially executed subtasks in a heterogeneous computing system, in "Proceedings of the Heterogeneous Computing Workshop," pp. 109-120, April 1995.
29. L. Tao, B. Narahari, and Y. C. Zhao, Heuristics for mapping parallel computations to heterogeneous parallel architectures, in "Proceedings of the Workshop on Heterogeneous Processing," pp. 36-41, 1993.
30. L. Wang, H. J. Siegel, and V. P. Roychowdhury, A genetic-algorithm-based approach for task matching and scheduling in heterogeneous computing environments, in "Proceedings of Heterogeneous Computing Workshop," pp. 72-85, April 1996.
31. M. Wang, S. Kim, M. A. Nichols, R. F. Freund, H. J. Siegel, and W. G. Nation, Augmenting the optimal selection theory for superconcurrency, in "Proceedings of the Workshop on Heterogeneous Processing," pp. 13-22, March 1992.
32. D. W. Watson, J. K. Antonio, H. J. Siegel, R. Gupta, and M. J. Atallah, Static matching of ordered program segments to dedicated machines in a heterogeneous computing environment, in "Proceedings of the Heterogeneous Computing Workshop," pp. 24-37, April 1996.
33. D. Whitley, T. Starketweather, and D. Daniel Shaner, The travelling salesman and sequence scheduling: Quality solutions using genetic edge recombination, in "Handbook of Genetic Algorithms" (L. Davis, Ed.), pp. 350-372, Van Nostrand Reinhold, New York, 1991.
34. D. Whitley, T. Starkweather, and D. A. Fuquay, Scheduling problems and travelling salesman: The genetic edge recombination operator, in "Proceedings of the Third International Conference on Genetic Algorithms," pp. 133-140, June 1989.
35. J. Yang, I. Ahmad, and A. Ghafoor, Estimation of execution times on heterogeneous supercomputer architecture, in "Proceedings of the International Conference on Parallel Processing," Vol. I, pp. 219-225, August 1993.