Das, Prashanti ; Das, Dibyendu ; Dasgupta, Pallab (1999) Adaptive algorithms for scheduling static task graphs in dynamic distributed systems In: 6th International Conference on High Performance Computing - HiPC'99, 17-20 December 1999, Calcutta, India.
Full text not available from this repository.
Official URL: http://link.springer.com/chapter/10.1007/978-3-540...
Related URL: http://dx.doi.org/10.1007/978-3-540-46642-0_20
Abstract
In this paper we consider the problem of scheduling a given task graph on a dynamic network, where processors may become available or unavailable during the lifetime of the computation. We show that known list scheduling algorithms which use task cloning can be extended to develop efficient algorithms in this model. We also present a different approach where in anticipation of processor failures and recoveries, a set of schedules are precomputed and schedule switching is done whenever a failure or recovery takes place.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Springer-Verlag Berlin Heidelberg. |
| ID Code: | 102333 |
| Deposited On: | 09 Mar 2018 10:13 |
| Last Modified: | 09 Mar 2018 10:13 |
Repository Staff Only: item control page
