Eiko Tanaka, Yoshio Tanaka, Masakazu Nakanishi
Systems and Computers in Japan, 26(12) 8-16, 1995
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. Copyright © 1995 Wiley Periodicals, Inc., A Wiley Company