Abstract
We have extended the parallel computer algebra system Distributed Maple by fault tolerance mechanisms such that computations are not any more limited by the meantime between failures. This is complicated by the fact that task arguments and results may embed task handles and that the system’s scheduling layer has only a little information about the computing layer. Nevertheless, the mostly functional parallel programming model makes it possible with relatively simple means.
Supported by grant SFB F013/F1304 of the Austrian Science Foundation (FWF).
Chapter PDF
Similar content being viewed by others
References
A. Clematis and V. Gianuzzi. CPVM —Extending PVM for Consistent Checkpointing. In 4th Euromicro Workshop on Parallel and Distributed Processinge (PDP’96), pages 67–76, Braga, Portugal, January 24–26, 1996. IEEE CS Press.
G. E. Fagg and J. J. Dongarra. FT-MPI: Fault Tolerant MPI, Supporting Dynamic Applications in a Dynamic World. In Recent Advances in Parallel Virtual Machine and Message Passing Interface, Proceedings of the 7th European PVM/MPI Users’ Group Meeting, volume 1908 of Lecture Notes in Computer Science, pages 346–353, Balatonfüred, Hungary, September 10–13, 2000. Springer.
A. Iamnitchi and I. Foster. A Problem Specific Fault Tolerance Mechanism for Asynchronous, Distributed Systems. In 29th International Conference on Parallel Processing (ICPP), Toronto, Canada, August 21–24, 2000. Ohio State University.
R. Jagannathan and E. A. Ashcroft. Fault Tolerance in Parallel Implementations of Functional Languages. In 21st International Symposium on Fault-Tolerant Computing, pages 256–263, Montreal, Canada, June, June 1991. IEEE CS Press.
W. Schreiner. Distributed Maple —User and Reference Manual. Technical Report 98-05, RISC-Linz, Johannes Kepler University, Linz, Austria, May 1998. http://www.risc.uni-linz.ac.at/software/distmaple.
W. Schreiner, C. Mittermaier, and F. Winkler. On Solving a Problem in Algebraic Geometry by Cluster Computing. In Euro-Par 2000, 6th International Euro-Par Conference, volume 1900 of Lecture Notes in Computer Science, pages 1196–1200, Munich, Germany, August 29–September 1, 2000. Springer, Berlin.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schreiner, W., Kusper, G., Bosa, K. (2001). Fault Tolerance for Cluster Computing Based on Functional Tasks. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds) Euro-Par 2001 Parallel Processing. Euro-Par 2001. Lecture Notes in Computer Science, vol 2150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44681-8_102
Download citation
DOI: https://doi.org/10.1007/3-540-44681-8_102
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42495-6
Online ISBN: 978-3-540-44681-1
eBook Packages: Springer Book Archive