Fault Tolerance for Cluster Computing Based on Functional Tasks

Authors:
Wolfgang Schreiner;Gabor Kusper;Karoly Bosa
Affiliations:
-;-;-
Venue:
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Year:
2001

Citing 3
Cited 0

On Solving a Problem in Algebraic Geometry by Cluster Computing (Research Note)

Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
A Problem-Specific Fault-Tolerance Mechanism for Asynchronous, Distributed Systems

ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
CPVM -- Extending PVM for Consistent Checkpointing

PDP '96 Proceedings of the 4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96)

Quantified Score

Hi-index	0.00

Visualization

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.