State Restoration in Systems of Communicating Processes

Authors:
D. L. Russell
Affiliations:
Bell Laboratories
Venue:
IEEE Transactions on Software Engineering
Year:
1980

Citing 0
Cited 6

Minimizing timestamp size for completely asynchronous optimistic recovery with minimal rollback

SRDS '96 Proceedings of the 15th Symposium on Reliable Distributed Systems
Completely Asynchronous Optimistic Recovery with Minimal Rollbacks

FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
An Efficient Index-Based Checkpointing Protocol with Constant-Size Control Information on Messages

IEEE Transactions on Dependable and Secure Computing
Design, Analysis and Performance Evaluation of a New Algorithm for Developing a Fault Tolerant Distributed System

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
A weighted checkpointing protocol for mobile distributed systems

International Journal of Ad Hoc and Ubiquitous Computing
A consistent checkpointing-recovery protocol for minimal number of nodes in mobile computing system

HiPC'07 Proceedings of the 14th international conference on High performance computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In systems of asynchronous processes using messagelists with SEND-RECEIVE primitives for interprocess communication recovery primitives are defined to perform state restoration: MARK saves a particular point in the execution of the program; RESTORE resets the system state to an earlier point (saved by MARK); and PURGE discards redundant information when it is no longer needed for possible state restoration.