Recoverable Distributed Shared Virtual Memory
IEEE Transactions on Computers
Recovery in distributed systems using optimistic message logging and check-pointing
Journal of Algorithms
Sharing and protection in a single-address-space operating system
ACM Transactions on Computer Systems (TOCS) - Special issue on computer architecture
Grasshopper: an orthogonally persistent operating system
Computing Systems
Physical integrity in a large segmented database
ACM Transactions on Database Systems (TODS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Using directed graphs to describe entity dependency in stable distributed persistent stores
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
The grand unified theory of address spaces
HOTOS '95 Proceedings of the Fifth Workshop on Hot Topics in Operating Systems (HotOS-V)
Efficient Transparent Optimistic Rollback Recovery for Distributed Application Programs
Efficient Transparent Optimistic Rollback Recovery for Distributed Application Programs
Operating system support for persistent and recoverable computations
Communications of the ACM
Stabilizers: a modular checkpointing abstraction for concurrent functional programs
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Modular Checkpointing for Atomicity
Electronic Notes in Theoretical Computer Science (ENTCS)
Lightweight checkpointing for concurrent ml
Journal of Functional Programming
| Hi-index | 0.02 |
Abstract: Persistent object systems must provide some form of checkpointing to ensure that changes to persistent data are secured on non-volatile storage. When processes share or exchange modified data, mechanisms must be provided to ensure that they may be consistently checkpointed. This may be performed eagerly by synchronously checkpointing all dependent data. Alternatively, optimistic techniques may be used where processes are individually checkpointed and globally consistent states are found asynchronously. This paper examines two eager checkpointing techniques and describes a new optimistic technique. The technique is applicable in systems such as SASOS, where the notion of process and address space are decoupled.