A. D. Martinez, R. Wachenchauzer, and Rafael D. Lins. Cyclic reference counting with local mark-scan. Information Processing Letters, 34:31--35, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Christopher [4] designed a simple partial mark sweep algorithm wherein a mark sweep collector is invoked to reclaim the cycles missed by reference counting. Lins [8] created a hybrid reference counting mark sweep algorithm which is O(n ) in the worst case, based on an algorithm of Martinez [10]. Bacon et al. 1] designed an O(V E) variant of the Lin s algorithm for the IBM Jalape no Java Virtual Machine. This was further improved upon by Lins in [9] which contains an ecient general reference counting algorithm. In contrast to our algorithm, these algorithms require varying amounts of ....

A. D. Martinez, R. Wachenchauzer, and Rafael D. Lins. Cyclic reference counting with local mark-scan. Information Processing Letters, 34:31-35, 1990.

....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 ....

A.D. Martinez, R. Wachenchauzer, and Rafael D. Lins. Cyclic reference counting with local mark-scan. Information Processing Letters, 34:31-- 35, 1990.

....are acyclic. However, in the presence of dynamic class loading our more restrictive formulation must be used, since an acyclic class could later be subclassed with a cyclic class. For those objects that are potentially cyclic, we use a variant of the coloring algorithm proposed by Mart nez et al. [19] and extended by Lins [17] An excellent description of the Black Purple White Gray Green DF FOLF#QHZ GHF### LQF GHF # PDUN GHF # LQF##GHF##XQVFDQ GHF# ## LQF LQF##GHF### VFDQ PDUN LQF##GHF# XQVFDQ##IUHH Orange FROOHFW GHF### Figure 2: State transition graph for cycle ....

....The result is a simpler algorithm without the additional storage or scanning required by the ZCT, albeit at the expense of additional bu er space. 8. 2 Cycle Collection As described in Section 3, our cycle collection algorithm is derived from the synchronous algorithm devised by Mart nez et al. [19] and extended by Lins to lazily scan for cyclic garbage [17, 14] Our synchronous variant di ers in a number of important respects: its complexity is linear rather than quadratic; it avoids placing a root in the root bu er more than once per epoch; and it greatly reduces overhead by not ....

Mart nez, A. D., Wachenchauzer, R., and Lins, R. D. Cyclic reference counting with local mark-scan. Inf. Process. Lett. 34, 1 (1990), 31-35.

.... collectors has fallen into three categories: special programming idioms, like Bobrow s groups [4] or certain functional programming styles; use of an infrequently invoked tracing collector to collect cyclic garbage [6] or searching for garbage cycles by removing internal reference counts [19, 17]. An excellent summary of the techniques and algorithms is in chapter 3 ( Reference Counting ) of the book by Jones and Lins [14] Our synchronous cycle collection algorithm is based on the work Mart nez et al. [19] as extended by Lins [17] which is very clearly explained in the chapter of the ....

.... [6] or searching for garbage cycles by removing internal reference counts [19, 17] An excellent summary of the techniques and algorithms is in chapter 3 ( Reference Counting ) of the book by Jones and Lins [14] Our synchronous cycle collection algorithm is based on the work Mart nez et al. [19] as extended by Lins [17] which is very clearly explained in the chapter of the book just mentioned. There are two properties that are fundamental to these algorithms. The rst property is that garbage cycles can only be created when a reference count is decremented to a non zero value if the ....

Mart nez, A. D., Wachenchauzer, R., and Lins, R. D. Cyclic reference counting with local mark-scan. Inf. Process. Lett. 34, 1 (1990), 31-35.

....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 ....

A.D. Martinez, R. Wachenchauzer, and Rafael D. Lins. Cyclic reference counting with local mark-scan. Information Processing Letters, 34:31--35, 1990.

