Plan switching: an approach to plan execution in changing environments

  • Authors:

  • Han Yu;Dan C. Marinescu;Annie S. Wu;Howard Jay Siegel;Rose A. Daley;I-Jeng Wang

  • Affiliations:

  • School of Electrical Engineering and Computer Science, University of Central Florida, Orlando, Florida;School of Electrical Engineering and Computer Science, University of Central Florida, Orlando, Florida;School of Electrical Engineering and Computer Science, University of Central Florida, Orlando, Florida;Department of Electrical and Computer Engineering and Department of Computer Science, Colorado State University, Fort Collins, Colorado;Johns Hopkins University, Applied Physics Laboratory, Laurel, MD;Johns Hopkins University, Applied Physics Laboratory, Laurel, MD

  • Venue:
  • IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The execution of a complex task in any environment requires planning. Planning is the process of constructing an activity graph given by the current state of the system, a goal state, and a set of activities. If we wish to execute a complex computing task in a heterogeneous computing environment with autonomous resource providers, we should be able to adapt to changes in the environment. A possible solution is to construct a family of activity graphs beforehand and investigate the means of switching from one member of the family to another when the execution of one activity graph fails. In this paper, we study the conditions when plan switching is feasible. Then we introduce an approach for plan switching and report the simulation results of this approach.