Reliable garbage collection in distributed object oriented systems

Author

Gupta, A. ; Fuchs, W.K.

Author_Institution

Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA

fYear

1988

fDate

5-7 Oct. 1988

Firstpage

324

Lastpage

328

Abstract

Examines the problem of reliable storage reclamation in a distributed object-oriented system. A distributed algorithm is proposed that utilizes a modified reference counting strategy for intermode pointers and mark-and-sweep for local garbage collection. The algorithm allows nodes to fail in a failstop manner, in which case the global garbage collection functions in a gracefully degraded mode of operation. Compaction of objects is supported and object locality is exploited to reduce overhead.<>

Keywords

distributed databases; object-oriented programming; reliability; storage management; distributed algorithm; distributed object oriented systems; garbage collection; gracefully degraded mode; intermode pointers; mark-and-sweep; node failure; object compaction; object locality; overhead reduction; reference counting strategy; reliable storage reclamation; Compaction; Contracts; Data structures; Degradation; Distributed algorithms; Distributed computing; Instruments; NASA; Object detection; Storage automation;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Software and Applications Conference, 1988. COMPSAC 88. Proceedings., Twelfth International

Conference_Location

Chicago, IL, USA

Print_ISBN

0-8186-0873-0

Type

conf

DOI

10.1109/CMPSAC.1988.17194

Filename

17194

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2790669