Tanaka, Yoshio, Matsui, Shogo, Maeda, Atsushi, & Nakanishi, Maskazu. 1994. Partial Marking GC. Pages 337--348 of: Parallel processing : CONPAR 94-VAPP VI : third Joint International Conference on Vector and Parallel Processing. Springer.  Home/Search   Document Details and Download   Summary   Related Articles

.... the according to chunk size for efficiency (Heeb Pfister, 1990 ) and language independent implementations (Ferreira, 1991) Mark and Sweep is also amenable to various forms of concurrency (Dijkstra et al. 1978; Baker, 1978; Washabaugh Kafura, 1990; Kuechlin Nevin, 1991; Boehm et al. 1991; Tanaka et al. 1994). Most implementations use a timestamp to mark chunks mutated during the relatively long marking phase, allowing both the mutator 2.4. Garbage Collection Algorithms 15 Root Set Free List Unused Memory 1 2 1 Reference Count for following object Object Figure 2.4: The heap organisation using ....

....2.4.3.1 Advantages and Disadvantages Mark and Compact is able to defragment memory and to reclaim circular structures. It s incremental variants require mutator checks on chunk reference during the collection cycle. As with mark and sweep, all chunks are swept twice (Washabaugh Kafura, 1990; Tanaka et al. 1994). 2.4.4 Semi Space Semi Space garbage collection algorithms divide the heap into two contiguous areas called the from space and to space. For each garbage collection cycle all reachable chunks are traced and copied from the from space to the to space (Fenichel Yochelson, 1969) The garbage ....

[Article contains additional citation context not shown here]

Tanaka, Yoshio, Matsui, Shogo, Maeda, Atsushi, & Nakanishi, Maskazu. 1994. Partial Marking GC. Pages 337--348 of: Parallel processing : CONPAR 94-VAPP VI : third Joint International Conference on Vector and Parallel Processing. Springer.

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