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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Das, D., Dasgupta, P., Das, P.P.: A heuristic for the maximum processor requirement for scheduling layered task graphs with cloning. Journal of Parallel and Distributed Computing 49, 169–181 (1998)
Kruatrachue, B., Lewis, T.: Grain size determination for parallel programs. IEEE Software, 23–32 (January 1998)
Palis, M.A., Liou, J.C., Wei, D.S.L.: Task Clustering and Scheduling for Distributed Memory Parallel Architectures. IEEE Transactions on Parallel and Distributed Systems 7(1), 46–54 (1996)
Papadimitriou, C.H., Yannakakis, M.: Towards an architecture independent analysis of parallel programs. SIAM J. Computing 19(2), 138–153 (1990)
Rewini, H.E., Lewis, T., Ali, H.H.: Task Scheduling for Parallel and Distributed Systems. Prentice-Hall, Englewood Cliffs (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Das, P., Das, D., Dasgupta, P. (1999). Adaptive Algorithms for Scheduling Static Task Graphs in Dynamic Distributed Systems. In: Banerjee, P., Prasanna, V.K., Sinha, B.P. (eds) High Performance Computing – HiPC’99. HiPC 1999. Lecture Notes in Computer Science, vol 1745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46642-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-46642-0_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66907-4
Online ISBN: 978-3-540-46642-0
eBook Packages: Springer Book Archive