Task Scheduling on Minimal Processors with Genetic Algorithms

Proceedings of the Joint Conference on Information Sciences

Volumn 6, Issue , 2002, Pages 210-214

  Yao, Wensheng ^a   You, Jinyuan ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; GENETIC ALGORITHMS; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS; SCHEDULING;

CRITICAL PATH FAST DUPLICATION (CPFD) ALGORITHM; DIRECTED ACYCLIC GRAPHS (DAG);

PROGRAM PROCESSORS;

EID: 1642390047     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. A. Gerasoulis and T. Yang, "On the granularity and clustering of directed acyclic task graphs," IEEE Trans. Parallel and Distributed Systems , vol. 4, No. 6, pp. 686-701, 1993.
2. B. Kruatrachue and T. Lewis, "Grain size determination for parallel processing," IEEE Software, pp. 23-32, Jan. 1988.
3. V. Sarkar, Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors, Cambridge, Mass: MIT Press, 1989.
4. M.A. Palis, J.C. Liou, and D.S.L. Wei, "Task clustering and scheduling for distributed memory parallel architectures," IEEE Trans. Parallel and Distributed Systems, vol. 7, No. 1, pp. 46-55, 1996.
5. T. Yang and A. Gerasoulis, "DSC: Scheduling parallel tasks on an unbounded number of processors," IEEE Trans. Parallel and Distributed Systems, vol. 5, No. 9, pp. 951-967, 1994.
6. nd ed.), Cambridge, MIT Press, 1992.
7. A.Y. Zomaya, C. Ward, and B. Macey, "Genetic scheduling for parallel processor systems: comparative studies and performance issues," IEEE Trans. Parallel and Distributed Systems , vol. 10, No. 8, pp. 795-812, 1999.
8. R.C. Correa, A. Ferreira, and P. Rebreyend, "Scheduling multiprocessor tasks with genetic algorithms," IEEE Trans. Parallel and Distributed Systems, vol. 10, No. 8, pp. 825-837, 1999.
9. Wang Q., K. H. Cheng, "List scheduling and parallel tasks," Information Processing Letters, 37(5), pp. 78-87, 1991.
10. C.H. Papadimitriou and M. Yannakakis, "Towards an architecture-independent analysis of parallel algorithms," SIAM J. Computing, vol. 19, No. 2, pp. 322-328, Apr. 1990.
11. D. E. Goldberg, et al, "Genetic Algorithm in search, optimization, and machine learning," Reading, MA: Addison-Wesley, 1989.
12. H. El-Rewini, et al, "Scheduling parallel program tasks onto arbitrary target machines," Journal of Parallel and Distributed Computing, 9(2), pp. 138-153, 1990.
13. P.M. Pardalos, and J. Xue, "The maximum clique problems," Journal of Global Optimization, vol. 4, pp. 301-328, 1994.
14. Y.K. Kwok, and I. Ahmad, "Dynamic critical-path scheduling: an effective technique for allocating task graphs to mutilprocessors," IEEE Trans. Parallel and Distributed Systems, vol. 7, No. 5, pp. 506-521, 1996.
15. rd International Conf. On Algorithms and Architectures for Parallel Processing, pp. 295-308, 1997.
16. I. Ahmad, and Y.K. Kwok, "On exploiting task duplication in parallel program scheduling," IEEE Trans. Parallel and Distributed Systems, vol. 9, No. 9, pp. 872-892, 1996.
17. Y.K. Kwok, and I. Ahmad, "Efficient scheduling of arbitrary task graphs to multi-processors using a parallel genetic algorithm," Journal of Parallel Distributed Computing, vol. 47, pp. 58-77, 1997.