http:^^www.cs.utexas.edu^users^oops^papers.html

This data set contains WWW-pages collected from computer science departments of various universities

<li> <a name="gcsurvey"> Paul R. Wilson. <b>Uniprocessor Garbage
Collection Techniques</b>. In <cite>International Workshop on Memory
Management</cite>, St. Malo, France, September 1992. (The Proceedings
has been published as <cite>Springer-Verlag Lecture Notes in Computer
Science no. 637</cite>). </a> <p>

<blockquote>
We survey basic garbage collection algorithms, and variations such as
incremental and generational collection.  The basic algorithms include
reference counting, mark-sweep, mark-compact, copying, and treadmill
collection. Incremental techniques can keep garbage collection
pause times short, by interleaving small amounts of collection work
with program execution.  Generational schemes improve efficiency and
locality by garbage collecting a smaller area more often, while
exploiting typical lifetime characteristics to avoid undue overhead
from long-lived objects.
</blockquote>

<!WA15><!WA15><!WA15><!WA15><!WA15><a href="ftp://ftp.cs.utexas.edu/pub/garbage/gcsurvey.ps">
<!WA16><!WA16><!WA16><!WA16><!WA16><img align=bot src="http://www.cs.utexas.edu/icons/doc.xbm" alt=""></a>
<!WA17><!WA17><!WA17><!WA17><!WA17><a href="ftp://ftp.cs.utexas.edu/pub/garbage/gcsurvey.ps">Postscript
 <i>(379KB)</i></a>
<p>

<li> <a name="bigsurv"> Paul R. Wilson. <b>Uniprocessor Garbage
Collection Techniques</b>. Draft of much expanded version of the above
paper. In revision (accepted for <cite>ACM Computing Surveys</cite>).</a> <p>

<blockquote>
We survery basic garbage collection algorithms, and variations such as
incremental and generational collection; we then discuss low-level
implementation considerations and relationships between storage
management systems, languages, and compilers. Throughout, we attempt
to present a unified view based on abstract traversal strategies,
addressing issues of conservatism, opportunism, and immediacy of
reclamation; we also point out a variety of implemetation details that
are likely to have significant impact on the performance.
</blockquote>

<!WA18><!WA18><!WA18><!WA18><!WA18><a href="ftp://ftp.cs.utexas.edu/pub/garbage/bigsurv.ps">
<!WA19><!WA19><!WA19><!WA19><!WA19><img align=bot src="http://www.cs.utexas.edu/icons/doc.xbm" alt=""></a>
<!WA20><!WA20><!WA20><!WA20><!WA20><a href="ftp://ftp.cs.utexas.edu/pub/garbage/bigsurv.ps">Postscript
 <i>(764KB)</i></a>
<p>

<li> <a name="swizz"> Paul R. Wilson and Sheetal V. Kakkad. <b>Pointer
Swizzling at Page Fault Time: Efficiently and Compatibly Supporting
Huge Address Spaces on Standard Hardware</b>. In <cite>International
Workshop on Object Orientation in Operating Systems</cite>, pages
364-377, Paris, France, September 1992.</a> <p>

<blockquote>
Pointer swizzling at page fault time is a novel address translation
mechanism that exploits conventional address translation hardware.  It
can support huge address spaces efficiently without long hardware
addresses; such large address spaces are attractive for persistent
object stores, distributed shared memories, and shared address space
operating systems.  This swizzling scheme can be used to provide data
compatibility across machines with different word sizes, and even to
provide binary code compatibility across machines with different
hardware address sizes.
<p>
Pointers are translated ("swizzled") from a long format to a shorter
hardware-supported format at page fault time.  No extra hardware is
required, and no continual software overhead is incurred by presence
checks or indirection of pointers.  This pagewise technique exploits
temporal and spatial locality in much the same way as a normal virtual
memory; this gives it many desirable performance characteristics,
especially given the trend toward larger main memories.  It is easy to
implement using common compilers and operating systems.
</blockquote>

<!WA21><!WA21><!WA21><!WA21><!WA21><a href="ftp://ftp.cs.utexas.edu/pub/garbage/swizz.ps">
<!WA22><!WA22><!WA22><!WA22><!WA22><img align=bot src="http://www.cs.utexas.edu/icons/doc.xbm" alt=""></a>
<!WA23><!WA23><!WA23><!WA23><!WA23><a href="ftp://ftp.cs.utexas.edu/pub/garbage/swizz.ps">Postscript
 <i>(279KB)</i></a>
<p>