....the algorithm is therefore simpler. The primary disadvantages over other techniques such as [3] are computational expense and inability to collect cycles (though both of these can be extenuated, for example through the use of deferred counting mechanisms [11, 13] and cyclecollection extensions [14, 24, 22, 21]) Whilst we aim to achieve acceptable performance with the same worst case bounds that we require of the allocator, we leave the collection of cycles to further work (the aim of this paper is to present the allocator, not the collector ) Similarly, though there are interesting similarities ....

A. D. Martinez, R. Wachenchauzer, and Rafael D. Lins. Cyclic reference counting with local mark-scan. Information Processing Letters, 34:31--35, 1990.

....be specified using temporal logic and process algebras. The verification of such algorithms is an area of ongoing research. This paper starts by examining those simpler algorithms upon which the CWRC has been built, namely standard recursive marking [McCarthy, 1960] and Cyclic Reference Counting [Martinez et al. 1990; Lins, 1990] In Section 2 we consider garbage collection from an abstract point of view. These abstract requirements are formally described in temporal logic. Two specifications in CCS are then given, each involving different amounts of parallelism. In Section 2 we present the Cyclic Reference ....

....pointer is shared then it may be part of an isolated, and hence garbage, cycle. In the lazy algorithm [Lins, 1990] a reference to the cell is placed on a control queue but no further action is taken until either the free list becomes empty or the control queue is full. In the original algorithm [Martinez et al. 1990], the cell is examined immediately to determine whether it is garbage. In either case, cells in the transitive closure of this cell are eventually marked and scanned to find any references from cells external to this subgraph. If none are found the subgraph is garbage and is returned to the ....

A.D. Martinez, R. Wachenchauzer, and Rafael D. Lins. Cyclic reference counting with local mark-scan. Information Processing Letters, 34:31--35, 1990.

....with two aims: to speed up the performance of the architecture and to analyse the process of parallelising a sequential algorithm. As an alternative to mark scan algorithms Lins presents a shared memory architecture for parallel cyclic reference counting [8] based on the algorithm presented in [10]. In this paper we generalise this architecture in such a way that multiple mutators and collectors share the same workspace. This generalisation is simple and keeps the properties of the one mutator one collector architecture [8] 1 A Shared Memory Architecture In this section we describe the ....

....algorithm presented in [2] with the addition of some synchronisation elements. This was exactly the strategy adopted by the author in the development of his one mutator one collector shared memory architecture [8] which was based on the sequential algorithms for uniprocessors presented in [10, 7]. The architectures presented herein also follow the same philosophy: we parallelise the original mutator algorithm and then we apply the same technique to the collector algorithm. The Multi Mutator Architecture The existence of a partial ordering on the synchronisation of mutator operations is ....

A.D.Martinez, R.Wachenchauzer and R.D.Lins. Cyclic reference counting with local mark-scan. Information Processing Letters, 34:31--35, 1990.

....data structures. For the sequential domain, Friedman Wise [8] Bobrow [4] and Hughes [13] have solved this problem in the context of implementing Lisp and functional languages such as Miranda. A general uniprocessor algorithm for cyclic reference counting with local mark scan was presented in [19] and substantially improved in [17] Two algorithms made standard reference counting suitable for use in loosely coupled multiprocessor architectures: weighted reference counting [3, 24] and generational reference counting [9] However , as in sequential standard reference counting, these both ....

....is presented. This algorithm allows processors to run local mark scan simultaneously without any need of synchronisation between phases of different local mark scans either on the same processor or on different processors. It incorporates both, the correct management of cyclic data structures [19] and the improvement of lazy mark scan [17] As shown in [17] lazy mark scan evaluation can considerably reduce the garbage collection overhead by avoiding unnecessary local mark scans. We concentrate on the distributed computing issues of the algorithm without taki ng into account the choice of ....

A.D.Martinez, R.Wachenchauzer and R.D.Lins. Cyclic reference counting with local mark-scan. Information Processing Letters, 34:31--35, 1990.

