A comparative performance evaluation of write barrier implementation
Authors:
- Antony L. HoskingAHAntony L. Hosking
- J. Eliot B. MossJMJ. Eliot B. Moss
- Darko StefanovicDSDarko Stefanovic
Open Access
- 31 October 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 27 (10) , 92-109
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Effective “static-graph” reorganization to improve locality in garbage-collected systemsACM SIGPLAN Notices, 1991
- Design of the opportunistic garbage collectorACM SIGPLAN Notices, 1989
- Simple generational garbage collection and fast allocationSoftware: Practice and Experience, 1989
- A Lifetime-Based Garbage Collector for LISP Systems on General-Purpose Computers.1988
- Tenuring policies for generation-based storage reclamationACM SIGPLAN Notices, 1988
- Managing stack frames in Smalltalk1987
- An empirical comparison of priority-queue and event-set implementationsCommunications of the ACM, 1986
- Self-adjusting binary search treesJournal of the ACM, 1985
- Self-adjusting binary trees1983
- A nonrecursive list compacting algorithmCommunications of the ACM, 1970