Distributed persistent object system with uniform representation of pointers and its garbage collection

In persistent object storage, one of the most influential overheads at application runtime is caused by the conversion of pointers for transparency among variously represented pointers. Existing systems require some representations of pointers, which causes conversion of pointers and runtime overheads, because of the limitation of 32-bit processors' virtual address space, and efficient garbage collection (GC) of distributed persistent objects. In order to remove overheads of pointer conversion, we propose to use an indirect back pointer (IBP) for a distributed persistent object storage on 64-bit processors. IBP is an auxiliary data structure for part-by-part compacting GC. Virtual spaces of 64-bit processors are so large that systems can exploit the linear mapping of the storage and uniform representation of pointers that do not need the conversion of pointers. IBP maintains a list of inter-partition pointers that is sufficient for part-by-part compacting GC. Because IBP is separated from the pointers that are used by applications, IBP and uniform representation of pointers are compatible. In this way, the proposed system achieves compacting GC and no overheads for conversion of pointers at application runtime.

[1]  L. Amsaleg,et al.  Eos, an environment for object-based systems , 1992, Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences.

[2]  Ronald Morrison,et al.  An Approach to Persistent Programming , 1989, Comput. J..

[3]  David J. DeWitt,et al.  QuickStore: A high performance mapped object store , 1994, SIGMOD '94.

[4]  J. Eliot B. Moss Addressing Large Distributed Collections of Persistent Objects: The Mneme Project's Approach , 1989, DBPL.

[5]  Michael J. Carey,et al.  Persistence in the E Language: Issues and Implementation , 1989, Softw. Pract. Exp..

[6]  Paul R. Wilson,et al.  Pointer swizzling at page fault time: efficiently supporting huge address spaces on standard hardware , 1991, CARN.

[7]  Alfred L. Brown,et al.  Persistent object stores , 1988 .

[8]  Takashi Masuda,et al.  Page-based optimistic concurrency control for memory-mapped persistent object systems , 1995, Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences.

[9]  Marc Shapiro,et al.  Garbage Collection of Persistent Objects in Distributed Shared Memory , 1994, POS.

[10]  Marc Shapiro,et al.  Garbage collection and DSM consistency , 1994, OSDI '94.

[11]  Peter Boehler Bishop,et al.  Computer systems with a very large address space and garbage collection , 1977 .

[12]  Vivek Singhal,et al.  Texas: An Efficient, Portable Persistent Store , 1992, POS.

[13]  Eugene J. Shekita,et al.  Cricket: A Mapped, Persistent Object Store , 1990, POS.

[14]  David J. DeWitt,et al.  The 007 Benchmark , 1993, SIGMOD '93.

[15]  Gunter Schlageter,et al.  Redesign of optimistic methods: Improving performance and applicability , 1986, 1986 IEEE Second International Conference on Data Engineering.

[16]  Marc Shapiro,et al.  Larchant-RDOSS: a Distributed Shared Persistent Memory and its Garbage Collector , 1995, WDAG.

[17]  Jack A. Orenstein,et al.  The ObjectStore database system , 1991, CACM.