posted on 2025-05-08, 18:34authored byF. A. Henskens, D. M. Koch, R. Jalili, J. Rosenberg
Persistent stores support uniform management of data objects regardless of their lifetimes and locations. Such stores typically maintain a self-consistent state even after failure of the host computer system. This property is termed stability, and may be achieved using operations called checkpoints. When objects in the store are modified, or modified objects are accessed, dependencies are created between the modifying processes and the objects. Directed graphs may be used to describe such dependencies. For the persistent store to maintain a consistent state, all dependent entities must be checkpointed together. In this paper we show that hardware support
can assist in the construction of stable stores for which stability is based on dependency graphs. We then describe an implementation of such support in the Monads-MM computer.
History
Source title
Workshops in Computing: Proceedings of the Sixth International Workshop on Persistent Operating Systems
Name of conference
Sixth International Workshop on Persistent Operating Systems
Location
Tarascon, France
Start date
1994-09-05
End date
1994-09-09
Pagination
387-399
Editors
Atkinson, M., Maier, D. and Benzaken, V.
Publisher
Springer-Verlag / British Computer Society
Place published
London
Language
en, English
College/Research Centre
Faculty of Engineering and Built Environment
School
School of Electrical Engineering and Computer Science