Adaptive Garbage Collection and Experiments for Implementation.

Saved in:

Bibliographic Details
Title:	Adaptive Garbage Collection and Experiments for Implementation.
Authors:	Tanaka, Eiko^1,2, Tanaka, Yoshio^1,2,3, Nakanishi, Masakazu⁴
Source:	Systems & Computers in Japan. 11/1/95, Vol. 26 Issue 12, p8-16. 9p.
Subjects:	Garbage collection (Computer science), Computer memory management, Computer science, Computer storage devices, Computer systems, Electronic data processing
Abstract:	In the list processing language, dynamic memory management is indispensable, and hence various methods have been proposed. In one such method, the object is discriminated according to its life, time and garbage collection (GC) is applied efficiently to the unnecessary object, based on a preset ‘threshold.’ A problem is how the threshold should be set in order to realize the most efficient GC. This paper points out that the threshold that realizes the highest efficiency depends on the application to be executed, and proposes the technique of adaptive garbage collection (AGC). An experiment toward its implementation is reported. AGC is a kind of GC which adjusts the threshold dynamically according to memory use, so that efficient operation is realized for a variety of applications. Experiments aiming at the realization of AGC show that applications have their own pace in consuming the memory, and the optimal value of the threshold is related to that pace. It is seen also that the memory-consuming pace of the application is related closely to the data in the interpreter, leading to the definition of the useful parameter for realizing the efficient AGC. [ABSTRACT FROM AUTHOR]
	Copyright of Systems & Computers in Japan is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	In the list processing language, dynamic memory management is indispensable, and hence various methods have been proposed. In one such method, the object is discriminated according to its life, time and garbage collection (GC) is applied efficiently to the unnecessary object, based on a preset ‘threshold.’ A problem is how the threshold should be set in order to realize the most efficient GC. This paper points out that the threshold that realizes the highest efficiency depends on the application to be executed, and proposes the technique of adaptive garbage collection (AGC). An experiment toward its implementation is reported. AGC is a kind of GC which adjusts the threshold dynamically according to memory use, so that efficient operation is realized for a variety of applications. Experiments aiming at the realization of AGC show that applications have their own pace in consuming the memory, and the optimal value of the threshold is related to that pace. It is seen also that the memory-consuming pace of the application is related closely to the data in the interpreter, leading to the definition of the useful parameter for realizing the efficient AGC. [ABSTRACT FROM AUTHOR]
ISSN:	08821666
DOI:	10.1002/scj.4690261202