Addressing Mechanisms and Persistent Programming
The question of addressing mechanisms is at the basis of all implementations of persistent programming. What persistent programming enables us to do is store complex data structures by virtue of being able to preserve referential structure. What I want to look at is what different forms of addressing can be used to support persistence.
KeywordsAssociative Memory Garbage Collection Address Space Virtual Memory Garbage Collector
Unable to display preview. Download preview PDF.
- [ABCCM84a]Atkinson, M.P., Bailey, P.J., Chisholm, K.J., Cockshott, W.P., and Morrison, R., Procedures as Persistent Data Objects, Persistent Programming Research Report 9 Dept. of Computing Science, University of Glasgow & Dept. of Computational Science, University of St. Andrews, 1984.Google Scholar
- [ACC83a]Atkinson, M.P., KJ Chisholm, and W.P. Cockshott, CMS—A chunk Management System Software Practice and Experience, Vol. 13, No. 3, March 1983.Google Scholar
- [ACC83b]Atkinson, M.P., K.J Chisholm, and W.P. Cockshott, Algorithms for a Persistent Heap Software Practice and Experience, Vol. 13, No. 3, March 1983.Google Scholar
- [COCK84]Cockshott, W.P., ASSOSARCH — Associator architechture Edinburgh University Computing Science Dept, Data Curator Group, 1984.Google Scholar
- [KAEH81]Kaehler, T., Virtual Memory for an Object Oriented Language, Byte, August 1981.Google Scholar
- [MP84]Meertens, L.G.L.T., and S. Pemberton, An implementation of the B programing language, Centrum voor Wiskunde en Informatica, 1984.Google Scholar
- [ORGA84]Organick, E., A programmers view of the Intel 432, McGrawHill, 1984.Google Scholar
- [SOLT81]Soltis, F.G., Design of a Small Business Data Processing System, IEEE Computer, September 1981.Google Scholar