Change search
ReferencesLink to record
Permanent link

Direct link
Making garbage collection independent of the amount of garbage
Number of Authors: 1
1987 (English)Report (Refereed)
Abstract [en]

(Appendix to SICS Research Report R86009) This appendix shows in detail how to make the time for the garbage collection algorithm presented in [AHS 86] become proportional to n log n , where n is the number of non-garbage cells. It is assumed that the reader is familiar with [AHS 86] since no further presentation of the notation used is made here. The compaction phase of that algorithm is proportional to the amount of memory, i.e. proportional to the sum of garbage and non-garbage. This is unfortunate since for instance a garbage collection using copying is just proportional to the amount of non-garbage. If a program generates much more garbage than non-garbage, it might be a severe drawback of a garbage collection algorithm to depend on the amount of garbage. This paper shows how to make the garbage collection in [AHS] independent of the amount of garbage.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1987, 1. , 10 p.
SICS Research Report, ISSN 0283-3638 ; R87:08
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-22212OAI: diva2:1041756
Original report number R87008.Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(900 kB)2 downloads
File information
File name FULLTEXT01.pdfFile size 900 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 2 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link