Sanjay, HA and Vadhiyar, Sathish S (2011) Strategies for Rescheduling Tightly-Coupled Parallel Applications in Multi-Cluster Grids. In: Journal of Grid Computing, 9 (3). pp. 379-403.
Strategies.pdf - Published Version
Restricted to Registered users only
Download (1016Kb) | Request a copy
As computational Grids are increasingly used for executing long running multi-phase parallel applications, it is important to develop efficient rescheduling frameworks that adapt application execution in response to resource and application dynamics. In this paper, three strategies or algorithms have been developed for deciding when and where to reschedule parallel applications that execute on multi-cluster Grids. The algorithms derive rescheduling plans that consist of potential points in application execution for rescheduling and schedules of resources for application execution between two consecutive rescheduling points. Using large number of simulations, it is shown that the rescheduling plans developed by the algorithms can lead to large decrease in application execution times when compared to executions without rescheduling on dynamic Grid resources. The rescheduling plans generated by the algorithms are also shown to be competitive when compared to the near-optimal plans generated by brute-force methods. Of the algorithms, genetic algorithm yielded the most efficient rescheduling plans with 9-12% smaller average execution times than the other algorithms.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Springer.|
|Keywords:||Rescheduling;Parallel applications;Multi-phase;Rescheduling plans|
|Department/Centre:||Division of Information Sciences > Supercomputer Education & Research Centre|
|Date Deposited:||05 Sep 2011 04:48|
|Last Modified:||05 Sep 2011 04:48|
Actions (login required)