Rafael D Lins. Generational cyclic reference counting. Technical Report 22-92, Computing Laboratory, University of Kent, September 1992.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....list, the control queue and the root cells set black. When the allocator is unable to supply memory, the control queue is scanned to reclaim possible garbage cycles. Lins and Vasques [1991] found that, with appropriate management of the control queue, no unnecessary calls to mark scan are made. Lins [1992] applies the concept of the cell age, from generation scavenging, to the problem of cyclic reference counting. A second counter records the age of cells. A global time counter is initialised to zero and is incremented every time a cell is allocated from the free list. Lins profits from the age ....

....to detect cycles. As in Section 2.4, a local mark scan is performed whenever a reference to a shared subgraph is deleted. The algorithm has the same problem as its progenitor: the need to perform a local mark scan every time a reference to a shared subgraph is deleted. 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 ....

[Article contains additional citation context not shown here]

Lins RD (1992) Generational Cyclic Reference Counting, TR 22-92 UKC Computing Lab, University of Kent at Canterbury.

No context found.

Rafael D Lins. Generational cyclic reference counting. Technical Report 22-92, Computing Laboratory, University of Kent, September 1992.

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