Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/IPDPS.2006.1639395 | IPDPS |
Keywords | Field | DocType |
heterogeneous computing environment,possible solution,activity graph,simulation result,goal state,complex task,complex computing task,plan switching,autonomous resource provider,current state,availability,physics,uncertainty,heterogeneous computing,computational modeling,computer science,distributed processing,real time systems,distributed computing | Graph,Computer science,Parallel computing,Symmetric multiprocessor system,Distributed computing | Conference |
ISBN | Citations | PageRank |
1-4244-0054-6 | 1 | 0.44 |
References | Authors | |
5 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Han Yu | 1 | 99 | 7.29 |
| Dan C. Marinescu | 2 | 540 | 90.42 |
| Annie S. Wu | 3 | 425 | 45.72 |
| Howard Jay Siegel | 4 | 5428 | 689.33 |
| Rose Daley | 5 | 38 | 2.60 |
| I-Jeng Wang | 6 | 277 | 31.46 |