Thomas Wang. The MM garbage collector for C++. Master's thesis, California State Polytechnic University, October 1989. 13  Home/Search   Document Not in Database   Summary   Related Articles   Check

....to implement a mark function in each garbage collected class to mark recursively the targets of pointers contained in objects of that class. This collector is designed to allow asynchronous object finalization, as in Cedar [17] and Modula 2 [18] in lieu of destructor invocation. Wang [26] describes a collector based on smart pointers implemented with template classes. This system offers both reference counting collection and fake copy collection; the latter, which is similar to generational mark and sweep, reclaims cyclic garbage. In this system, programmers use a distinguished ....

Thomas Wang. The MM garbage collector for C++. Master's thesis, California Polytechnic State University, San Luis Obispo, October 1989.

....of any object by catching all references to all objects. This approach is attractive in situations where 1 Note that non copying collection need not incur the cost of the sweep phase of a mark sweep collector as is commonly assumed. In Section 5.7. 1 we explain a technique known as fake copying [Wan89] also known as implicit reclamation [Bak91] which avoids the cost of a sweep phase. 2 Conservative pointer finding techniques are subject to erroneously keeping objects (and hence entire data structures) live by finding an integer that happens to look like a pointer into the heap. Thus it ....

....garbage and can be reclaimed in one operation. The garbage objects are never examined, and their space is implicitly reclaimed. While at first these two methods of reclaiming garbage memory may seem fundamentally different, there is a way to combine them to receive many of the advantages of both [Wan89, Bak91] This fake copying approach is fundamental to our real time garbage collector implementation, and we will discuss it in detail in Section 5.5. 4.1 Real time Garbage Collection For truly real time applications, fine grained incremental garbage collection appears to be necessary. ....

[Article contains additional citation context not shown here]

Thomas Wang. MM garbage collector for C++. Master's thesis, California Polytechnic State University, San Luis Obispo, California, October 1989.

....solves this problem by deallocating the object automatically when no module needs it. There are several algorithms for automatic garbage collection: mark and sweep collection[McC60] markcompact collection[CN83] copying garbage collection[FY69, Che70] and non copying implicit collection [Wan89, Bak91] We choose to use mark and sweep garbage collection in our implementation since it can be implemented conservatively. Mark and sweep collection[McC60] consists of two phases: the mark phase and a sweep phase. The mark phase identifies the blocks that are garbage, and the sweep phase ....

Thomas Wang. MM garbage collector for C++. Master's thesis, California Polytechnic State University, San Luis Obispo, California, October 1989.

....costs, assuming that the larger heap area can be cached in RAM rather than paged to disk. As we will explain in Sect. 2.7, paging costs may make the use of a larger heap area impractical if there is not a correspondingly large amount of RAM. 2. 5 Non Copying Implicit Collection Recently, Wang [Wan89] and Baker [Bak91b] have (independently) proposed a new kind of non copying collector with some of the efficiency advantages of a copying scheme. Their insight is that in a copying collector, the spaces of the collector are really just a particular implementation of sets. The tracing process ....

Thomas Wang. MM garbage collector for C++. Master's thesis, California Polytechnic State University, San Luis Obispo, California, October 1989.

....is not dependent on any particular implementation of the region primitives. In the past region have been implemented as contiguous allocation arenas. If we implement regions as doubly linked list of objects rather than contiguous allocation arenas, we can build a fake copying collector [33]. The fake copying scheme forms the basis for incremental techniques such as Bakers s Treadmill [5] We maybe be able to use this observation as the basis for building safe incremental collectors. The mark bits used in mark sweep and mark compact collectors can also be seen as a simple set ....

Thomas Wang. The MM garbage collector for C++. Master's thesis, California State Polytechnic University, October 1989. 13

....is not dependent on any particular implementation of the region primitives. In the past region have been implemented as contiguous allocation arenas. If we implement regions as doubly linked list of objects rather than contiguous allocation arenas, we can build a fake copying collector [33]. The fake copying scheme forms the basis for incremental techniques such as Bakers s Treadmill [5] We maybe be able to use this observation as the basis for building safe incremental collectors. The mark bits used in mark sweep and mark compact collectors can also be seen as a simple set ....

Thomas Wang. The MM garbage collector for C++. Master's thesis, California State Polytechnic University, October 1989. 13

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