An efficient approach to cyclic reference counting based on a coarse-grained search
Research highlights
► A coarse-grained cycle collection algorithm (CGA) is exploited to obtain efficiency. ► A hybrid approach using both CGA and a traditional algorithm is demonstrated. ► The efficiency of the hybrid method depends on a heuristic criterion. ► The experiments show an opportunity to achieve both practicability and efficiency.
References (22)
Cyclic reference counting with lazy mark-scan
Information Processing Letters
(1992)Generational cyclic reference counting
Information Processing Letters
(1993)An efficient algorithm for cyclic reference counting
Information Processing Letters
(2002)- et al.
Cyclic reference counting with local mark-scan
Information Processing Letters
(1990) - B. Alpern, C.R. Attanasio, A. Cocchi, D. Lieber, S. Smith, T. Ngo, J.J. Barton, S.F. Hummel, J.C. Sheperd, M. Mergen,...
- D.F. Bacon, C.R. Attanasio, H.B. Lee, R.T. Rajan, S. Smith, Java without the coffee breaks: A nonintrusive...
- et al.
Concurrent cycle collection in reference counted systems
- S.M. Blackburn, P. Cheng, K.S. McKinley, Oil and water? High performance garbage collection in Java with MMTk, in:...
Reference count garbage collection
Software Practice and Experience
(1984)A method for overlapping and erasure of lists
Communications of the ACM
(1960)
Cited by (0)
Copyright © 2010 Elsevier B.V. All rights reserved.