See this document in CiteSeerX!

Simple Generational Garbage Collection and Fast Allocation (1988)  (Make Corrections)  (123 citations)
Andrew W. Appel
Software Practice and Experience



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
berkeley.edu/~aike...alcollection.ps.Z
princeton.edu/faculty/appel/pa...143.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  berkeley.edu/~cs264/f95/p...index (more)
From:  princeton.edu/faculty/appel/pa...
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Generational garbage collection algorithms achieve efficiency because newer records point to older records; the only way an older record can point to a newer record is by a store operation to a previously-created record, and such operations are rare in many languages. A garbage collector that concentrates just on recently allocated records can take advantage of this fact. Such a garbage collector can be so efficient that the allocation of records costs more than their disposal. A scheme for... (Update)

Cited by:   More
Garbage Collection Hints - Dries Buytaert Kris   (Correct)
Connectivity-Based Garbage Collection - Martin Hirzel Hirzel   (Correct)
Barriers: Friend or Foe? - Stephen Blackburn Department   (Correct)

Active bibliography (related documents):   More   All
0.4:   A Runtime System (DRAFT) - Andrew Appel   (Correct)
0.2:   Context Switching and Scheduling in C- - Hsiao, Olateju (2000)   (Correct)
0.2:   A Retargetable Debugger - Ramsey, Hanson (1992)   (Correct)

Similar documents based on text:   More   All
0.2:   Generational garbage collection for Haskell - Sansom, Jones (1993)   (Correct)
0.2:   Generational Garbage Collection, Without Temporary Space Leaks.. - Röjemo (1995)   (Correct)
0.2:   From (multi-)generational to segment order preserving copying .. - Sagonas, Demoen (2000)   (Correct)

Related documents from co-citation:   More   All
43:   A real-time garbage collector based on the lifetimes of objects - Lieberman, Hewitt - 1983
40:   Generation scavenging: A non-disruptive high performance storage reclamation alg.. (context) - Ungar - 1984
36:   A nonrecursive list compacting algorithm (context) - Cheney - 1970

BibTeX entry:   (Update)

A. W. Appel. Simple generational garbage collection and fast allocation. Software--- Practice and Experience, 19(2):171--183, February 1989. http://citeseer.ist.psu.edu/appel88simple.html   More

@article{ appel89simple,
    author = "Andrew W. Appel",
    title = "Simple Generational Garbage Collection and Fast Allocation",
    journal = "Software Practice and Experience",
    volume = "19",
    number = "2",
    publisher = "Wiley",
    pages = "171--183",
    year = "1989",
    url = "citeseer.ist.psu.edu/appel88simple.html" }
Citations (may not include all citations):
173   A real-time garbage collector based on the lifetimes of obje.. - Lieberman, Hewitt - 1983  ACM   DBLP
139   Recursive functions of symbolic expressions and their comput.. - McCarthy - 1960  ACM
132   A nonrecursive list compacting algorithm (context) - Cheney - 1970  ACM   DBLP
101   Garbage collection in a large LISP system (context) - Moon - 1984  ACM   DBLP
94   Real-time concurrent collection on stock multiprocessors - Appel, Ellis et al. - 1988  ACM   DBLP
85   Garbage collection can be faster than stack allocation - Appel - 1987  ACM   DBLP
73   A LISP garbage-collector for virtual-memory computer systems (context) - Fenichel, Yochelson - 1969  ACM   DBLP
70   A Standard ML compiler - Appel, MacQueen - 1987  ACM   DBLP
23   Runtime Tags Aren't Necessary - Appel - 1988  DBLP
6   Heap Storage Management for the Programming Language Pascal (context) - Britton - 1975
4   A micro-kernel for concurrency in C (context) - Cormack  ACM   DBLP



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://parker.eecs.berkeley.edu/~cs264/f95/papers/index.html):   More
Garbage Collection Can Be Faster Than Stack Allocation - Appel (1987)   (Correct)
Continuation-Passing, Closure-Passing Style - Andrew Appel (1989)   (Correct)
Parallel Programming in Split-C - Culler (1993)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC