Abstract
The authors have designed and implemented a modular Lisp interpreter for garbage collector evaluation. Data structures such as the list store, the hash table, the symbol table and the stacks were kept in separate modules with only the routines needed to handle them. Routines in other modules may only read and manipulate these data structures through the specified routines. Using this approach, when a garbage collector strategy or method of storing list cells is changed only the store module need be modified. Test programs and measurement strategies were designed for evaluating garbage collector performance in a virtual memory environment. Three garbage collectors have been coded and tested. They are a conventional link reversal marking garbage collector, a conventional recopying garbage collector, and a garbage collector integrated with the system swapper. The implementations are described and their performances are compared. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
