A compacting incremental collector and its performance in a production quality compiler
Authors:
Open Access
- 1 October 1998
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 34 (3) , 1-9
Abstract
We present a new near-real-time compacting collector and its implementation in a production quality Scheme compiler (Gambit-C). Our goal is to use this system as a base for an implementation of Erlang for writing soft real-time telecommunication applications. We start with a description of Gambit-C's memory organisation and its blocking collector. The design and integration of the incremental collector within Gambit-C are then explained. Finally we measure the performance of the incremental collector and compare it to the original blocking collector. We found that the overhead of the incremental collector is high (a factor of 1.3 to 8.1, with a median of 2.24) but nevertheless the collection pauses are compatible with typical soft real-time requirements (we get an average pause of 2.9 milliseconds and a maximum pause of 15 milliseconds on a 133Mhz DEC Alpha 21064).Keywords
This publication has 10 references indexed in Scilit:
- Benchmarking implementations of functional languages with ‘Pseudoknot’, a float-intensive benchmarkJournal of Functional Programming, 1996
- Polling efficiently on stock hardware1993
- Real-time replication garbage collectionACM SIGPLAN Notices, 1993
- Representing control in the presence of first-class continuationsACM SIGPLAN Notices, 1990
- A parallel virtual machine for efficient scheme compilation1990
- Garbage collection in an uncooperative environmentSoftware: Practice and Experience, 1988
- Performance and Evaluation of LISP Systems1985
- On-the-fly garbage collectionCommunications of the ACM, 1978
- Multiprocessing compactifying garbage collectionCommunications of the ACM, 1975
- A nonrecursive list compacting algorithmCommunications of the ACM, 1970