Re: Garbage Collection to IMPROVE speed

mark@premenos.sf.ca.us (Mark Grand) said:
[Are there references about using garbage collection to compact storage and
improve program performance?]


Here are a few references:


@InProceedings{WLM91,
    author = "Paul R. Wilson and Michael S. Lam and Thomas G. Moher",
    title = "Effective ``Static-graph'' Reorganization to Improve
Locality in Garbage-Collected Systems",
    crossref = "sigplan91",
    pages = "177--191"
}


@INPROCEEDINGS{WM89,
    crossref = "oopsla89",
AUTHOR = "Paul R. Wilson and Thomas G. Moher",
TITLE = "Design of the {Opportunistic Garbage Collector}",
PAGES = "23--35"
}


@TechReport{Shaw87,
    author = "Robert A. Shaw",
    title = "Improving Garbage Collector Performance in Virtual Memory",
    institution = "Stanford University",
    year = 1987,
    number = "CSL-TR-87-323",
    month = mar
}


@PHDTHESIS{Shaw88,
AUTHOR = "Robert A. Shaw",
TITLE = "Empirical Analysis of a {LISP} System",
SCHOOL = "Stanford University",
MONTH = feb,
YEAR = 1988,
NOTE = "Available as Technical Report CSL-TR-88-351"
}


@INPROCEEDINGS{Ungar84,
    crossref = "sigsoft84",
AUTHOR = "David Ungar",
TITLE = "Generation Scavenging: A Non-Disruptive High Performance
Storage Reclamation Algorithm",
PAGES = "157--167"
}


@INPROCEEDINGS{UJ88,
    crossref = "oopsla88",
AUTHOR = "David Ungar and Frank Jackson",
TITLE = "Tenuring Policies for Generation-Based Storage Reclamation",
PAGES = "1--17"
}


@Book{Ungar87,
    author = "David Michael Ungar",
    title = "The Design and Evaluation of a High Performance Smalltalk
     System",
    publisher = "The MIT Press",
    year = 1987,
    series = "ACM Distinguished Dissertations",
    address = "Cambridge, MA",
    note = "Ph.D. Dissertation, University of California at Berkeley,
    February 1986"
}
--
Tony Hosking
Papernet: Dept. of Computer Science
University of Massachusetts
Amherst, MA 01003
Voicenet: (413) 545-0256
Internet: hosking@cs.umass.edu
--

Return to the comp.compilers page.
Search the comp.compilers archives again.