Nothing Special   »   [go: up one dir, main page]

skip to main content
A Lifetime-based Garbage Collector for LISP Systems on General- Purpose ComputersFebruary 1988
1988 Technical Report
Publisher:
  • Massachusetts Institute of Technology
  • 201 Vassar Street, W59-200 Cambridge, MA
  • United States
Published:01 February 1988
Reflects downloads up to 12 Nov 2024Bibliometrics
Skip Abstract Section
Abstract

Garbage collector performance in LISP systems on custom hardware has been substantially improved by the adoption of lifetime-based garbage collection techniques. To date, however, successful lifetime-based garbage collectors have required special-purpose hardware, or at least privileged access to data structures maintained by the virtual memory system. I present here a lifetime-based garbage collector requiring no special-purpose hardware or virtual memory system support, and discuss its performance.

Cited By

  1. ACM
    Gidra L, Thomas G, Sopena J, Shapiro M and Nguyen N (2015). NumaGiC, ACM SIGARCH Computer Architecture News, 43:1, (661-673), Online publication date: 29-May-2015.
  2. ACM
    Gidra L, Thomas G, Sopena J, Shapiro M and Nguyen N (2015). NumaGiC, ACM SIGPLAN Notices, 50:4, (661-673), Online publication date: 12-May-2015.
  3. ACM
    Gidra L, Thomas G, Sopena J, Shapiro M and Nguyen N NumaGiC Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems, (661-673)
  4. ACM
    Yang X, Blackburn S, Frampton D and Hosking A (2012). Barriers reconsidered, friendlier still!, ACM SIGPLAN Notices, 47:11, (37-48), Online publication date: 8-Jan-2013.
  5. ACM
    Morikawa K, Ugawa T and Iwasaki H Adaptive scanning reduces sweep time for the Lisp2 mark-compact garbage collector Proceedings of the 2013 international symposium on memory management, (15-26)
  6. ACM
    Morikawa K, Ugawa T and Iwasaki H (2013). Adaptive scanning reduces sweep time for the Lisp2 mark-compact garbage collector, ACM SIGPLAN Notices, 48:11, (15-26), Online publication date: 4-Dec-2013.
  7. ACM
    Morikawa K, Ugawa T and Iwasaki H Adaptive scanning reduces sweep time for the Lisp2 mark-compact garbage collector Proceedings of the 2013 international symposium on memory management, (15-26)
  8. ACM
    Yang X, Blackburn S, Frampton D and Hosking A Barriers reconsidered, friendlier still! Proceedings of the 2012 international symposium on Memory Management, (37-48)
  9. ACM
    Hellyer L, Jones R and Hosking A The locality of concurrent write barriers Proceedings of the 2010 international symposium on Memory management, (83-92)
  10. ACM
    Hellyer L, Jones R and Hosking A (2010). The locality of concurrent write barriers, ACM SIGPLAN Notices, 45:8, (83-92), Online publication date: 1-Aug-2010.
  11. ACM
    Wegiel M and Krintz C The mapping collector Proceedings of the 13th international conference on Architectural support for programming languages and operating systems, (91-102)
  12. ACM
    Wegiel M and Krintz C (2008). The mapping collector, ACM SIGARCH Computer Architecture News, 36:1, (91-102), Online publication date: 25-Mar-2008.
  13. ACM
    Wegiel M and Krintz C (2008). The mapping collector, ACM SIGOPS Operating Systems Review, 42:2, (91-102), Online publication date: 25-Mar-2008.
  14. ACM
    Wegiel M and Krintz C (2008). The mapping collector, ACM SIGPLAN Notices, 43:3, (91-102), Online publication date: 25-Mar-2008.
  15. ACM
    Barabash K, Ben-Yitzhak O, Goft I, Kolodner E, Leikehman V, Ossia Y, Owshanko A and Petrank E (2005). A parallel, incremental, mostly concurrent garbage collector for servers, ACM Transactions on Programming Languages and Systems (TOPLAS), 27:6, (1097-1146), Online publication date: 1-Nov-2005.
  16. ACM
    Blackburn S and Hosking A Barriers Proceedings of the 4th international symposium on Memory management, (143-151)
  17. ACM
    Blackburn S and McKinley K (2019). In or out?, ACM SIGPLAN Notices, 38:2 supplement, (175-184), Online publication date: 15-Feb-2003.
  18. ACM
    Barabash K, Ossia Y and Petrank E Mostly concurrent garbage collection revisited Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications, (255-268)
  19. ACM
    Barabash K, Ossia Y and Petrank E (2003). Mostly concurrent garbage collection revisited, ACM SIGPLAN Notices, 38:11, (255-268), Online publication date: 26-Nov-2003.
  20. ACM
    Blackburn S and McKinley K In or out? Proceedings of the 3rd international symposium on Memory management, (175-184)
  21. ACM
    Domani T, Kolodner E and Petrank E A generational on-the-fly garbage collector for Java Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation, (274-284)
  22. ACM
    Domani T, Kolodner E and Petrank E (2019). A generational on-the-fly garbage collector for Java, ACM SIGPLAN Notices, 35:5, (274-284), Online publication date: 1-May-2000.
  23. ACM
    Azagury A, Kolodner E, Petrank E and Yehudai Z (2019). Combining card marking with remembered sets, ACM SIGPLAN Notices, 34:3, (10-19), Online publication date: 1-Mar-1999.
  24. ACM
    Azagury A, Kolodner E, Petrank E and Yehudai Z Combining card marking with remembered sets Proceedings of the 1st international symposium on Memory management, (10-19)
  25. ACM
    Maheshwari U and Liskov B Partitioned garbage collection of a large object store Proceedings of the 1997 ACM SIGMOD international conference on Management of data, (313-323)
  26. ACM
    Maheshwari U and Liskov B (2019). Partitioned garbage collection of a large object store, ACM SIGMOD Record, 26:2, (313-323), Online publication date: 1-Jun-1997.
  27. ACM
    Hosking A, Moss J and Stefanovic D A comparative performance evaluation of write barrier implementation Conference proceedings on Object-oriented programming systems, languages, and applications, (92-109)
Contributors
  • Massachusetts Institute of Technology
Please enable JavaScript to view thecomments powered by Disqus.

Recommendations