On page-based optimistic process checkpointing
MetadataShow full item record
Altmetrics Handle Statistics
Altmetrics DOI Statistics
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.
Dearle , A & Hulse , D 1995 , On page-based optimistic process checkpointing . in Proceedings of the International Workshop on Object-Orientation in Operating Systems (IWOOOS) . , 470583 , IEEE Computer Society , pp. 24-32 , International Workshop on Object Orientation in Operating Systems (IWOOS) , Lund , Sweden , 14/08/95 . https://doi.org/10.1109/IWOOS.1995.470583conference
Proceedings of the International Workshop on Object-Orientation in Operating Systems (IWOOOS)
Copyright © 1995 IEEE. This work has been made available online in accordance with publisher policies or with permission. Permission for further reuse of this content should be sought from the publisher or the rights holder. This is the author created accepted manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1109/IWOOS.1995.470583