<li> <a name="texas"> Vivek Singhal, Sheetal Kakkad, and Paul Wilson.
<b> Texas: An Efficient, Portable Persistent Store</b>. In <cite>
Persistent Object Systems: Proceedings of the Fifth International
Workshop on Persistent Object Systems</cite>, pages 11-33, San
Miniato, Italy, September 1992.</a> <p>

<blockquote>
Texas is a persistent storage system for C++, providing high
performance while emphasizing simplicity, modularity and portability.
A key component of the design is the use of pointer swizzling at page
fault time, which exploits existing virtual memory features to
implement large address spaces efficiently on stock hardware, with
little or no change to existing compilers. Long pointers are used to
implement an enormous address space, but are transparently converted
to the hardware-supported pointer format when pages are loaded into
virtual memory.
<p>
Runtime type descriptors and slightly modified heap allocation
routines support pagewise pointer swizzling by allowing objects
and their pointer fields to be identified within pages.  If compiler
support for runtime type identification is not available, a simple
preprocessor can be used to generate type descriptors.
<p>
This address translation is largely independent of issues of data
caching, sharing, and checkpointing; it employs operating systems'
existing virtual memories for caching, and a simple and flexible
log-structured storage manager to improve checkpointing performance.
<p>
Pagewise virtual memory protections are also used to detect writes for
logging purposes, without requiring any changes to compiled code.
This may degrade checkpointing performance for small transactions with
poor locality of writes, but page diffing and sub-page logging promise
to keep performance competitive with finer-grained checkpointing
schemes.
<p>
Texas presents a simple programming interface; an application creates
persistent object by simply allocating them on the persistent heap.
In addition, the implementation is relatively small, and is easy to
incorporate into existing applications. The log-structured storage
module easily supports advanced extensions such as compressed storage,
versioning, and adaptive reorganization.
</blockquote>

<!WA24><!WA24><!WA24><!WA24><!WA24><a href="ftp://ftp.cs.utexas.edu/pub/garbage/texaspstore.ps">
<!WA25><!WA25><!WA25><!WA25><!WA25><img align=bot src="http://www.cs.utexas.edu/icons/doc.xbm" alt=""></a>
<!WA26><!WA26><!WA26><!WA26><!WA26><a href="ftp://ftp.cs.utexas.edu/pub/garbage/texaspstore.ps">Postscript
 <i>(271KB)</i></a>
<p>


<li> <a name="caching-gen-gc"> Paul R. Wilson, Michael S. Lam, and Thomas G.
Moher.  <b>Caching Considerations for Generational Garbage Collection</b>. 
<cite> 1992 ACM Symposium on Lisp and Functional Programming</cite>,
San Francisco, California, June 1992.</a> <p>

<!WA27><!WA27><!WA27><!WA27><!WA27><a href="ftp://ftp.cs.utexas.edu/pub/garbage/cache.ps">
<!WA28><!WA28><!WA28><!WA28><!WA28><img align=bot src="http://www.cs.utexas.edu/icons/doc.xbm" alt=""></a>
<!WA29><!WA29><!WA29><!WA29><!WA29><a href="ftp://ftp.cs.utexas.edu/pub/garbage/cache.ps">Postscript
 <i>(237KB)</i></a>

<p>


</ol>

More papers, a bibliography on heap management, and the <!WA30><!WA30><!WA30><!WA30><!WA30><a
href="ftp://ftp.cs.utexas.edu/pub/garbage/texas/"> source code for
Texas Persistent Store</a> are available via anonymous ftp at <!WA31><!WA31><!WA31><!WA31><!WA31><a
href="ftp://ftp.cs.utexas.edu/pub/garbage">
<b>ftp.cs.utexas.edu:/pub/garbage</b></a>. The 
<!WA32><!WA32><!WA32><!WA32><!WA32><a href="ftp://ftp.cs.utexas.edu/pub/garbage/README"> README</a> 
file lists all the available material including subdirectories which
contain collected papers from the 
<!WA33><!WA33><!WA33><!WA33><!WA33><a href="ftp://ftp.cs.utexas.edu/pub/garbage/GC91">1991</a> and 
<!WA34><!WA34><!WA34><!WA34><!WA34><a href="ftp://ftp.cs.utexas.edu/pub/garbage/GC93">1993</a> OOPSLA 
Garbage Collection and Memory Management Workshops.

<hr>

<address><!WA35><!WA35><!WA35><!WA35><!WA35><a href="http://www.cs.utexas.edu/users/svkakkad">Sheetal V. Kakkad</a></address>

</body>

</HTML>