An ACO-based approach for scheduling task graphs with communication costs

Proceedings of the International Conference on Parallel Processing

Volumn 2005, Issue , 2005, Pages 623-629

  Bank, Markus ^a   Hönig, Udo ^a   Schiffmann, Wolfram ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; GRAPH THEORY; INFORMATION THEORY; PROBLEM SOLVING; TELECOMMUNICATION SYSTEMS;

ACO; COMMUNICATION COSTS; SCHEDULING PROBLEMS; SCHEDULING TASK GRAPHS;

SCHEDULING;

EID: 33745172509     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2005.18     Document Type: Conference Paper

References (18)

1. Kwok, Y.-K., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors, ACM Computing Surveys, Vol. 31, No. 4, 1999, pp. 406-471
2. Radulescu, A., van Gemund, J.C.:Low-Cost Task Scheduling for Distributed-Memory Machines, IEEE Transactions on Parallel and Distributed Systems, Vol. 13, No. 6, June 2002
3. Aguilar, J., Gelenbe E.: Task Assignment and Transaction Clustering Heuristics for Distributed Systems, Information Sciences, Vol. 97, No. 1 & 2, pp.199-219, 1997
4. Bansal, S., Kumar, P., Singh, K.: An improved duplication strategy for scheduling precedence constrained graphs in multiprocessor systems, IEEE Transactions on Parallel and Distributed Systems, Vol. 14, No. 6, June 2003
5. Park, C.-I., Choe, T.Y.: An optimal scheduling algorithm based on task duplication, IEEE Transactions on Computers, Vol. 51, No. 4, April 2002
6. Honig, U., Schiffmann, W.: A comprehensive Test Bench of optimal Schedules for the Evaluation of Scheduling Heuristics, Proceedings of the sixteenth IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2004), Cambridge, U.S.A., 2004
7. Greenwood, G.W., Gupta, A., McSweeney, K.: Scheduling Tasks in Multiprocesor Systems Using Evolutionary Strategies, International Conference on Evolutionary Computation, pp. 345-349, 1994
8. Kwok, Y.-K., Ahmad, I.: Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors Using a Parallel Genetic Algorithm, Journal of Parallel and Distributed Computing, Vol. 47, No. 1, pp. 58-77, 1997
9. Blum, C., Roli, A.: Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison, ACM Computing Surveys, Vol. 35, No. 3, 2003, pp. 268-308
10. Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: Optimization by a colony of cooperating Agents, IEEE Transactions on Systems, Man and Cybernetics, Part B, Vol. 26, No. 1, 1996, pp. 1-13
11. Dorigo, M., Stützte, T.: The Ant Colony Optimization Metaheuristic: Algorithms, Applications and Advances, In F. Glover and G. Kochenberger (Eds.), Handbook of Metaheuristics, volume 57 of International Series in Operations Research & Management Science, pp. 251-285, Kluwer Academic Publishers, Norwell, MA, 2002
12. Stützle, T.: An Ant Approach to the Flow Shop Problem, Proceedings of the 6th European Congress on Intelligent Techniques & Soft Computing (EUFIT'98), 1998, Vol. 3, pp. 1560-1564
13. Dorigo, M., Gambardella, L. M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem, IEEE Transactions on Evolutionary Computation, Vol. 1, No. 1, pp. 53-66, 1997
14. Adam, T. L., Chandy, K. M., Dickson, J. R.: A comparison of list schedules for parallel processing systems, Communications of the ACM, Vol. 17, No. 12, pp. 685-690, 1974
15. Wu, M.Y., Gajski, D. D.: Hypertool: A Programming Aid for Message-passing Systems, IEEE Transactions on Parallel and Distributed Systems, Vol. 1, No. 3, pp 330-343, 1990
16. Kasahara Laboratory, http://www.kasahara.elec.waseda.ac.jp/schedule/index.html, 2004
17. Y.-K. Kwok, I. Ahmad, Benchmarking the Task Graph Scheduling Algorithms, Proceedings of the 12th International Parallel Processing Symposium, Orlando, U.S.A., 1998, 531-537
18. Hönig, U., Schiffmann, W.: Comparison of nature inspired and deterministic scheduling heuristics considering optimal schedules, In B. Ribeiro et al. (Eds.), Adaptive and Natural Computing Algorithms, ISBN 3-211-24934-6, Springer-Verlag, 2005