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.
Original language | English |
---|---|
Title of host publication | Proceedings of the International Workshop on Object-Orientation in Operating Systems (IWOOOS) |
Publisher | IEEE Computer Society |
Pages | 24-32 |
ISBN (Print) | 0818671157 |
DOIs | |
Publication status | Published - 1995 |
Event | International Workshop on Object Orientation in Operating Systems (IWOOS) - Lund, Sweden Duration: 14 Aug 1995 → 15 Aug 1995 |
Conference
Conference | International Workshop on Object Orientation in Operating Systems (IWOOS) |
---|---|
Abbreviated title | IWOOS |
Country/Territory | Sweden |
City | Lund |
Period | 14/08/95 → 15/08/95 |