Abstract
The design and analysis of a new GC scheme called MOA is presented with its implementation on PLisp (Portable Lisp). MOA is “stop-and-collect” type GC and is based on a Morris's sliding compaction scheme. MOA has the excellent features such as: (1) it can perform sliding compaction with a time proportional nearly to the size of all data objects in use, (2) it requires an additional space of a small size to achieve such a time cost saving, (3) it can skip a GC process for a special cluster called an “anchor”, reducing the total GC processing time considerably. MOA has been successfully implemented on PLisp which provides a large amount of storage space. MOA is superior to other GC based on conventional sliding compaction and copying collection, as shown in several experiments.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. McCarthy. et al. LISP 1.5 Programmer's Manual. MIT Press, MA., 1962.
A. Colmerauer. et al. Un système de communication en franÇais. Technical report, Faculté des Science de Luminy, Université Aix-Marseille II, France, 1972.
R.R. Fenichel and J.C. Yochelson. A lisp garbage collector for virtual memory computer systems. Comm. of ACM, 12(11):611–612, November 1969.
M. Terashima and E. Goto. Genetic order and compactifying garbage collectors. Information Processing Letters, 7(1):27–32, 1978.
D. Sahlin. Making garbage collection independent of the amount of garbage. Technical report, SICS, Box 1263 S-163 13 SPANGA SWEDEN, 1987. Research Report R86008.
K. Appleby. et al. Garbage collection for prolog based on wam. Comm. of ACM, 31(6):719–741, 1988.
Y. Bekkers. et al. Dynamic memory management for sequential logic programming languages. In Y. Bekkers and J. Cohen, editors, IWMM 92 Memory Management, pages 82–102, September 1992. LNCS 637, Springer-Verlag.
J. Cohen. Garbage collection of linked data structures. ACM Computing Surveys, 13(7):341–367, 1981.
S. Carlsson. et al. A fast expected-time compacting garbage-collection algorithm. In ECOOP/OOPSLA '90 Workshop on Garbage Collection in Object-Oriented Systems, 1990. available from ftp.diku.dk:/pub/GC90/Mattson.ps.
M. Suzuki and M. Terashima. Time-and space-efficient garbage collection based on sliding compaction. Transaction of Information Processing (IPSJ), 36(4):925–931, 1995.
F.L. Morris. Time-and space-efficient garbage collection algorithm. Comm. of ACM, 21(8):662–665, August 1978.
H. Koide. Hybrid garbage collection. Master's thesis, Department of Computer Science, University of Electro-Communications, Tokyo, Japan, 1993.
B. Zorn. Comparing mark-and-sweep and stop-and-copy garbage collection. In ACM Conference on LISP and Functional Programming, pages 87–98, 1990.
B. Lang and F. Dupont. Incremental incrementally compacting garbage collection. In ACM Symposium on Interpreters and Interpretive Techniques (SIGPLAN Notices 22 (7), pages 253–263, June 1987.
H. Koide and K. Noshita. On the copying garbage collector which preserves the genetic order (in Japanese). Transaction of Information Processing (IPSJ), 34(11):2395–2400, November 1993.
H. Liberman and C. Hewitt. A real-time garbage collector based on the lifetimes of objects. Comm. ACM, 26(6):419–429, June 1983.
D. Ungar. Generation scavenging: A non-disruptive high performance storage reclamation algorithm. In A CM Conference on Practical Programming Environments, pages 157–167, April 1984.
A. Appel. Simple generational garbage collection and fast allocation. Software Practice and Experience, 19(2):171–183, 1989.
G.L. Steele Jr. Common LISP, 2nd ed. Digital Press, 1990.
D.E. Knuth. The Art of Computer Programming, Vol 1, Fundamental Algorithms (2-nd. Ed.). Addison-Wesley, MA., 1971.
C.L. Chang. The unit proof and the input proof in theorem proving. Journal of ACM, 17(4):698–707, 1970.
I. Takeuchi. The 2nd lisp contest. Preprint of WGSYM (IPSJ), 5–3, August 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag
About this paper
Cite this paper
Suzuki, M., Koide, H., Terashima, M. (1995). MOA — A fast sliding compaction scheme for a large storage space. In: Baler, H.G. (eds) Memory Management. IWMM 1995. Lecture Notes in Computer Science, vol 986. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60368-9_25
Download citation
DOI: https://doi.org/10.1007/3-540-60368-9_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60368-9
Online ISBN: 978-3-540-45511-0
eBook Packages: Springer Book Archive