A real time garbage collection algorithm

Other Scholarly Content

Analytics

Citeable URL: https://ir.library.oregonstate.edu/concern/defaults/2n49t921s

Attribute Name	Values
Creator	Jiang, Zhu
Abstract	This paper describes a real time garbage collection algorithm. It allocates storage automatically from a heap, and does not require the programmer to give any indication that particular items are no longer useful or accessible. A garbage collection algorithm is considered to be real time if the amount of work to be done can be controlled each time the garbage collector is called. Since objects with short lifetimes account for a large portion of storage use. it is worth optimizing a garbage collector to reclaim storage for these objects more quickly. A reference count scheme in cooperation with compaction for reclaiming storages for young objects, and a linearizing, compacting, copying scheme to collect self-referential structures and reorganize storage for old objects at the users discretion are proposed. Keywords: garbage collection, storage management, real time, virtual memory 1989 best estimate for issue date based on available information.
Resource Type	Research Paper
Date Issued	1989
Academic Affiliation	Computer Science
Rights Statement	In Copyright
Publisher	Oregon State University. Department of Computer Science
Peer Reviewed	No
Language	English [eng]

Thumbnail	Title	Date Uploaded	Visibility	Actions
	Jiang_Zhu_1990.pdf	2023-03-24	Public	Download