|Publisher version (open access)||956 KB||Adobe Acrobat PDF||View/Open
Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/29967
- Using directed graphs to describe entity dependency in stable distributed persistent stores
Henskens, Frans A.
- In a persistent object store, the acts of modifying data and reading modified data result in the creation of dependencies between the modifying process and the data. Dependencies may be represented using sets, and over time these may grow to encompass many objects and processes. Checkpoint and roll-back operations must propagate to all elements in such a set. This paper presents a new notation for representing dependencies, and shows that differentiating between the dependencies created by modifying data and reading modified data reduces the extent of propagation of checkpoint and roll-back operations.
- Twenty-Eighth Hawaii International Conference on System Sciences, 1995. Proceedings of the 28th Hawaii International Conference on System Sciences. Volume 2 (Wailea, HI 3-6 January, 1995 ) p. 665-674
- Publisher Link
- Institute of Electrical and Electronics Engineers (IEEE)
- Resource Type
- conference paper
- Copyright © 1995 IEEE. Reprinted from Proceedings of the 28th Hawaii International Conference on System Sciences, Vol. 2, p. 665-674. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Newcastle's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to email@example.com. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
- Full Text