mirror of
git://git.sv.gnu.org/emacs.git
synced 2026-02-20 11:57:36 +00:00
476 lines
No EOL
54 KiB
HTML
476 lines
No EOL
54 KiB
HTML
|
||
|
||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
|
||
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||
|
||
|
||
<html xmlns="http://www.w3.org/1999/xhtml">
|
||
<head>
|
||
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
|
||
|
||
<title>Bibliography — Memory Pool System 1.111.0 documentation</title>
|
||
|
||
<link rel="stylesheet" href="../_static/mps.css" type="text/css" />
|
||
<link rel="stylesheet" href="../_static/pygments.css" type="text/css" />
|
||
|
||
<script type="text/javascript">
|
||
var DOCUMENTATION_OPTIONS = {
|
||
URL_ROOT: '../',
|
||
VERSION: '1.111.0',
|
||
COLLAPSE_INDEX: false,
|
||
FILE_SUFFIX: '.html',
|
||
HAS_SOURCE: true
|
||
};
|
||
</script>
|
||
<script type="text/javascript" src="../_static/jquery.js"></script>
|
||
<script type="text/javascript" src="../_static/underscore.js"></script>
|
||
<script type="text/javascript" src="../_static/doctools.js"></script>
|
||
<link rel="copyright" title="Copyright" href="../copyright.html" />
|
||
<link rel="top" title="Memory Pool System 1.111.0 documentation" href="../index.html" />
|
||
<link rel="next" title="Acknowledgements" href="credit.html" />
|
||
<link rel="prev" title="5. Frequently Asked Questions" href="faq.html" />
|
||
</head>
|
||
<body>
|
||
<div class="related">
|
||
<h3>Navigation</h3>
|
||
<ul>
|
||
<li class="right" style="margin-right: 10px">
|
||
<a href="../genindex.html" title="General Index"
|
||
accesskey="I">index</a></li>
|
||
<li class="right" >
|
||
<a href="credit.html" title="Acknowledgements"
|
||
accesskey="N">next</a> |</li>
|
||
<li class="right" >
|
||
<a href="faq.html" title="5. Frequently Asked Questions"
|
||
accesskey="P">previous</a> |</li>
|
||
<li><a href="../index.html">Memory Pool System 1.111.0 documentation</a> »</li>
|
||
</ul>
|
||
</div>
|
||
|
||
<div class="document">
|
||
<div class="documentwrapper">
|
||
<div class="bodywrapper">
|
||
<div class="body">
|
||
|
||
<div class="section" id="bibliography">
|
||
<span id="id1"></span><h1>Bibliography<a class="headerlink" href="#bibliography" title="Permalink to this headline">¶</a></h1>
|
||
<ul class="simple">
|
||
<li><p id="ad97">Ole Agesen, David L. Detlefs. 1997. “<a class="reference external" href="http://www-plan.cs.colorado.edu/diwan/class-papers/finding-references-in-java.pdf">Finding References in Java Stacks</a>”. Sun Labs. OOPSLA97 Workshop on Garbage Collection and Memory Management.</p>
|
||
</li>
|
||
<li><p id="adm98">Ole Agesen, David L. Detlefs, J. Eliot B. Moss. 1998. “<a class="reference external" href="http://pdf.aminer.org/000/542/332/garbage_collection_and_local_variable_type_precision_and_liveness_in.pdf">Garbage Collection and Local Variable Type-precision and Liveness in Java Virtual Machines</a>”. ACM. Proceedings of the ACM SIGPLAN ‘98 conference on Programming language design and implementation, pp. 269–279.</p>
|
||
</li>
|
||
<li><p id="ael88">Andrew Appel, John R. Ellis, Kai Li. 1988. “<a class="reference external" href="http://apotheca.hpl.hp.com/ftp/pub/compaq/SRC/research-reports/SRC-025.pdf">Real-time Concurrent Collection on Stock Multiprocessors</a>”. ACM, SIGPLAN. ACM PLDI 88, SIGPLAN Notices 23, 7 (July 88), pp. 11–20.</p>
|
||
</li>
|
||
<li><p id="apple94">Apple Computer, Inc. 1994. <em>Inside Macintosh: Memory</em>. Addison-Wesley. ISBN 0-201-63240-3.</p>
|
||
</li>
|
||
<li><p id="attardi94">Giuseppe Attardi & Tito Flagella. 1994. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.50.257&rep=rep1&type=pdf">A Customisable Memory Management Framework</a>”. TR-94-010.</p>
|
||
</li>
|
||
<li><p id="afi98">Giuseppe Attardi, Tito Flagella, Pietro Iglio. 1998. “<a class="reference external" href="ftp://ftp.di.unipi.it/pub/Papers/attardi/SPE.ps.gz">A customisable memory management framework for C++</a>”. Software – Practice and Experience. 28(11), 1143–1183.</p>
|
||
</li>
|
||
<li><p id="akpy98">Alain Azagury, Elliot K. Kolodner, Erez Petrank, Zvi Yehudai. 1998. “<a class="reference external" href="http://pdf.aminer.org/000/465/100/combining_card_marking_with_remembered_sets_how_to_save_scanning.pdf">Combining Card Marking with Remembered Sets: How to Save Scanning Time</a>”. ACM. ISMM‘98 pp. 10–19.</p>
|
||
</li>
|
||
<li><p id="baker77">Henry G. Baker, Carl Hewitt. 1977. “<a class="reference external" href="http://home.pipeline.com/~hbaker1/Futures.html">The Incremental Garbage Collection of Processes</a>”. ACM. SIGPLAN Notices 12, 8 (August 1977), pp. 55–59.</p>
|
||
</li>
|
||
<li><p id="baker78">Henry G. Baker. 1978. “<a class="reference external" href="http://home.pipeline.com/~hbaker1/RealTimeGC.html">List Processing in Real Time on a Serial Computer</a>”. ACM. Communications of the ACM 21, 4 (April 1978), pp. 280–294.</p>
|
||
</li>
|
||
<li><p id="baker79">Henry G. Baker. 1979. “<a class="reference external" href="http://home.pipeline.com/~hbaker1/OptAlloc.html">Optimizing Allocation and Garbage Collection of Spaces</a>”. In Winston and Brown, eds. <em>Artificial Intelligence: An MIT Perspective.</em> MIT Press.</p>
|
||
</li>
|
||
<li><p id="baker91">Henry G. Baker. 1991. “<a class="reference external" href="http://home.pipeline.com/~hbaker1/CacheCGC.html">Cache-Conscious Copying Collectors</a>”. OOPSLA‘91/GC‘91 Workshop on Garbage Collection.</p>
|
||
</li>
|
||
<li><p id="baker92a">Henry G. Baker. 1992. “<a class="reference external" href="http://home.pipeline.com/~hbaker1/LinearLisp.html">Lively Linear Lisp – ‘Look Ma, No Garbage!’</a>”. ACM. SIGPLAN Notices 27, 8 (August 1992), pp. 89–98.</p>
|
||
</li>
|
||
<li><p id="baker92c">Henry G. Baker. 1992. “<a class="reference external" href="http://home.pipeline.com/~hbaker1/NoMotionGC.html">The Treadmill: Real-Time Garbage Collection Without Motion Sickness</a>”. ACM. SIGPLAN Notices 27, 3 (March 1992), pp. 66–70.</p>
|
||
</li>
|
||
<li><p id="baker92">Henry G. Baker. 1992. “<a class="reference external" href="http://home.pipeline.com/~hbaker1/LazyAlloc.html">CONS Should not CONS its Arguments, or, a Lazy Alloc is a Smart Alloc</a>”. ACM. SIGPLAN Notices 27, 3 (March 1992), 24–34.</p>
|
||
</li>
|
||
<li><p id="baker92b">Henry G. Baker. 1992. “<a class="reference external" href="http://home.pipeline.com/~hbaker1/ReverseGC.html">NREVERSAL of Fortune – The Thermodynamics of Garbage Collection</a>”. Springer-Verlag. LNCS Vol. 637.</p>
|
||
</li>
|
||
<li><p id="baker93">Henry G. Baker. 1993. “<a class="reference external" href="http://home.pipeline.com/~hbaker1/YoungGen.html">‘Infant Mortality’ and Generational Garbage Collection</a>”. ACM. SIGPLAN Notices 28, 4 (April 1993), pp. 55–57.</p>
|
||
</li>
|
||
<li><p id="baker93a">Henry G. Baker. 1993. “<a class="reference external" href="http://home.pipeline.com/~hbaker1/ObjectIdentity.html">Equal Rights for Functional Objects or, The More Things Change, The More They Are the Same</a>”. ACM. OOPS Messenger 4, 4 (October 1993), pp. 2–27.</p>
|
||
</li>
|
||
<li><p id="baker94">Henry G. Baker. 1994. “<a class="reference external" href="http://home.pipeline.com/~hbaker1/LRefCounts.html">Minimizing Reference Count Updating with Deferred and Anchored Pointers for Functional Data Structures</a>”. ACM. SIGPLAN Notices 29, 9 (September 1994), pp. 38–43.</p>
|
||
</li>
|
||
<li><p id="baker94a">Henry G. Baker. 1994. “<a class="reference external" href="http://home.pipeline.com/~hbaker1/ThermoGC.html">Thermodynamics and Garbage Collection</a>”. ACM. SIGPLAN Notices 29, 4 (April 1994), pp. 58–63.</p>
|
||
</li>
|
||
<li><p id="baker95a">Henry G. Baker. 1995. “<a class="reference external" href="http://home.pipeline.com/~hbaker1/Use1Var.html">‘Use-Once’ Variables and Linear Objects – Storage Management, Reflection and Multi-Threading</a>”. ACM. SIGPLAN Notices 30, 1 (January 1995), pp. 45–52.</p>
|
||
</li>
|
||
<li><p id="baker95">Henry G. Baker. 1995. <em>Memory Management: International Workshop IWMM‘95</em>. Springer-Verlag. ISBN 3-540-60368-9.</p>
|
||
</li>
|
||
<li><p id="bbw97">Nick Barnes, Richard Brooksby, David Jones, Gavin Matthews, Pekka P. Pirinen, Nick Dalton, P. Tucker Withington. 1997. “<a class="reference external" href="ftp://ftp.dcs.gla.ac.uk/pub/drastic/gc/harlequin.ps">A Proposal for a Standard Memory Management Interface</a>”. OOPSLA97 Workshop on Garbage Collection and Memory Management.</p>
|
||
</li>
|
||
<li><p id="zorn93b">David A. Barrett, Benjamin Zorn. 1993. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.56.6712&rep=rep1&type=pdf">Using Lifetime Predictors to Improve Memory Allocation Performance</a>”. ACM. SIGPLAN‘93 Conference on Programming Language Design and Implementation, pp. 187–196.</p>
|
||
</li>
|
||
<li><p id="barrett93">David A. Barrett, Benjamin Zorn. 1995. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.45.1835&rep=rep1&type=pdf">Garbage Collection using a Dynamic Threatening Boundary</a>”. ACM. SIGPLAN‘95 Conference on Programming Language Design and Implementation, pp. 301–314.</p>
|
||
</li>
|
||
<li><p id="bartlett88">Joel F. Bartlett. 1988. “<a class="reference external" href="http://computer-refuge.org/classiccmp/ftp.digital.com-jun2004/pub/Compaq/WRL/research-reports/WRL-TR-88.2.pdf">Compacting Garbage Collection with Ambiguous Roots</a>”. Digital Equipment Corporation.</p>
|
||
</li>
|
||
<li><p id="bartlett89">Joel F. Bartlett. 1989. “<a class="reference external" href="http://www.hpl.hp.com/techreports/Compaq-DEC/WRL-TN-12.pdf">Mostly-Copying Garbage Collection Picks Up Generations and C++</a>”. Digital Equipment Corporation.</p>
|
||
</li>
|
||
<li><p id="bc92">Yves Bekkers & Jacques Cohen. 1992. “<a class="reference external" href="http://www.informatik.uni-trier.de/%7Eley/db/conf/iwmm/iwmm92.html">Memory Management, International Workshop IWMM 92</a>”. Springer-Verlag. LNCS Vol. 637, ISBN 3-540-55940-X.</p>
|
||
</li>
|
||
<li><p id="bb99">Emery D. Berger, Robert D. Blumofe. 1999. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.81.5049&rep=rep1&type=pdf">Hoard: A Fast, Scalable, and Memory-Efficient Allocator for Shared-Memory Multiprocessors</a>”. University of Texas at Austin. UTCS TR99-22.</p>
|
||
</li>
|
||
<li><p id="berger01">Emery D. Berger, Benjamin G. Zorn, Kathryn S. McKinley. 2001. “<a class="reference external" href="http://www.cs.utexas.edu/users/speedway/DaCapo/papers/pldi2001.pdf">Composing high-performance memory allocators</a>” ACM SIGPLAN Conference on Programming Language Design and Implementation 2001, pp. 114–124.</p>
|
||
</li>
|
||
<li><p id="bw88">Hans-J. Boehm, Mark Weiser. 1988. “<a class="reference external" href="http://www.hpl.hp.com/personal/Hans_Boehm/spe_gc_paper/preprint.pdf">Garbage collection in an uncooperative environment</a>”. Software – Practice and Experience. 18(9):807–820.</p>
|
||
</li>
|
||
<li><p id="bds91">Hans-J. Boehm, Alan J. Demers, Scott Shenker. 1991. “<a class="reference external" href="http://www.hpl.hp.com/personal/Hans_Boehm/gc/papers/pldi91.ps.Z">Mostly Parallel Garbage Collection</a>”. Xerox PARC. ACM PLDI 91, SIGPLAN Notices 26, 6 (June 1991), pp. 157–164.</p>
|
||
</li>
|
||
<li><p id="bc92a">Hans-J. Boehm, David Chase. 1992. “A Proposal for Garbage-Collector-Safe C Compilation”. <em>Journal of C Language Translation.</em> vol. 4, 2 (December 1992), pp. 126–141.</p>
|
||
</li>
|
||
<li><p id="boehm93">Hans-J. Boehm. 1993. “<a class="reference external" href="http://www.hpl.hp.com/personal/Hans_Boehm/gc/papers/pldi93.ps.Z">Space Efficient Conservative Garbage Collection</a>”. ACM, SIGPLAN. Proceedings of the ACM SIGPLAN ‘91 Conference on Programming Language Design and Implementation, SIGPLAN Notices 28, 6, pp 197–206.</p>
|
||
</li>
|
||
<li><p id="boehm00">Hans-J. Boehm. 2000. “<a class="reference external" href="http://www.hpl.hp.com/techreports/2000/HPL-2000-99.html">Reducing Garbage Collector Cache Misses</a>”. ACM. ISMM‘00 pp. 59–64.</p>
|
||
</li>
|
||
<li><p id="boehm02">Hans-J. Boehm. 2002. “<a class="reference external" href="http://www.hpl.hp.com/techreports/2002/HPL-2002-335.html">Destructors, Finalizers, and Synchronization</a>”. HP Labs technical report HPL-2002-335.</p>
|
||
</li>
|
||
<li><p id="bm77">Robert S. Boyer and J. Strother Moore. 1977. “<a class="reference external" href="http://www.cs.utexas.edu/~moore/publications/fstrpos.pdf">A Fast String Searching Algorithm</a>”. <em>Communications of the ACM</em> 20(10):762–772.</p>
|
||
</li>
|
||
<li><p id="bl72">P. Branquart, J. Lewi. 1972. “A scheme of storage allocation and garbage collection for ALGOL 68”. Elsevier/North-Holland. ALGOL 68 Implementation – Proceedings of the IFIP Working Conference on ALGOL 68 Implementation, July 1970.</p>
|
||
</li>
|
||
<li><p id="brooksby02">Richard Brooksby. 2002. “<a class="reference external" href="http://www.ravenbrook.com/project/mps/doc/2002-01-30/ismm2002-paper/">The Memory Pool System: Thirty person-years of memory management development goes Open Source</a>”. ISMM‘02.</p>
|
||
</li>
|
||
<li><p id="cgz94">Brad Calder, Dirk Grunwald, Benjamin Zorn. 1994. “<a class="reference external" href="http://cseclassic.ucsd.edu/users/calder/papers/JplVersion.pdf">Quantifying Behavioral Differences Between C and C++ Programs</a>”. <em>Journal of Programming Languages.</em> 2(4):313–351.</p>
|
||
</li>
|
||
<li><p id="cpc00">Dante J. Cannarozzi, Michael P. Plezbert, Ron K. Cytron. 2000. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.58.9649&rep=rep1&type=pdf">Contaminated garbage collection</a>”. ACM. Proceedings of the ACM SIGPLAN ‘00 conference on on Programming language design and implementation, pp. 264–273.</p>
|
||
</li>
|
||
<li><p id="cw86">Patrick J. Caudill, Allen Wirfs-Brock. 1986. “A Third-Generation Smalltalk-80 Implementation”. ACM. SIGPLAN Notices. 21(11), OOPSLA‘86 ACM Conference on Object-Oriented Systems, Languages and Applications.</p>
|
||
</li>
|
||
<li><p id="cheney70">C. J. Cheney. 1970. “A non-recursive list compacting algorithm”. CACM. 13-11 pp. 677–678.</p>
|
||
</li>
|
||
<li><p id="chl98">Perry Cheng, Robert Harper, Peter Lee. 1998. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.43.9229&rep=rep1&type=pdf">Generational stack collection and profile-driven pretenuring</a>”. ACM. Proceedings of SIGPLAN‘98 Conference on Programming Language Design and Implementation, pp. 162–173.</p>
|
||
</li>
|
||
<li><p id="cl98">Trishul M. Chilimbi, James R. Larus. 1998. “<a class="reference external" href="http://ftp2.cs.wisc.edu/wwt/ismm98_cache_gc.pdf">Using Generational Garbage Collection To Implement Cache-Conscious Data Placement</a>”. ACM. ISMM‘98 pp. 37–48.</p>
|
||
</li>
|
||
<li><p id="ch97">William D Clinger & Lars T Hansen. 1997. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.164.370&rep=rep1&type=pdf">Generational Garbage Collection and the Radioactive Decay Model</a>”. ACM. Proceedings of PLDI 1997.</p>
|
||
</li>
|
||
<li><p id="cohen81">Jacques Cohen. 1981. “Garbage collection of linked data structures”. Computing Surveys. Vol. 13, no. 3.</p>
|
||
</li>
|
||
<li><p id="ccz98">Dominique Colnet, Philippe Coucaud, Olivier Zendra. 1998. “<a class="reference external" href="http://pdf.aminer.org/000/465/134/compiler_support_to_customize_the_mark_and_sweep_algorithm.pdf">Compiler Support to Customize the Mark and Sweep Algorithm</a>”. ACM. ISMM‘98 pp. 154–165.</p>
|
||
</li>
|
||
<li><p id="cwz93">Jonathan E. Cook, Alexander L. Wolf, Benjamin Zorn. 1994. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.53.3656&rep=rep1&type=pdf">Partition Selection Policies in Object Database Garbage Collection</a>”. ACM. SIGMOD. International Conference on the Management of Data (SIGMOD‘94), pp. 371–382.</p>
|
||
</li>
|
||
<li><p id="ckwz96">Jonathan E. Cook, Artur Klauser, Alexander L. Wolf, Benjamin Zorn. 1996. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.46.8140&rep=rep1&type=pdf">Semi-automatic, Self-adaptive Control of Garbage Collection Rates in Object Databases</a>”. ACM, SIGMOD. International Conference on the Management of Data (SIGMOD‘96), pp. 377–388.</p>
|
||
</li>
|
||
<li><p id="cns92">Eric Cooper, Scott Nettles, Indira Subramanian. 1992. “Improving the Performance of SML Garbage Collection using Application-Specific Virtual Memory Management”. ACM Conference on LISP and Functional Programming, pp. 43–52.</p>
|
||
</li>
|
||
<li><p id="daconta93">Michael C. Daconta. 1993. <em>C Pointers and Dynamic Memory Management.</em> Wiley. ISBN 0-471-56152-5.</p>
|
||
</li>
|
||
<li><p id="daconta95">Michael C. Daconta. 1995. <em>C++ Pointers and Dynamic Memory Management.</em> Wiley. ISBN 0-471-04998-0.</p>
|
||
</li>
|
||
<li><p id="dahl63">O.-J. Dahl. 1963. “The SIMULA Storage Allocation Scheme”. Norsk Regnesentral. NCC Document no. 162.</p>
|
||
</li>
|
||
<li><p id="denning68">P. J. Denning. 1968. “Thrashing: Its Causes and Prevention”. Proceedings AFIPS,1968 Fall Joint Computer Conference, vol. 33, pp. 915–922.</p>
|
||
</li>
|
||
<li><p id="denning70">P. J. Denning. 1970. “<a class="reference external" href="http://denninginstitute.com/pjd/PUBS/VirtMem_1970.pdf">Virtual Memory</a>”. ACM. ACM Computing Surveys, vol. 2, no. 3, pp. 153–190, Sept. 1970.</p>
|
||
</li>
|
||
<li><p id="ds72">P. J. Denning, S. C. Schwartz. 1972. “<a class="reference external" href="http://denninginstitute.com/pjd/PUBS/WSProp_1972.pdf">Properties of the Working-set Model</a>”. CACM. vol. 15, no. 3, pp. 191–198.</p>
|
||
</li>
|
||
<li><p id="detlefs92">David L. Detlefs. 1992. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.71.2755&rep=rep1&type=pdf">Garbage collection and runtime typing as a C++ library</a>”. USENIX C++ Conference.</p>
|
||
</li>
|
||
<li><p id="zorn93">David L. Detlefs, Al Dosser, Benjamin Zorn. 1994. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.30.3073&rep=rep1&type=pdf">Memory Allocation Costs in Large C and C++ Programs</a>”. Software – Practice and Experience. 24(6):527–542.</p>
|
||
</li>
|
||
<li><p id="db76">L. Peter Deutsch, Daniel G. Bobrow. 1976. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.63.4603&rep=rep1&type=pdf">An Efficient, Incremental, Automatic Garbage Collector</a>”. CACM. vol. 19, no. 9, pp. 522–526.</p>
|
||
</li>
|
||
<li><p id="dlmss76">E. W. Dijkstra, Leslie Lamport, A. J. Martin, C. S. Scholten, E. F. M. Steffens. 1976. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.63.4752&rep=rep1&type=pdf">On-the-fly Garbage Collection: An Exercise in Cooperation</a>”. Springer-Verlag. Lecture Notes in Computer Science, Vol. 46.</p>
|
||
</li>
|
||
<li><p id="dmh92">Amer Diwan, Richard L. Hudson, J. Eliot B. Moss. 1992. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.87.71&rep=rep1&type=pdf">Compiler Support for Garbage Collection in a Statically Typed Language</a>”. ACM. Proceedings of the 5th ACM SIGPLAN conference on Programming language design and implementation, pp. 273–282.</p>
|
||
</li>
|
||
<li><p id="dtm93">Amer Diwan, David Tarditi, J. Eliot B. Moss. 1993. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.27.9220&rep=rep1&type=pdf">Memory Subsystem Performance of Programs with Intensive Heap Allocation</a>”. Carnegie Mellon University. CMU-CS-93-227.</p>
|
||
</li>
|
||
<li><p id="dtm93a">Amer Diwan, David Tarditi, J. Eliot B. Moss. 1994. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.27.9220&rep=rep1&type=pdf">Memory Subsystem Performance of Programs Using Copying Garbage Collection</a>”. ACM. CMU-CS-93-210, also in POPL ‘94.</p>
|
||
</li>
|
||
<li><p id="doligez93">Damien Doligez & Xavier Leroy. 1993. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.52.9494&rep=rep1&type=pdf">A concurrent, generational garbage collector for a multithreaded implementation of ML</a>”. ACM. POPL ‘93, 113–123.</p>
|
||
</li>
|
||
<li><p id="doligez94">Damien Doligez & Georges Gonthier. 1994. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.52.4710&rep=rep1&type=pdf">Portable, unobtrusive garbage collection for multiprocessor systems</a>”. ACM. POPL ‘94, 70–83.</p>
|
||
</li>
|
||
<li><p id="dbe93">R. Kent Dybvig, Carl Bruggeman, David Eby. 1993. “<a class="reference external" href="http://www.cs.indiana.edu/~dyb/pubs/guardians-pldi93.pdf">Guardians in a Generation-Based Garbage Collector</a>”. SIGPLAN. Proceedings of the ACM SIGPLAN ‘93 Conference on Programming Language Design and Implementation, June 1993.</p>
|
||
</li>
|
||
<li><p id="edelson92a">Daniel R. Edelson. 1992. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.54.530&rep=rep1&type=pdf">Smart pointers: They’re smart, but they’re not pointers</a>”. USENIX C++ Conference.</p>
|
||
</li>
|
||
<li><p id="edelson92">Daniel R. Edelson. 1992. “Comparing Two Garbage Collectors for C++”. University of California at Santa Cruz. Technical Report UCSC-CRL-93-20.</p>
|
||
</li>
|
||
<li><p id="edwards">Daniel J. Edwards. n.d. “<a class="reference external" href="ftp://publications.ai.mit.edu/ai-publications/0-499/AIM-019.ps">Lisp II Garbage Collector</a>”. MIT. AI Memo 19 (AIM-19).</p>
|
||
</li>
|
||
<li><p id="ellis93">John R. Ellis, David L. Detlefs. 1993. “<a class="reference external" href="http://www.hpl.hp.com/techreports/Compaq-DEC/SRC-RR-102.pdf">Safe, Efficient Garbage Collection for C++</a>”. Xerox PARC.</p>
|
||
</li>
|
||
<li><p id="ferreira96">Paulo Ferreira. 1996. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.31.8434&rep=rep1&type=pdf">Larchant: garbage collection in a cached distributed shared store with persistence by reachability</a>”. Université Paris VI. Thése de doctorat.</p>
|
||
</li>
|
||
<li><p id="fs98">Paulo Ferreira & Marc Shapiro. 1998. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.45.6176&rep=rep1&type=pdf">Modelling a Distributed Cached Store for Garbage Collection</a>”. Springer-Verlag. Proceedings of 12th European Conference on Object-Oriented Programming, ECOOP98, LNCS 1445.</p>
|
||
</li>
|
||
<li><p id="fw76">Daniel P Friedman, David S. Wise. 1976. “<a class="reference external" href="http://www.cs.indiana.edu/pub/techreports/TR34.pdf">Garbage collecting a heap which includes a scatter table</a>”. <em>Information Processing Letters.</em> 5, 6 (December 1976): 161–164.</p>
|
||
</li>
|
||
<li><p id="fw77">Daniel P Friedman, David S. Wise. 1977. “<a class="reference external" href="http://www.cs.indiana.edu/pub/techreports/TR57.pdf">The One Bit Reference Count</a>”. <em>BIT.</em> (17)3: 351–359.</p>
|
||
</li>
|
||
<li><p id="fw79">Daniel P Friedman, David S. Wise. 1979. “<a class="reference external" href="http://www.cs.indiana.edu/pub/techreports/TR73.pdf">Reference counting can manage the circular environments of mutual recursion</a>”. <em>Information Processing Letters.</em> 8, 1 (January 1979): 41–45.</p>
|
||
</li>
|
||
<li><p id="gzh93">Dirk Grunwald, Benjamin Zorn, R. Henderson. 1993. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.43.6621&rep=rep1&type=pdf">Improving the Cache Locality of Memory Allocation</a>”. SIGPLAN. SIGPLAN ‘93, Conference on PLDI, June 1993, Albuquerque, New Mexico.</p>
|
||
</li>
|
||
<li><p id="grun92">Dirk Grunwald & Benjamin Zorn. 1993. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.35.5260&rep=rep1&type=pdf">CustoMalloc: Efficient Synthesized Memory Allocators</a>”. Software – Practice and Experience. 23(8):851–869.</p>
|
||
</li>
|
||
<li><p id="gudeman93">David Gudeman. 1993. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.39.4394&rep=rep1&type=pdf">Representing Type Information in Dynamically Typed Languages</a>”. University of Arizona at Tucson. Technical Report TR 93-27.</p>
|
||
</li>
|
||
<li><p id="harris99">Timothy Harris. 1999. “<a class="reference external" href="http://www.timharris.co.uk/papers/1999-sigplan.pdf">Early storage reclamation in a tracing garbage collector</a>”. ACM. ACM SIG-PLAN Notices 34:4, pp. 46–53.</p>
|
||
</li>
|
||
<li><p id="henrik94">Roger Henriksson. 1994. “Scheduling Real Time Garbage Collection”. Department of Computer Science at Lund University. LU-CS-TR:94-129.</p>
|
||
</li>
|
||
<li><p id="henrik96">Roger Henriksson. 1996. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.51.1554&rep=rep1&type=pdf">Adaptive Scheduling of Incremental Copying Garbage Collection for Interactive Applications</a>”. NWPER96.</p>
|
||
</li>
|
||
<li><p id="henriksson98">Roger Henriksson. 1998. “<a class="reference external" href="http://lup.lub.lu.se/luur/download?func=downloadFile&recordOId=18921&fileOId=630830">Scheduling Garbage Collection in Embedded Systems</a>”. Department of Computer Science at Lund University. Ph.D. thesis.</p>
|
||
</li>
|
||
<li><p id="hosking91">Antony L. Hosking. 1991. “<a class="reference external" href="ftp://ftp.cs.purdue.edu/pub/hosking/papers/oopsla91gc-alh.pdf">Main memory management for persistence</a>”. ACM. Proceedings of the ACM OOPSLA‘91 Workshop on Garbage Collection.</p>
|
||
</li>
|
||
<li><p id="hms92">Antony L. Hosking, J. Eliot B. Moss, Darko Stefanovic. 1992. “<a class="reference external" href="ftp://ftp.cs.purdue.edu/pub/hosking/papers/oopsla92.pdf">A comparative performance evaluation of write barrier implementations</a>”. ACM. OOPSLA‘92 Conference Proceedings, ACM SIGPLAN Notices 27(10), pp 92–109.</p>
|
||
</li>
|
||
<li><p id="hh93">Antony L. Hosking, Richard L. Hudson. 1993. “<a class="reference external" href="ftp://ftp.cs.purdue.edu/pub/hosking/papers/gc-workshop93c.pdf">Remembered sets can also play cards</a>”. ACM. Proceedings of the ACM OOPSLA‘93 Workshop on Memory Management and Garbage Collection.</p>
|
||
</li>
|
||
<li><p id="hm93">Antony L. Hosking, J. Eliot B. Moss. 1993. “<a class="reference external" href="ftp://ftp.cs.purdue.edu/pub/hosking/papers/sosp93.pdf">Protection traps and alternatives for memory management of an object-oriented language</a>”. ACM. Proceedings of the Fourteenth ACM Symposium on Operating Systems Principles, ACM Operating Systems Review 27(5), pp 106–119.</p>
|
||
</li>
|
||
<li><p id="hmdw91">Richard L. Hudson, J. Eliot B. Moss, Amer Diwan, Christopher F. Weight. 1991. “<a class="reference external" href="http://scholarworks.umass.edu/cgi/viewcontent.cgi?article=1210&context=cs_faculty_pubs">A Language-Independent Garbage Collector Toolkit</a>”. University of Massachusetts at Amherst. COINS Technical Report 91–47.</p>
|
||
</li>
|
||
<li><p id="hm92">Richard L. Hudson, J. Eliot B. Moss. 1992. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.53.3883&rep=rep1&type=pdf">Incremental Collection of Mature Objects</a>”. Springer-Verlag. LNCS #637 International Workshop on Memory Management, St. Malo, France, Sept. 1992, pp. 388–403.</p>
|
||
</li>
|
||
<li><p id="hmmm97">Richard L. Hudson, Ron Morrison, J. Eliot B. Moss, David S. Munro. 1997. “<a class="reference external" href="http://www.cs.umass.edu/~moss/papers/oopsla-1997-gc-world.pdf">Garbage Collecting the World: One Car at a Time</a>”. ACM. Proc. OOPSLA 97, pp. 162–175.</p>
|
||
</li>
|
||
<li><p id="iso90">“International Standard ISO/IEC 9899:1990 Programming languages — C”.</p>
|
||
</li>
|
||
<li><p id="johnstone97">Mark S. Johnstone. 1997. “<a class="reference external" href="ftp://ftp.cs.utexas.edu/pub/garbage/johnstone-dissertation.ps.gz">Non-Compacting Memory Allocation and Real-Time Garbage Collection</a>”. University of Texas at Austin.</p>
|
||
</li>
|
||
<li><p id="jw98">Mark S. Johnstone, Paul R. Wilson. 1998. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.45.3382&rep=rep1&type=pdf">The Memory Fragmentation Problem: Solved?</a>”. ACM. ISMM‘98 pp. 26–36.</p>
|
||
</li>
|
||
<li><p id="jones92">Richard E. Jones. 1992. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.45.5083&rep=rep1&type=pdf">Tail recursion without space leaks</a>”. <em>Journal of Functional Programming.</em> 2(1):73–79.</p>
|
||
</li>
|
||
<li><p id="jl92">Richard E. Jones, Rafael Lins. 1992. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.43.8499&rep=rep1&type=pdf">Cyclic weighted reference counting without delay</a>”. Computing Laboratory, The University of Kent at Canterbury. Technical Report 28-92.</p>
|
||
</li>
|
||
<li><p id="jones96">Richard E. Jones, Rafael Lins. 1996. “<a class="reference external" href="http://www.cs.ukc.ac.uk/people/staff/rej/gcbook/gcbook.html">Garbage Collection: Algorithms for Automatic Dynamic Memory Management</a>”. Wiley. ISBN 0-471-94148-4.</p>
|
||
</li>
|
||
<li><p id="acm98">Richard E. Jones. 1998. “<a class="reference external" href="http://www.acm.org/pubs/contents/proceedings/plan/286860/">ISMM‘98 International Symposium on Memory Management</a>”. ACM. ISBN 1-58113-114-3.</p>
|
||
</li>
|
||
<li><p id="jones12">Richard E. Jones, Antony Hosking, and Eliot Moss. 2012. “<a class="reference external" href="http://gchandbook.org/">The Garbage Collection Handbook</a>”. Chapman & Hall.</p>
|
||
</li>
|
||
<li><p id="joyner96">Ian Joyner. 1996. “<a class="reference external" href="http://www.emu.edu.tr/aelci/Courses/D-318/D-318-Files/cppcrit/index.htm">C++??: A Critique of C++</a>.”.</p>
|
||
</li>
|
||
<li><p id="kanefsky89">Bob Kanefsky. 1989. “<a class="reference external" href="http://www.songworm.com/db/songworm-parody/RecursiveMemoryAllocation.html">Recursive Memory Allocation</a>”. Bob Kanefsky. Songworm 3, p.?.</p>
|
||
</li>
|
||
<li><p id="kqh98">Jin-Soo Kim, Xiaohan Qin, Yarsun Hsu. 1998. “<a class="reference external" href="http://csl.skku.edu/papers/wwc98.pdf">Memory Characterization of a Parallel Data Mining Workload</a>”. IEEE. Proc. Workload Characterization: Methodology and Case Studies, pp. .</p>
|
||
</li>
|
||
<li><p id="kh00">Jin-Soo Kim & Yarsun Hsu. 2000. “Memory system behavior of Java programs: methodology and analysis”. ACM. Proc. International conference on measurements and modeling of computer systems, pp. 264–274.</p>
|
||
</li>
|
||
<li><p id="kolodner92">Elliot K. Kolodner. 1992. “Atomic Incremental Garbage Collection and Recovery for a Large Stable Heap”. Laboratory for Computer Science at MIT. MIT-LCS-TR-534.</p>
|
||
</li>
|
||
<li><p id="lk98">Per-Åke Larson & Murali Krishnan. 1998. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.45.1947&rep=rep1&type=pdf">Memory Allocation for Long-Running Server Applications</a>”. ACM. ISMM‘98 pp. 176–185.</p>
|
||
</li>
|
||
<li><p id="lh83">Henry Lieberman & Carl Hewitt. 1983. “<a class="reference external" href="http://web.media.mit.edu/~lieber/Lieberary/GC/Realtime/Realtime.html">A real-time garbage collector based on the lifetimes of objects</a>”. ACM. 26(6):419–429.</p>
|
||
</li>
|
||
<li><p id="mm59">J. McCarthy, M. L. Minsky. 1959. “Artificial Intelligence, Quarterly Progress Report no. 53”. Research Laboratory of Electronics at MIT.</p>
|
||
</li>
|
||
<li><p id="mccarthy60">J. McCarthy. 1960. “<a class="reference external" href="http://www-formal.stanford.edu/jmc/recursive.html">Recursive Functions of Symbolic Expressions and Their Computation by Machine</a>”. CACM.</p>
|
||
</li>
|
||
<li><p id="mccarthy79">John McCarthy. 1979. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.16.4634&rep=rep1&type=pdf">History of Lisp</a>”. In <em>History of programming languages I</em>, pp. 173–185. ACM.</p>
|
||
</li>
|
||
<li><p id="ptm98">Veljko Milutinovic, Jelica Protic, Milo Tomasevic. 1997. “<a class="reference external" href="http://www.cs.umass.edu/~mcorner/courses/691J/papers/VM/protic_dsm/protic_dsm.pdf">Distributed shared memory: concepts and systems</a>”. IEEE Computer Society Press. ISBN 0-8186-7737-6.</p>
|
||
</li>
|
||
<li><p id="minsky63">M. L. Minsky. 1963. “A LISP Garbage Collector Algorithm Using Serial Secondary Storage”. MIT. Memorandum MAC-M-129, Artificial Intelligence Project, Memo 58 (revised).</p>
|
||
</li>
|
||
<li><p id="moon84">David Moon. 1984. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.125.2438&rep=rep1&type=pdf">Garbage Collection in a Large Lisp System</a>”. ACM. Symposium on Lisp and Functional Programming, August 1984.</p>
|
||
</li>
|
||
<li><p id="moon85">David Moon. 1985. “Architecture of the Symbolics 3600”. IEEE. 12th International Symposium on Computer Architecture, pp. 76–83.</p>
|
||
</li>
|
||
<li><p id="moon87">David Moon. 1990. “Symbolics Architecture”. Wiley. Chapter 3 of <em>Computers for Artificial Intelligence Processing</em>, ISBN 0-471-84811-5.</p>
|
||
</li>
|
||
<li><p id="moon91">David Moon. 1991. “Genera Retrospective”. IEEE. 1991 International Workshop on Object Orientation in Operating Systems, order #2265.</p>
|
||
</li>
|
||
<li><p id="mordec84">Ben-Ari Mordechai. 1984. “Algorithms for On-the-fly Garbage Collection”. <em>TOPLAS</em> 6(3): 333–344 (1984).</p>
|
||
</li>
|
||
<li><p id="moreau98">Luc Moreau. 1998. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.49.4593&rep=rep1&type=pdf">Hierarchical Distributed Reference Counting</a>”. ACM. ISMM‘98 pp. 57–67.</p>
|
||
</li>
|
||
<li><p id="mfh95">Greg Morrisett, Matthias Felleisen, Robert Harper. 1995. “<a class="reference external" href="http://www.eecs.harvard.edu/~greg/papers/fpca_gc.ps">Abstract Models of Memory Management</a>”. Carnegie Mellon University. CMU-CS-FOX-95-01.</p>
|
||
</li>
|
||
<li><p id="mbmm99">David S. Munro, Alfred Brown, Ron Morrison, J. Eliot B. Moss. 1999. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.36.3687&rep=rep1&type=pdf">Incremental Garbage Collection of a Persistent Object Store using PMOS</a>”. Morgan Kaufmann. in Advances in Persistent Object Systems, pp. 78–91.</p>
|
||
</li>
|
||
<li><p id="noph92">Scott Nettles, James O’Toole, David Pierce, Nickolas Haines. 1992. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.28.4233&rep=rep1&type=pdf">Replication-Based Incremental Copying Collection</a>”. IWMM‘92.</p>
|
||
</li>
|
||
<li><p id="nettles92">Scott Nettles. 1992. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.45.1498&rep=rep1&type=pdf">A Larch Specification of Copying Garbage Collection</a>”. Carnegie Mellon University. CMU-CS-92-219.</p>
|
||
</li>
|
||
<li><p id="no93a">Scott Nettles & James O’Toole. 1993. “Implementing Orthogonal Persistence: A Simple Optimization Using Replicating Collection”. USENIX. IWOOOS‘93.</p>
|
||
</li>
|
||
<li><p id="no93">Scott Nettles & James O’Toole. 1993. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.69.1875&rep=rep1&type=pdf">Real-Time Replication Garbage Collection</a>”. ACM. PLDI‘93.</p>
|
||
</li>
|
||
<li><p id="nielsen77">Norman R. Nielsen. 1977. “Dynamic Memory Allocation in Computer Simulation”. ACM. CACM 20:11.</p>
|
||
</li>
|
||
<li><p id="otoole90">James O’Toole. 1990. “Garbage Collecting Locally”.</p>
|
||
</li>
|
||
<li><p id="on94">James O’Toole & Scott Nettles. 1994. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.49.5001&rep=rep1&type=pdf">Concurrent Replicating Garbage Collection</a>”. ACM. LFP‘94.</p>
|
||
</li>
|
||
<li><p id="jrr99">Simon Peyton Jones, Norman Ramsey, Fermin Reig. 1999. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.11.1815&rep=rep1&type=pdf">C–: a portable assembly language that supports garbage collection</a>”. Springer-Verlag. International Conference on Principles and Practice of Declarative Programming 1999, LNCS 1702, pp. 1–28.</p>
|
||
</li>
|
||
<li><p id="pieper93">John S. Pieper. 1993. “Compiler Techniques for Managing Data Motion”. Carnegie Mellon University. Technical report number CMU-CS-93-217.</p>
|
||
</li>
|
||
<li><p id="pirinen98">Pekka P. Pirinen. 1998. “Barrier techniques for incremental tracing”. ACM. ISMM‘98 pp. 20–25.</p>
|
||
</li>
|
||
<li><p id="printezis96">Tony Printezis. 1996. “Disk Garbage Collection Strategies for Persistent Java”. Proceedings of the First International Workshop on Persistence and Java.</p>
|
||
</li>
|
||
<li><p id="pc96">Tony Printezis & Quentin Cutts. 1996. “Measuring the Allocation Rate of Napier88”. Department of Computing Science at University of Glasgow. TR ?.</p>
|
||
</li>
|
||
<li><p id="reinhold93">M. B. Reinhold. 1993. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.18.5454&rep=rep1&type=pdf">Cache Performance of Garbage Collected Programming Languages</a>”. Laboratory for Computer Science at MIT. MIT/LCS/TR-581.</p>
|
||
</li>
|
||
<li><p id="robson77">J. M. Robson. 1977. “Worst case fragmentation of first fit and best fit storage allocation strategies”. ACM. ACM Computer Journal, 20(3):242–244.</p>
|
||
</li>
|
||
<li><p id="rr97">Gustavo Rodriguez-Rivera & Vince Russo. 1997. “Non-intrusive Cloning Garbage Collection with Stock Operating System Support”. Software – Practice and Experience. 27:8.</p>
|
||
</li>
|
||
<li><p id="rojemo95">Niklas Röjemo. 1995. “Highlights from nhc – a space-efficient Haskell compiler”. Chalmers University of Technology.</p>
|
||
</li>
|
||
<li><p id="rojemo95a">Niklas Röjemo. 1995. “Generational garbage collection for lazy functional languages without temporary space leaks”. Chalmers University of Technology.</p>
|
||
</li>
|
||
<li><p id="rr96">Niklas Röjemo & Colin Runciman. 1996. “Lag, drag, void and use – heap profiling and space-efficient compilation revisited”. ACM, SIGPLAN. ICFP‘96, ACM SIGPLAN Notices 31:6, ISBN 0-89791-770-7, pp. 34–41.</p>
|
||
</li>
|
||
<li><p id="rw99">David J. Roth, David S. Wise. 1999. “<a class="reference external" href="http://www.cs.indiana.edu/pub/techreports/TR516.pdf">One-bit counts between unique and sticky</a>”. ACM. ISMM‘98, pp. 49–56.</p>
|
||
</li>
|
||
<li><p id="rovner85">Paul Rovner. 1985. “<a class="reference external" href="http://e3k.computer-refuge.org/bitsavers/pdf/xerox/parc/techReports/CSL-84-7_On_Adding_Garbage_Collection_and_Runtime_Types_to_a_Strongly-Typed_Statically-Checked_Concurrent_Language.pdf">On Adding Garbage Collection and Runtime Types to a Strongly-Typed, Statically-Checked, Concurrent Language</a>”. Xerox PARC. TR CSL-84-7.</p>
|
||
</li>
|
||
<li><p id="runciman92">Colin Runciman & David Wakeling. 1992. “<a class="reference external" href="ftp://ftp.cs.york.ac.uk/reports/YCS-92-172.ps.Z">Heap Profiling of Lazy Functional Programs</a>”. University of York.</p>
|
||
</li>
|
||
<li><p id="rr94">Colin Runciman & Niklas Röjemo. 1994. “<a class="reference external" href="http://www.cs.york.ac.uk/plasma/publications/pdf/RuncimanWakelingJFP93.pdf">New dimensions in heap profiling</a>”. University of York.</p>
|
||
</li>
|
||
<li><p id="rr96a">Colin Runciman & Niklas Röjemo. 1996. “Two-pass heap profiling: a matter of life and death”. Department of Computer Science, University of York.</p>
|
||
</li>
|
||
<li><p id="sg95">Jacob Seligmann & Steffen Grarup. 1995. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.32.7307&rep=rep1&type=pdf">Incremental Mature Garbage Collection Using the Train Algorithm</a>”. Springer-Verlag. ECOOP‘95, Lecture Notes in Computer Science, Vol. 952, pp. 235–252, ISBN 3-540-60160-0.</p>
|
||
</li>
|
||
<li><p id="sb00">Manuel Serrano, Hans-J. Boehm. 2000. “<a class="reference external" href="http://www.hpl.hp.com/techreports/2000/HPL-2000-62.html">Understanding memory allocation of Scheme programs</a>”. ACM. Proceedings of International Conference on Functional Programming 2000.</p>
|
||
</li>
|
||
<li><p id="shapiro94">Marc Shapiro & Paulo Ferreira. 1994. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.52.8468&rep=rep1&type=pdf">Larchant-RDOSS: a distributed shared persistent memory and its garbage collector</a>”. INRIA. INRIA Rapport de Recherche no. 2399; Cornell Computer Science TR94-1466.</p>
|
||
</li>
|
||
<li><p id="shaw87">Robert A. Shaw. 1987. “Improving Garbage Collector Performance in Virtual Memory”. Stanford University. CSL-TR-87-323.</p>
|
||
</li>
|
||
<li><p id="shaw88">Robert A. Shaw. 1988. “Empirical Analysis of a LISP System”. Stanford University. CSL-TR-88-351.</p>
|
||
</li>
|
||
<li><p id="singhal92">Vivek Singhal, Sheetal V. Kakkad, Paul R. Wilson. 1992. “<a class="reference external" href="ftp://ftp.cs.utexas.edu/pub/garbage/texaspstore.ps">Texas: An Efficient, Portable Persistent Store</a>”. University of Texas at Austin.</p>
|
||
</li>
|
||
<li><p id="sobalvarro88">P. G. Sobalvarro. 1988. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.57.2188&rep=rep1&type=pdf">A Lifetime-based Garbage Collector for LISP Systems on General-Purpose Computers</a>”. MIT. AITR-1417.</p>
|
||
</li>
|
||
<li><p id="steele75">Guy L. Steele. 1975. “<a class="reference external" href="http://www.cs.utexas.edu/users/mckinley/395Tmm/talks/Mar-23-CMS.pdf">Multiprocessing Compactifying Garbage Collection</a>”. CACM. 18:9 pp. 495–508.</p>
|
||
</li>
|
||
<li><p id="steele76">Guy L. Steele. 1976. “Corrigendum: Multiprocessing Compactifying Garbage Collection”. CACM. 19:6 p.354.</p>
|
||
</li>
|
||
<li><p id="steele77">Guy L. Steele. 1977. “Data Representation in PDP-10 MACLISP”. MIT. AI Memo 421.</p>
|
||
</li>
|
||
<li><p id="slc99">James M. Stichnoth, Guei-Yuan Lueh, Michal Cierniak. 1999. “<a class="reference external" href="http://www.acm.org/pubs/citations/proceedings/pldi/301618/p118-stichnoth/">Support for Garbage Collection at Every Instruction in a Java Compiler</a>”. SIGPLAN. Proceedings of the 1999 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). SIGPLAN Notices 34(5). pp. 118–127.</p>
|
||
</li>
|
||
<li><p id="scn84">Will R Stoye, T J W Clarke, Arthur C Norman. 1984. “Some Practical Methods for Rapid Combinator Reduction”. In LFP 1984, 159–166.</p>
|
||
</li>
|
||
<li><p id="td95">David Tarditi & Amer Diwan. 1995. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.45.4550&rep=rep1&type=pdf">Measuring the Cost of Storage Management</a>”. Carnegie Mellon University. CMU-CS-94-201.</p>
|
||
</li>
|
||
<li><p id="tj94">Stephen Thomas, Richard E. Jones. 1994. “Garbage Collection for Shared Environment Closure Reducers”. Computing Laboratory, The University of Kent at Canterbury. Technical Report 31-94.</p>
|
||
</li>
|
||
<li><p id="thomas95">Stephen Thomas. 1995. “Garbage Collection in Shared-Environment Closure Reducers: Space-Efficient Depth First Copying using a Tailored Approach”. <em>Information Processing Letters.</em> 56:1, pp. 1–7.</p>
|
||
</li>
|
||
<li><p id="tt97">Mads Tofte & Jean-Pierre Talpin. 1997. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.75.9105&rep=rep1&type=pdf">Region-Based Memory Management</a>”. Information and Computation 132(2), pp. 109–176.</p>
|
||
</li>
|
||
<li><p id="ungar84">Dave Ungar. 1984. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.122.4295&rep=rep1&type=pdf">Generation Scavenging: A Non-disruptive High Performance Storage Reclamation Algorithm</a>”. ACM, SIGSOFT, SIGPLAN. Practical Programming Environments Conference.</p>
|
||
</li>
|
||
<li><p id="ungar88">Dave Ungar & Frank Jackson. 1988. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.115.2810&rep=rep1&type=pdf">Tenuring Policies for Generation-Based Storage Reclamation</a>”. SIGPLAN. OOPSLA ‘88 Conference Proceedings, ACM SIGPLAN Notices, Vol. 23, No. 11, pp. 1–17.</p>
|
||
</li>
|
||
<li><p id="vo96">Kiem-Phong Vo. 1996. “Vmalloc: A General and Efficient Memory Allocator”. Software – Practice and Experience. 26(3): 357–374 (1996).</p>
|
||
</li>
|
||
<li><p id="ww76">Daniel C. Watson, David S. Wise. 1976. “Tuning Garwick’s algorithm for repacking sequential storage”. <em>BIT.</em> 16, 4 (December 1976): 442–450.</p>
|
||
</li>
|
||
<li><p id="wlm92">Paul R. Wilson, Michael S. Lam, Thomas G. Moher. 1992. “Caching Considerations for Generational Garbage Collection”. ACM. L&FP 92.</p>
|
||
</li>
|
||
<li><p id="wil92a">Paul R. Wilson, Sheetal V. Kakkad. 1992. “<a class="reference external" href="ftp://ftp.cs.utexas.edu/pub/garbage/swizz.ps">Pointer Swizzling at Page Fault Time</a>”. University of Texas at Austin.</p>
|
||
</li>
|
||
<li><p id="wil94">Paul R. Wilson. 1994. “<a class="reference external" href="ftp://ftp.cs.utexas.edu/pub/garbage/bigsurv.ps">Uniprocessor Garbage Collection Techniques</a>”. University of Texas.</p>
|
||
</li>
|
||
<li><p id="wil95">Paul R. Wilson, Mark S. Johnstone, Michael Neely, David Boles. 1995. “<a class="reference external" href="ftp://ftp.cs.utexas.edu/pub/garbage/allocsrv.ps">Dynamic Storage Allocation: A Survey and Critical Review</a>”. University of Texas at Austin.</p>
|
||
</li>
|
||
<li><p id="wise78">David S. Wise. 1978. “<a class="reference external" href="http://www.cs.indiana.edu/ftp/techreports/">The double buddy system</a>”. Department of Computer Science at Indiana University. Technical Report 79.</p>
|
||
</li>
|
||
<li><p id="wise79">David S. Wise. 1979. “<a class="reference external" href="http://www.cs.indiana.edu/ftp/techreports/TR75.pdf">Morris’s garbage compaction algorithm restores reference counts</a>”. TOPLAS. 1, 1 (July l979): 115–120.</p>
|
||
</li>
|
||
<li><p id="wise85">David S. Wise. 1985. “<a class="reference external" href="http://www.cs.indiana.edu/ftp/techreports/TR163.pdf">Design for a multiprocessing heap with on-board reference counting</a>”. Springer-Verlag. In J.-P. Jouannaud (ed.), Functional Programming Languages and Computer Architecture, Lecture Notes in Computer Science 201: 289–304.</p>
|
||
</li>
|
||
<li><p id="wise93"><span id="wise92"></span>David S. Wise. 1993. “<a class="reference external" href="http://www.cs.indiana.edu/ftp/techreports/TR360.pdf">Stop-and-copy and one-bit reference counting</a>”. <em>Information Processing Letters.</em> 46, 5 (July 1993): 243–249.</p>
|
||
</li>
|
||
<li><p id="ww95">David S. Wise, Joshua Walgenbach. 1996. “<a class="reference external" href="http://www.cs.indiana.edu/ftp/techreports/TR437.pdf">Static and Dynamic Partitioning of Pointers as Links and Threads</a>”. SIGPLAN. Proc. 1996 ACM SIGPLAN Intl. Conf. on Functional Programming, SIGPLAN Not. 31, 6 (June 1996), pp. 42–49.</p>
|
||
</li>
|
||
<li><p id="whhho94">David S. Wise, Brian Heck, Caleb Hess, Willie Hunt, Eric Ost. 1997. “<a class="reference external" href="http://www.cs.indiana.edu/ftp/techreports/TR401.pdf">Uniprocessor Performance of a Reference-Counting Hardware Heap</a>”. <em>LISP and Symbolic Computation.</em> 10, 2 (July 1997), pp. 159–181.</p>
|
||
</li>
|
||
<li><p id="withington91">P. Tucker Withington. 1991. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.116.3169&rep=rep1&type=pdf">How Real is ‘Real-Time’ Garbage Collection?</a>”. ACM. OOPSLA/ECOOP ‘91 Workshop on Garbage Collection in Object-Oriented Systems.</p>
|
||
</li>
|
||
<li><p id="yip91">G. May Yip. 1991. “<a class="reference external" href="http://www.hpl.hp.com/techreports/Compaq-DEC/WRL-91-8.pdf">Incremental, Generational Mostly-Copying Garbage Collection in Uncooperative Environments</a>”. Digital Equipment Corporation.</p>
|
||
</li>
|
||
<li><p id="yuasa90">Taiichi Yuasa. 1990. “Real-Time Garbage Collection on General-Purpose Machines”. Journal of Software and Systems. 11:3 pp. 181–198.</p>
|
||
</li>
|
||
<li><p id="zorn88">Benjamin Zorn & Paul Hilfinger. 1988. “<a class="reference external" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.6.1689&rep=rep1&type=pdf">A Memory Allocation Profiler for C and Lisp Programs</a>”. USENIX. Proceedings for the Summer 1988 USENIX Conference, pp. 223–237.</p>
|
||
</li>
|
||
<li><p id="zorn89">Benjamin Zorn. 1989. “<a class="reference external" href="http://www.eecs.berkeley.edu/Pubs/TechRpts/1989/CSD-89-544.pdf">Comparative Performance Evaluation of Garbage Collection Algorithms</a>”. Computer Science Division (EECS) of University of California at Berkeley. Technical Report UCB/CSD 89/544 and PhD thesis.</p>
|
||
</li>
|
||
<li><p id="zorn90b">Benjamin Zorn. 1990. “Comparing Mark-and-sweep and Stop-and-copy Garbage Collection”. ACM. Conference on Lisp and Functional Programming, pp. 87–98.</p>
|
||
</li>
|
||
<li><p id="zorn90">Benjamin Zorn. 1990. “<a class="reference external" href="http://www.cs.colorado.edu/department/publications/reports/docs/CU-CS-494-90.pdf">Barrier Methods for Garbage Collection</a>”. University of Colorado at Boulder. Technical Report CU-CS-494-90.</p>
|
||
</li>
|
||
<li><p id="zorn91">Benjamin Zorn. 1991. “<a class="reference external" href="http://www.cs.colorado.edu/department/publications/reports/docs/CU-CS-528-91.pdf">The Effect of Garbage Collection on Cache Performance</a>”. University of Colorado at Boulder. Technical Report CU-CS-528-91.</p>
|
||
</li>
|
||
<li><p id="zorn92b">Benjamin Zorn & Dirk Grunwald. 1992. “<a class="reference external" href="http://www.cs.colorado.edu/department/publications/reports/docs/CU-CS-604-92.pdf">Empirical Measurements of Six Allocation-intensive C Programs</a>”. ACM, SIGPLAN. SIGPLAN notices, 27(12):71–80.</p>
|
||
</li>
|
||
<li><p id="zorn92">Benjamin Zorn. 1993. “<a class="reference external" href="http://www.cs.colorado.edu/department/publications/reports/docs/CU-CS-573-92.pdf">The Measured Cost of Conservative Garbage Collection</a>”. Software – Practice and Experience. 23(7):733–756.</p>
|
||
</li>
|
||
<li><p id="zorn92a">Benjamin Zorn & Dirk Grunwald. 1994. “<a class="reference external" href="http://www.cs.colorado.edu/department/publications/reports/docs/CU-CS-603-92.pdf">Evaluating Models of Memory Allocation</a>”. ACM. Transactions on Modeling and Computer Simulation 4(1):107–131.</p>
|
||
</li>
|
||
</ul>
|
||
</div>
|
||
|
||
|
||
</div>
|
||
</div>
|
||
</div>
|
||
<div class="sphinxsidebar">
|
||
<div class="sphinxsidebarwrapper">
|
||
<p class="logo"><a href="../index.html">
|
||
<img class="logo" src="../_static/logo.png" alt="Logo"/>
|
||
</a></p>
|
||
<h4>Previous topic</h4>
|
||
<p class="topless"><a href="faq.html"
|
||
title="previous chapter">5. Frequently Asked Questions</a></p>
|
||
<h4>Next topic</h4>
|
||
<p class="topless"><a href="credit.html"
|
||
title="next chapter">Acknowledgements</a></p><h4>Downloads</h4>
|
||
|
||
<p class="topless">
|
||
<a href="http://www.ravenbrook.com/project/mps/release/1.111.0/">MPS Kit release 1.111.0</a><br>
|
||
<a href="http://www.ravenbrook.com/project/mps/release/">All MPS Kit releases</a>
|
||
</p>
|
||
|
||
<h4>Issues</h4>
|
||
|
||
<p class="topless">
|
||
<a href="http://www.ravenbrook.com/project/mps/issue/?action=list&view=status%3dopen&display=Job:Priority:Title&sort=Priority">Known issues</a><br>
|
||
<a href="http://www.ravenbrook.com/project/mps/issue/?action=fixed&release_fixed=1.111.0">Issues fixed in release 1.111.0</a>
|
||
</p><h4>Contact us</h4>
|
||
|
||
<p class="topless"><a href="mailto:mps-questions@ravenbrook.com">mps-questions@ravenbrook.com</a></p>
|
||
</div>
|
||
</div>
|
||
<div class="clearer"></div>
|
||
</div>
|
||
<div class="related">
|
||
<h3>Navigation</h3>
|
||
<ul>
|
||
<li class="right" style="margin-right: 10px">
|
||
<a href="../genindex.html" title="General Index"
|
||
>index</a></li>
|
||
<li class="right" >
|
||
<a href="credit.html" title="Acknowledgements"
|
||
>next</a> |</li>
|
||
<li class="right" >
|
||
<a href="faq.html" title="5. Frequently Asked Questions"
|
||
>previous</a> |</li>
|
||
<li><a href="../index.html">Memory Pool System 1.111.0 documentation</a> »</li>
|
||
</ul>
|
||
</div>
|
||
<div class="footer">
|
||
© <a href="../copyright.html">Copyright</a> 2013, Ravenbrook Limited.
|
||
Created using <a href="http://sphinx.pocoo.org/">Sphinx</a> 1.1.3.
|
||
</div>
|
||
</body>
|
||
</html> |