Richard E. Jones and Rafael D. Lins. Cyclic weighted reference counting. Technical report 95, University of Kent, Canterbury, United Kingdom, December 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....from the persistent root, and therefore be garbage. However, a number of extensions of the basic referencing counting algorithm to handle cyclic data have been proposed in the programming language community, including: Bro85, Bro84, PvEP88] More recent work in this area includes [Lin90, MWL90, JL91] In this paper, we consider a version of reference counting, proposed by Brownbridge [Bro85, Bro84] for functional programming languages, which handles self referential cycles of garbage. We present an algorithm, called Transactional Cyclic Reference Counting (TCRC) based on Brownbridge s ....

Richard E. Jones and Rafael D. Lins. Cyclic weighted reference counting. Technical report 95, University of Kent, Canterbury, United Kingdom, December 1991.

....from the persistent root, and therefore be garbage. However, a number of extensions of the basic referencing counting algorithm to handle cyclic data have been proposed in the programming language community, including: Bro85, Bro84, PvEP88] More recent work in this area includes [Lin90, MWL90, JL91] In this paper, we consider a version of reference counting, proposed by Brownbridge [Bro85, Bro84] for functional programming languages, which handles self referential cycles of garbage. We present an algorithm, called Transactional Cyclic Reference Counting (TCRC) based on Brownbridge s ....

Richard E. Jones and Rafael D. Lins. Cyclic weighted reference counting. Technical report 95, University of Kent, Canterbury, United Kingdom, December 1991.

....of included groups. Included groups benefit from larger groups GC that perform some of their work. However, large group GCs are longer than smaller ones and therefore retain more floating garbage. For that reason, the authors assume that large group GCs are rare compared to small group GCs. In [Lins 1992] Lins and Jones combine Weighed Reference Counting with Lins local algorithm for Cyclic Reference Counting [Lins 1991] to address distribution issues. As a result, they propose a simple algorithm to garbage collect cycles in a distributed environment. The general idea of the algorithm is to ....

