On page-based optimistic process checkpointing

Alan Dearle, D Hulse

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationProceedings of the International Workshop on Object-Orientation in Operating Systems (IWOOOS)
PublisherIEEE Computer Society
Pages24-32
ISBN (Print)0818671157
DOIs
Publication statusPublished - 1995
EventInternational Workshop on Object Orientation in Operating Systems (IWOOS) - Lund, Sweden
Duration: 14 Aug 199515 Aug 1995

Conference

ConferenceInternational Workshop on Object Orientation in Operating Systems (IWOOS)
Abbreviated titleIWOOS
Country/TerritorySweden
CityLund
Period14/08/9515/08/95

Fingerprint

Dive into the research topics of 'On page-based optimistic process checkpointing'. Together they form a unique fingerprint.

Cite this