ROTH, D. J., AND WISE, D. S. One-bit counts between unique and sticky. In ISMM'98 [19], pp. 49--56.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....paper [28] 1.4 Cycle collection A major disadvantage of reference counting is that it does not collect cycles. We have chosen to collect cycles with an on the y mark and sweep collector. The Mark and sweep algorithm is run seldom to collect cycles and restore stuck reference counts. Like in [33, 42, 38, 8, 8], we use only two bits for the reference count and thus, stuck counters are created on the y, and are restored by the mark and sweep algorithm. We use a novel on the y mark and sweep collector that we have designed especially for our reference counting algorithm. Note that it is quite natural ....

....the delay introduced by recursive deletion. Deutsch and Bobrow [14] eliminated the need for a write barrier on local references (in stack and registers) This method was later adapted for Modula 2 [12] Further study on reducing work for local variables can be found in [6] and [31] Several works [33, 42, 38, 8, 8] use a single bit for each reference counter with a mechanism to handle over ows. The idea being that most objects are singly referenced, except for the duration of short transitions. DeTreville [12] describes a concurrent multiprocessor reference counting collector for Modula 2 . This algorithm ....

David J. Roth and David S. Wise. One-bit counts between unique and sticky. ACM SIGPLAN Notices, pages 49-56, October 1998. ACM Press.

....associated with pointer manipulation in order to maintain the reference count invariant and the inability to reclaim cyclic datastructures. The space overhead issue is ameliorated by the fact that a two bit heap reference count field is more than enough in the striking majority of cases (c.f. [11, 27, 32, 6, 18]) While the computational overhead is reduced by some 80 using Dutsch and Bobrow s Deferred Reference Counting [11] Only the inability to reclaim cyclic structures does not have a satisfactory solution intrinsic to reference counting [31, 21] and therefore reference counting systems are usually ....

....the delay introduced by recursive deletion. Deutsch and Bobrow [11] eliminated the need for a write barrier on local references (in stack and registers) This method was later adapted for Modula 2 [9] Further study on reducing work for local variables can be found in [4] and [26] Several works [27, 33, 28, 6, 6] use a single bit for each reference counter with a mechanism to handle overflows. The idea being that most objects are singly referenced, except for the duration of short transitions. DeTreville describes in [9] a concurrent multiprocessor reference counting collector for Modula 2 . This ....

David J. Roth and David S. Wise. One-bit counts between unique and sticky. In Richard Jones, editor, Proceedings of the First International Symposium on Memory Management, volume 34(3) of ACM SIGPLAN Notices, pages 49--56, Vancouver, October 1998. ACM Press. ISMM is the successor to the IWMM series of workshops.

No context found.

ROTH, D. J., AND WISE, D. S. One-bit counts between unique and sticky. In ISMM'98 [19], pp. 49--56.

No context found.

David J. Roth and David S. Wise. One-bit counts between unique and sticky. ACM SIGPLAN Notices, pages 49-56, October 1998. ACM Press.

No context found.

David J. Roth and David S. Wise. One-bit counts between unique and sticky. ACM SIGPLAN Notices, pages 49-56, October 1998. ACM Press.

No context found.

David J. Roth and David S. Wise. One-bit counts between unique and sticky. In Jones [Jones1998], pages 49--56.

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