Abstract
This paper discusses the variables that influence the performance of a “garbage collector” with and without compacting and using the Atlas technique of storage administration. The results obtained indicate the cases in which compacting might be desirable.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Berkeley, E. C., Bobrow D. G., Editors,The Programming Language Lisp: Its Operation and Applications, Information International, Inc., Cambridge, Mass., 1964.
Cohen J., Nguyen-Huu-Dung,Définition de procédures Lisp en Algol — Exemple d'utilisation, Chiffres, Vol. 8, No. 4, 1965.
Cohen, J.,Remarques et additions aux procédures Lisp en Algol, Calcolo, 4, vol. 3, 1966.
Cohen, J.,A Use of Fast and Slow Memories in List Processing Languages, Report, Institut de Mathématiques Appliquées, Grenoble, 1965; Comm. ACM, Feb. 1967.
McCarthy, J., et al.,Lisp I.5 Programmer's Manual, The MIT Press, Cambridge, Mass., 1962.
Schorr, H., Waite,An Efficient Machine-Independent Procedure for Garbage Collection in Various List Structures, IBM Research Report RC-1450, 1965.
Kilburn, T., Edwards, D. B. G., Lanigan, M. J., and Sumner, F. H.,One-Level Storage System, IRE Transactions on Electronic Computers, vol. EC-11, no. 2, April 1962.
Naur, P.,Design of the Gier Algol Compiler, Part I, BIT, no. 3, 1963.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cohen, J., Trilling, L. Remarks on »garbage collection« using a two-level storage. BIT 7, 22–30 (1967). https://doi.org/10.1007/BF01934123
Issue Date:
DOI: https://doi.org/10.1007/BF01934123