R. D. Lins and R. Jones. Cyclic weighted reference counting. Technical Report TR-95, University of Kent, Computing Labotory Canterbury (England, March 1992.

....of the object seeded in order to check if descendant s counts drop to zero. For this reason, trial deletion assumes that the main collector is reference counting based. The main difficulty of this technique consist in coming up with a good heuristics to select seed objects. 5. 4 Local Tracing Lins and Jones [1991] have proposed to combine Weighted Reference Counting with mark and sweep in order to collect garbage cycles. The tracing algorithm does not walk the whole distributed graph but from its root, instead traces locally from an object suspected to be part of a garbage cycle. This algorithm looks for a ....

Rafael D. Lins and Richard E. Jones. Cyclic weighted reference counting. Technical Report 95, University of Kent, Canterbury, United Kingdom, December 1991.

....of included groups. Included groups benefit from larger groups GC that perform some of their work. However, large group GCs are longer than smaller ones and therefore retain more floating garbage. For that reason, the authors assume that large group GCs are rare compared to small group GCs. In [8] Lins and Jones combine Weighed Reference Counting with Lins local algorithm for Cyclic Reference Counting [7] to address distribution issues. As a result, they propose a simple algorithm to garbage collect cycles in a distributed environment. The general idea of the algorithm is to perform a ....

Lins, R. D., and Jones, R. Cyclic weighted reference counting. Tech. Rep. TR-95, University of Kent, Computing Labotory Canterbury (England, Mar. 1992.

....Systems While WRC, GRC and IRC elide race conditions (and at the same time reduce the communication overhead) they suffer the same problem as their single address space progenitors: memory leaks due to cycles of garbage. Worse still, the cycles may be inter site, Figure 5. 3.4. 1 Local Tracing Lins and Jones [1991] give an adaptation of the cyclic reference counting schemes of [Martinez et al., 1990; Lins, 1990] to the distributed environment. The algorithm combines WRC [Thomas, 1981; Watson and Watson, 1987; and Bevan, 1987] with Lins [1990] s local mark scan. As with [Martinez et al., 1990] two extra ....

....For a single address space, Lins [1992] had proposed a solution introducing extra state information: the control queue and a fourth colour black. Unfortunately, the use of control queues to perform mark scan lazily applies only to a single process; it is not applicable if messages are delayed. Lins and Jones [1991] attempt to make the algorithm distributed by introducing global synchronisation between the phases of local mark scan on the same processors as well as on different processors. Unfortunately, it is not truly concurrent. Under certain circumstances, it requires that mutation be suspended while the ....

Lins RD and Jones RE (1991) Cyclic Weighted Reference Counting, TR 95, UKC Computing Lab. Report, University of Kent at Canterbury, December 1991.

....might point to live objects, and the associated subgraph would include all such objects. Thus, the scheme does not possess the locality property. Lins et al. proposed such a scheme as cyclic reference counting in a system that used reference counting for local collection instead of local tracing [LJ93] This scheme requires two distributed traces over objects in a subgraph. Jones and Lins improved the scheme such that multiple sites could conduct traces in parallel, but it required global synchronization between sites [JL92] Group Tracing Another method to alleviate the drawbacks of global ....

R. D. Lins and R. E. Jones. Cyclic weighted reference counting. In K. Boyanov, editor, Proc. Workshop on Parallel and Distributed Processing. North Holland, 1993.

....point to live objects, and the associated subgraph would include all such objects. Thus, the scheme does not possess the locality property. Lins et al. proposed such a scheme as cyclic reference counting in a system that used reference counting for local collection instead of local tracing [LJ93] This scheme requires two distributed traces over objects in a subgraph. Jones and Lins improved the scheme such that multiple sites could conduct traces in parallel, but it required global synchronization between sites [JL92] Group Tracing Another method to alleviate the drawbacks of global ....

R. D. Lins and R. E. Jones. Cyclic weighted reference counting. In K. Boyanov, editor, Proc. Workshop on Parallel and Distributed Processing. North Holland, 1993.

....deletion message are needed, it can run on an over taking message system. Figure 2 shows the three needed operations. X X X 512 256 768 1 1 X 1024 1024 indirection cell 1024 512 512 1024 256 256 512 delref copyref copyref Fig. 2. Weighted reference count technique The technique of Lins and Jones [LJ91] cyclic weighted reference counting, solves the problem of reclaiming cycles. They associate a second reference count (SRC, only temporary for mark phase) with each cell. A color is assigned to each cell during garbage collection: red for potential garbage (cyclic) green for live cells, and ....

R. D. Lins and R. E. Jones. Cyclic weighted reference counting. Technical Report 95, University of Kent, Canterbury, United Kingdom, December 1991.

....pointers. 8.4 Garbage Tracing Vestal [Vestal87] suggests selecting objects suspected of being part of a cyclic garbage structure, and on a trial basis decrementing the reference count. If this causes all connected objects counts to drop to zero, then the structure is garbage. Lins and Jones [LJ91] propose combining weighted reference counting with mark and sweep where the marking is not started with roots but with any object that experiences a reference deletion. The reference count is copied and then decremented. If the trace returns to the start then the object is part of a cyclic graph ....

Rafael D. Lins and Richard E. Jones. Cyclic weighted reference counting. Technical Report 95, University of Kent, Canterbury, United Kingdom, December 1991.

....of the object seeded in order to check if descendant s counts drop to zero. For this reason, trial deletion assumes that the main collector is reference counting based. The main difficulty of this technique consist in coming up with a good heuristics to select seed objects. 5. 4 Local Tracing Lins and Jones [1991] have proposed to combine Weighted Reference Counting with mark and sweep in order to collect garbage cycles. The tracing algorithm does not walk the whole distributed graph but from its root, instead traces locally from an object suspected to be part of a garbage cycle. This algorithm looks for a ....

Rafael D. Lins and Richard E. Jones. Cyclic weighted reference counting. Technical Report 95, University of Kent, Canterbury, United Kingdom, December 1991.

..... P n 2 bot del queue bot free list heap root ffl ffl ffl ffl ffl ffl ffl ffl free list ffl ffl ffl ffl ffl ffl ffl Control stack Delete queue The instruction set of each collector should be modified in order to avoid confusion during mark scan. In the distributed architecture presented in [9] there is a broadcast of a suspension message in the processor network when one of the processors starts to mark scan. This condition is largely relaxed further on to allow processors to proceed with computation during mark scan. In the multi processor shared memory architecture presented above ....

R.D.Lins and R.E.Jones. Cyclic weighted reference counting. Technical Report 95, UKC Computing Lab. Report, The University of Kent at Canterbury, December 1991. submitted for publication.

....of communication necessary; Lazy Cyclic Reference Counting [19] extended the standard reference counting algorithm [9] to deal with cyclic structures simply and efficiently in a uni processor environment. David Plainfoss e and Marc Shapiro [28] emphasised that an earlier version of our algorithm [21] was simple but not truly concurrent under certain circumstances, some of the mutators were suspended during garbage collection. Furthermore it was not possible to allow all processing nodes to garbage collect independently and asynchronously. also: Dept.de Inform atica U.F.PE. 50.739 ....

Rafael D. Lins and Richard E. Jones. Cyclic weighted reference counting. Technical Report 95, The University of Kent at Canterbury Computing Laboratory, The University, Canterbury, Kent, December 1991.

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