skip to main content
A LISP Garbage Collector Algorithm Using Serial Secondary StorageOctober 1963
1963 Technical Report
Publisher:
  • Massachusetts Institute of Technology
  • 201 Vassar Street, W59-200 Cambridge, MA
  • United States
Published:01 October 1963
Bibliometrics
Abstract

No abstract available.

Cited By

  1. He Y, Yang C and Li X Improve google android user experience with regional garbage collection Proceedings of the 8th IFIP international conference on Network and parallel computing, (350-365)
  2. Bergstra J and Middelburg C (2019). Data Linkage Dynamics with Shedding, Fundamenta Informaticae, 103:1-4, (31-52), Online publication date: 1-Jan-2010.
  3. ACM
    Hawblitzel C and Petrank E Automated verification of practical garbage collectors Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (441-453)
  4. ACM
    Hawblitzel C and Petrank E (2009). Automated verification of practical garbage collectors, ACM SIGPLAN Notices, 44:1, (441-453), Online publication date: 21-Jan-2009.
  5. ACM
    Fu W and Hauser C A real-time garbage collection framework for embedded systems Proceedings of the 2005 workshop on Software and compilers for embedded systems, (20-26)
  6. Luk C and Mowry T Memory forwarding Proceedings of the 26th annual international symposium on Computer architecture, (88-99)
  7. ACM
    Huelsbergen L and Winterbottom P (2019). Very concurrent mark-&-sweep garbage collection without fine-grain synchronization, ACM SIGPLAN Notices, 34:3, (166-175), Online publication date: 1-Mar-1999.
  8. ACM
    Luk C and Mowry T (1999). Memory forwarding, ACM SIGARCH Computer Architecture News, 27:2, (88-99), Online publication date: 1-May-1999.
  9. ACM
    Huelsbergen L and Winterbottom P Very concurrent mark-&-sweep garbage collection without fine-grain synchronization Proceedings of the 1st international symposium on Memory management, (166-175)
  10. ACM
    Clinger W and Hansen L Generational garbage collection and the radioactive decay model Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation, (97-108)
  11. ACM
    Clinger W and Hansen L (2019). Generational garbage collection and the radioactive decay model, ACM SIGPLAN Notices, 32:5, (97-108), Online publication date: 1-May-1997.
  12. ACM
    Kolodner E, Liskov B and Weihl W (2019). Atomic garbage collection: managing a stable heap, ACM SIGMOD Record, 18:2, (15-25), Online publication date: 1-Jun-1989.
  13. ACM
    Kolodner E, Liskov B and Weihl W Atomic garbage collection: managing a stable heap Proceedings of the 1989 ACM SIGMOD international conference on Management of data, (15-25)
  14. ACM
    Lang B and Dupont F Incremental incrementally compacting garbage collection Papers of the Symposium on Interpreters and interpretive techniques, (253-263)
  15. ACM
    Lang B and Dupont F (1987). Incremental incrementally compacting garbage collection, ACM SIGPLAN Notices, 22:7, (253-263), Online publication date: 1-Jul-1987.
  16. ACM
    Brooks R Trading data space for reduced time and code space in real-time garbage collection on stock hardware Proceedings of the 1984 ACM Symposium on LISP and functional programming, (256-262)
  17. ACM
    Steele G and Sussman G (1980). Design of a LISP-based microprocessor, Communications of the ACM, 23:11, (628-645), Online publication date: 1-Nov-1980.
  18. ACM
    White J Address/memory management for a gigantic LISP environment or, GC considered harmful Proceedings of the 1980 ACM conference on LISP and functional programming, (119-127)
  19. ACM
    Stoyan H (1979). LISP history, ACM Lisp Bulletin:3, (42-53), Online publication date: 1-Dec-1979.
  20. ACM
    Baker H (1978). List processing in real time on a serial computer, Communications of the ACM, 21:4, (280-294), Online publication date: 1-Apr-1978.
  21. ACM
    Morris F (1978). A time- and space-efficient garbage compaction algorithm, Communications of the ACM, 21:8, (662-665), Online publication date: 1-Aug-1978.
  22. ACM
    Clark D and Green C (1977). An empirical study of list structure in Lisp, Communications of the ACM, 20:2, (78-87), Online publication date: 1-Feb-1977.
  23. ACM
    Clark D (1976). An efficient list-moving algorithm using constant workspace, Communications of the ACM, 19:6, (352-356), Online publication date: 1-Jun-1976.
  24. ACM
    Deutsch L and Bobrow D (1976). An efficient, incremental, automatic garbage collector, Communications of the ACM, 19:9, (522-526), Online publication date: 1-Sep-1976.
  25. ACM
    Steele G (1975). Multiprocessing compactifying garbage collection, Communications of the ACM, 18:9, (495-508), Online publication date: 1-Sep-1975.
  26. ACM
    Bobrow D and Wegbreit B (1973). A model and stack implementation of multiple environments, Communications of the ACM, 16:10, (591-603), Online publication date: 1-Oct-1973.
  27. ACM
    Hansen W (1969). Compact list representation, Communications of the ACM, 12:9, (499-507), Online publication date: 1-Sep-1969.
  28. ACM
    Bobrow D and Murphy D (1967). Structure of a LISP system using two-level storage, Communications of the ACM, 10:3, (155-159), Online publication date: 1-Mar-1967.
Contributors
  • Massachusetts Institute of Technology

Recommendations