A genetic approach to planning in heterogeneous computing environments

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

Volumn , Issue , 2003, Pages

  Yu, Han ^a   Marinescu, Dan C ^a   Wu, Annie S ^a   Siegel, Howard Jay ^b  

^a University of Central Florida   (United States)

^b Colorado State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPLEX NETWORKS; DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED PARAMETER NETWORKS; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; SIMULATED ANNEALING; WORK SIMPLIFICATION;

COMPLEX OPTIMIZATION PROBLEMS; GENETIC APPROACH; HETEROGENEOUS COMPUTING; HEURISTIC SEARCH METHODS; PLANNING PROBLEM; PROCESS COORDINATION; SLIDING-TILE PUZZLES; WORKFLOW MANAGEMENTS;

PROBLEM SOLVING;

EID: 84947209330     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2003.1213199     Document Type: Conference Paper

References (23)

1. A. L. Blum and M. L. Furst. Fast planning through planning graph analysis. Journal of Artificial Intelligence, 90:281-300, 1997.
2. L. Boloni and D. C. Marinescu. Robust scheduling of metaprograms. Journal of Scheduling, 5:395-412, 2002.
3. B. Bonet and H. Geffner. Planning as heuristic search. Journal of Artificial Intelligence, 129:5-33, 2001.
4. T. D. Braun, H. J. Siegel, N. Beck, L. L. Boloni, M. Maheswaran, A. I. Reuther, J. P. Robertson, M. D. Theys, B. Yao, D. Hensgen, and R. F. Freund. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing, 61(6):810-837, June 2001.
5. K. Erol, D. S. Nau, and V. S. Subrahmanian. Complexity, decidability amd undecidability results for do mainindependent planning. Journal of Artificial Intelligence, 76:75-88, 1995.
6. R. Fikes and N. Nilsson. STRIPS: A new approach to the application of theorem proving to problem solving. Journal of Artificial Intelligence, 2(3/4):189-208, 1971.
7. W. W. Johnson and W. E. Story. Notes on the "15" puzzle. American Journal of Mathematics, 2(4):397-404, 1879.
8. P. Jonsson, P. Haslum, and C. Backstrom. Towards efficient universal planning, a randomized approach. Journal of Artificial Intelligence, 117:1-29, 2000.
9. R. E. Korf and A. Felner. Disjoint pattern database heuristics. Journal of Artificial Intelligence, 134:9-22, 2002.
10. R. E. Korf and L. A. Taylor. Finding optimal solutions to the twenty-four puzzle. In Proc. of the International Conference on Artificial Intelligence (AAAI 96), pages 1202-1207, Portland, OR, 1996.
11. Y. Kwok, A. A. Maciejewski, H. J. Siegel, A. Ghafoor, and I. Ahmad. Evaluation of a semi-static approach to mapping dynamic iterative tasks onto heterogeneous computing systems. In Proc. of the 1999 International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN '99), pages 204-209, June 1999.
12. M. Maheswaran, S. Ali, H. J. Siegel, D. Hensgen, and R. F. Freund. Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. Journal of Parallel and Distributed Computing, 59(2):107-131, Nov. 1999.
13. D. C. Marinescu. Internet-Based Workflow Management: Towards a Semantic Web. Wiley, New York, NY, 2002.
14. D. C. Marinescu and C. L. (Eds). Process Coordination and Ubiquitous Computing. CRC Press, New York, NY, 2002.
15. I. Muslea. SINERGY: A linear planner based on genetic programming. In Proc. of the 4th European Conference on Planning. Springer, 1997.
16. B. Nebel and J. Koehler. Plan reuse versus plan generation: A theoretical and empirical analysis. Journal of Artificial Intelligence, 76:427-454, 1995.
17. J. S. Penberthy and D. Weld. UCPOP: A sound, complete, partial-order planner for ADL. In Proc. of the 3rd International Conference on Knowledge Representation and Reasoning (KR-92), pages 103-114, Cambridge, MA, 1992.
18. S. J. Russel and P. Norvig. Artifricial Intelligence, aModern Approach. Prentice Hall, Upper Saddle River, NJ, 1995.
19. M. D. Theys, T. D. Braun, Y. Kwok, H. J. Siegel, and A. A. Maciejewski. Mapping of tasks onto distributed heterogeneous computing systems using a genetic algorithm approach. In Solutions to Parallel and Distributed Computing Problems: Lessons from Biological Sciences, pages 135-178. John Wiley & Sons, New York, NY, 2001.
20. L. Wang, H. J. Siegel, V. P. Roychowdhury, and A. A. Maciejewski. Task matching and scheduling in heterogeneous computing environments using a genetic-algorithm-based approach. Journal of Parallel and Distributed Computing, 47(1):8-22, 1997.
21. C. H. Westerberg and J. Levine. GenPlan: Combining genetic programming and planning. In Proc. of the 19th Workshop of the UK Planning and Scheduling Special Interest Group (PLANSIG 2000), Open University, Milton Keynes, UK, 2000.
22. C. H. Westerberg and J. Levine. Investigation of different seeding strategies in a genetic planner. In Proc. of the 2nd European Workshop on Scheduling and Timetabling (EvoSTIM 2001). Springer, 2001.
23. A. S. Wu, A. C. Schultz, and A. Agah. Evolving control for distributed micro air vehicles. In Proc. of the IEEE International Symposium on Computational Intelligence in Robotics and Automation, pages 174-179, 1999.