....The chief drawback to both these methods is their inability to deal with cyclic structures. Lins algorithms, which we examine next, provide a sequential solution to this problem. 3 Lazy Cyclic Reference Counting A promising scheme for uni processors has been developed by Lins and his colleagues [23]. Its most sophisticated form, the Lazy Cyclic Reference Counting algorithm, combines reference counting with lazy four colour mark scan garbage collection [19] The New and Copy operations are similar to those of the standard reference counting algorithm, as is the deletion of the last reference ....

.... RC(S) RC(S) Weight( R,S ) if RC(S) 0 for T in Sons(S) send MessageDelete( S,T ) to T green(S) free(S) else insert(S, controlset) Mark scan When a pointer to a shared object is deleted, a reference to the target is added to the control set rather than being mark scanned immediately (as in [23]) Lins idea was to use the control queue to delay the mark scan in the hope that it will prove unnecessary to garbage collect the cell and its subgraph: either its last reference will have been deleted or another call to scangreen will prove that it is still active. This approach has proved ....

A.D. Martinez, R. Wachenchauzer, and Rafael D. Lins. Cyclic reference counting with local markscan. Information Processing Letters, 34:31--35, 1990.

....of the RC field of the cells involved. Reference counting has the major advantage of being performed in small steps interleaved with computation. The disadvantage of the simple algorithm for reference counting is the inability to reclaim cyclic structures. To solve this problem, reference [8] presents a simple reference counting garbage collection algorithm for cyclic data structures, which works as a natural extension of the standard reference counting algorithm. Deletion of a pointer to a shared structure increases the complexity of the local mark scan to O(n) where n is the size ....

....the likelihood of running mark scan on garbage cells. We also use the age information as a way of detecting the existence of cycles during the mark phase. This information allows the algorithm to perform the scan phase more efficiently. The Lazy Mark Scan Algorithm The algorithm presented in [8] performs a local mark scan whenever a pointer to a shared structure is deleted. It works in three phases. In the first phase, the graph below the deleted pointer is traversed, counts due to internal references are decremented and nodes are marked as possible garbage. In phase two, the subgraph is ....

A.D.Martinez, R.Wachenchauzer and R.D.Lins. Cyclic reference counting with local mark-scan. Information Processing Letters, 34:31--35, 1990.

....steps interleaved with computation. The disadvantage of the simple algorithm for reference counting is the inability to reclaim cyclic structures. To solve this problem, a mixture of mark scan and reference counting has been used. See [1] for a detailed analysis of these algorithms. Reference [5] presents a simple reference counting garbage collection algorithm for cyclic data structures, which works as a natural extension of the standard reference counting algorithm. The cost of this algorithm may be extremely low. Deletion of a pointer to a shared structure increases the complexity of ....

....required. Our performance figures show that lazy mark scan is far more efficient than local mark scan. The algorithm presented here is the kernel of the shared memory architectures for parallel cyclic reference counting described in [2, 3] The Local Mark Scan Algorithm The algorithm presented in [5] performs a local mark scan whenever a pointer to a shared structure is deleted. It works in three phases. In the first phase, the graph below the deleted pointer is traversed, counts due to internal references are decremented and nodes are marked as possible garbage. In phase two, the subgraph is ....

[Article contains additional citation context not shown here]

A.D.Martinez, R.Wachenchauzer and R.D.Lins. Cyclic reference counting with local mark-scan. Information Processing Letters, 34:31--35, 1990.

No context found.

A. D. Martinez, R. Wachenchauzer, and Rafael D. Lins. Cyclic reference counting with local mark-scan. Information Processing Letters, 34:31--35, 1990.

No context found.

A. D. Martinez, R. Wachenchauzer, and Rafael D. Lins. Cyclic reference counting with local mark-scan. Information Processing Letters, 34:31--35, 1990.

No context found.

A. D. Martinez, R. Wachenchauzer, and Rafael D. Lins. Cyclic reference counting with local mark-scan. Information Processing Letters, 34:31--35, 1990.

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