Speculation meets checkpointing

Authors:
Arkadiusz Danilecki;Michał Szychowiak
Affiliations:
Institute of Computing Science, Poznań University of Technology, Poznań, Poland;Institute of Computing Science, Poznań University of Technology, Poznań, Poland
Venue:
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Year:
2006

Citing 5
Cited 0

Data prefetching for software DSMs

ICS '98 Proceedings of the 12th international conference on Supercomputing
Memory sharing predictor: the key to a speculative coherent DSM

ISCA '99 Proceedings of the 26th annual international symposium on Computer architecture
Selective, accurate, and timely self-invalidation using last-touch prediction

Proceedings of the 27th annual international symposium on Computer architecture
A Low Overhead Logging Scheme for Fast Recovery in Distributed Shared Memory Systems

The Journal of Supercomputing
Inferential queueing and speculative push

International Journal of Parallel Programming - Special issue I: The 17th annual international conference on supercomputing (ICS'03)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a checkpointing mechanism destined for Distributed Shared Memory (DSM) systems with speculative prefetching. Speculation is a general technique involving prediction of the future of a computation, namely accesses to shared objects unavailable on the accessing node (read faults). Thanks to such predictions objects can be fetched before the actual access operation is performed, resulting, at least potentially, in considerable performance improvement. The proposed mechanism is based on independent incremental checkpointing integrated with a coherence protocol introducing little overhead. It ensures the consistency of checkpoints, allowing fast recovery from failures.