A memory-efficient real-time non-copying garbage collector

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 34, Issue 3, 1999, Pages 118-129

  Lim, Tian F ^a   Pardyak, Przemystaw ^a   Bershad, Brian N ^a  

^a University of Washington   (United States)

Author keywords

Garbage collection; Operating systems; Real time; Treadmill

Indexed keywords

EID: 17244373533     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/301589.286873     Document Type: Article

References (23)

1. Java, http://java.sun.com/, 1996.
2. Inferno, http://inferno.lucent.com/, 1996.
3. PersonalJava, http://java.sun.com/, 1997.
4. B. Bershad, S. Savage, P. Pardyak, E. G. Sirer, M. Fiuczynski, D. Becker, S. Eggers, and C. Chambers. Extensibility, Safety and Performance in the SPIN Operating System, In Proceedings of the Fifteenth Symposium on Operating Systems Principles, 1995.
5. H. G. Baker. The Treadmill: Real-time Garbage Collection without Motion Sickness. SIGPLAN, ACM, 27(3), 1992.
6. G. Nelson, ed. Systems Programming in Modula-3. Prentice Hall, 1991.
7. E. W. Dijkstra, L. Lamport, A.J. Martin, C. S. Scholten, E. F. M. Steffens. On-The-Fly Garbage Collection: An Exercise in Cooperation. Communications of the ACM, 21 (11): 965-975, November 1978.
8. R. A. Saunders. The LISP system for the Q-32 computer. In E. C. Berkeley, D. G. Bobrow (ed.), The Programming Language LISP, 1964
9. P. R. Wilson and M. S. Johnstone. Truly Real-Time Non-Copying Garbage Collection. In E. Moss, P. R. Wilson, B. Zorn, editors, Proceedings of OOPSLA/ECOOP'93 Workshop on Garbage Collection in Object-Oriented Systems, October 1993.
10. D. S. Wise. The Double Buddy System. TR 79, CS Dept. Indiana University, December 1978.
11. S. K. Card, T. P. Moran, and A. Newell. The Psychology of Human-Computer Interaction, Lawrence Erlbaum Associates, Hillsdale, NJ, 1983.
12. J. Bartlett. Compacting Garbage Collection with Ambiguous Roots. Technical Report, DEC WRL 88/2, February 1988.
13. M. Satyanarayanan, H. Mashburn, P. Kumar, D. Steere and J. Kistler. Lightweight Recoverable Virtual Memory. ACM Transactions on Computer Systems, 12(1): 33-57, 1994.
14. G. Banga and P. Druschel. Measuring the Capacity of a Web Server. In Proceedings of the USENIX Symposium on Internet Technologies and Systems, December 1997.
15. J. H. Howard, M. L. Kazar, S. G. Menees, D. A. Nichols, M. Satyanarayanan, R. N. Sidebotham, and M. J. West. Scale and Performance in a Distributed File System. ACM Transactions on Computer Systems, 6(1), February 1988.
16. M. Rosemblum and J.K. Ousterhout. The Design and Implementation of a Log-Structured File System. In Proceedings of the Thirteenth Symposium on Operating Systems Principles, 1991.
17. H. G. Baker. List Processing in Real-Time on a Serial Computer. Communications of ACM, 21(4), pp. 28094, 1978.
18. M. S. Johnstone and P. R. Wilson. The Memory Fragmentation Problem: Solved?. In Proceedings of OOPSLA'97 Workshop on Garbage Collection in Object-Oriented Systems, October 1997.
19. C. Weinstock. Dynamic Storage Allocation Techniques. PhD thesis, Camegie-Mellon University, April 1976.
20. P. T. Withington. How Real is "Real Time'" Garbage Collection?. In Proceedings of OOPSLA'91 Workshop on Garbage Collection in Object-Oriented Systems, 1991.
21. B. Baker, E. G. Coffman, and D. E. Willard. Algorithms for Resolving Conflicts in Dynamic Storage Allocation. JACM, 32(2), pp. 327343, April 1985.
22. J. L. White. Address/Memory Management for a Gigantic Lisp Environment, or, GC Considered Harmful. In Conference Record of the 1980 Lisp Conference, Redwood Estates, CA, pp. 119-127, August 1980.
23. M. Spertus and G. Rodriguez-Rivera. A Non-Fragmenting, Non-Copying, Garbage Collector, submitted for publication, 1998.