A compacting garbage collector for unidirectional heaps
- Kent BoortzAffiliated withErlang Systems, Ericsson Software Technology
- , Dan SahlinAffiliated withComputer Science Laboratory, Ericsson Telecom
A unidirectional heap is a heap where all pointers go in one direction, e.g. from newer to older objects. For a strict functional language, such as Erlang, the heap may be arranged so that it is unidirectional. We here present a compacting garbage collection algorithm which utilizes the fact that a heap is unidirectional.
Only one memory space is used in our algorithm. In fact, no extra memory is used at all, not even any reserved bits within the cells. The algorithm is quite easy to extend to a variant of generational garbage collection.
- A compacting garbage collector for unidirectional heaps
- Book Title
- Implementation of Functional Languages
- Book Subtitle
- 9th International Workshop, IFL'97 St. Andrews, Scotland, UK September 10–12, 1997 Selected Papers
- pp 358-374
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.