ACM Home Page
Please provide us with feedback. Feedback
A compacting incremental collector and its performance in a production quality compiler
Full text PdfPdf (1.20 MB)
Source International Symposium on Memory Management archive
Proceedings of the 1st international symposium on Memory management table of contents
Vancouver, British Columbia, Canada
Pages: 1 - 9  
Year of Publication: 1998
ISBN:1-58113-114-3
Also published in ...
Authors
Martin Larose  Département d'informatique et recherche opérationnelle, Université de Montréal
Marc Feeley  Département d'informatique et recherche opérationnelle, Université de Montréal
Sponsor
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 27,   Citation Count: 14
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/286860.286861
What is a DOI?

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).


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
AVWW96
 
AXD98
AXD 301 High-performance ATM switching system. Ericsson Telecom AB, 1998.
 
BW88
Che70
 
DFS96
Danny Dub@, Marc Feeley, and Manuel Serrano. Un GC temps r@el semi-compactant. In Guy Lapalme and Christian Queinnec, editors, Journ~es Francophones des Langages Applicatifs, volume 7, pages 165-181, Val-Morin, Qu@bec, Janvier 1996. INRIA.
DLM+78
 
Dub96
Danny Dub@. Un syst~me de programmation Scheme pour micro-contrSleur. Master's thesis, D~partement d~Informatique et de Recherche Op@rationnelle, Universit~ de Montr@al, April 1996o
Fee93
 
FL98
Marc Feeley and Martin Larose. Compiling Erlang to Scheme. In Proceedings of the 1998 Programming Languages, Implementations, Logics and Programs Conference, September 1998.
FM90
 
FMRW97
M. Feeley, J. Miller, G. Rozas, and J. Wilson. Compiling Higher-Order Languages into Fully TaiI-Recursive Portable C~ Technical Report 1078, D@partement d'Informatique et de Recherche Ope!rationnelle, Universitd de Montr@al, Aofit 1997.
 
Gab85
HDB90
 
HFA+96
Pieter H. Hartel, Marc FeeIey, Martin Alt, Lennart Augustsson, Peter Baumann, Marcel Beemster, Emmanuel Chailloux, Christine H. Flood, Wolfgang Grieskamp, John H. G. van Groningen, Kevin Hammond, Bogumi~Hausman, Melody Y. Ivory, Richard Jones, Peter Lee, Xavier Leroy, Rafael Lins, Sandra Loosemore, Niklas RSjemo, Manuel Serrano, Jean-Pierre Talpin, Jon Thackray, Stephen Thomas, Pierre Weis, and Peter Wentworth. Benchmarking implementations of functional languages with "pseudoknot", a floatintensive benchmark. Journal of Functional Programming, 6(4), 1996.
NO93
Ste75

CITED BY  14

Collaborative Colleagues:
Martin Larose: colleagues
Marc Feeley: colleagues