• DocumentCode
    2044848
  • Title

    Plan switching: an approach to plan execution in changing environments

  • Author

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

  • Author_Institution
    Sch. of Electr. Eng. & Comput. Sci., Central Florida Univ., Orlando, FL
  • fYear
    2006
  • fDate
    25-29 April 2006
  • 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
  • Keywords
    distributed processing; activity graphs; autonomous resource providers; computing task execution; heterogeneous computing; plan execution; plan switching; Availability; Computational efficiency; Computational modeling; Computer science; Distributed computing; Large-scale systems; Physics; Process planning; Real time systems; Uncertainty;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International
  • Conference_Location
    Rhodes Island
  • Print_ISBN
    1-4244-0054-6
  • Type

    conf

  • DOI
    10.1109/IPDPS.2006.1639395
  • Filename
    1639395