D. S. Wise. Stop-and-copy and one-bit reference counting. Technical Report 360, Indiana University,1992. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Three-Register Garbage Recycler, or Nodes for Free - Wise (1998) Self-citation (Wise) (Correct)
....amortized cost of off line, uniprocessor collection. In hybrid systems garbage collection remains important to the algorithms below, where reference counting and garbage collection complement each other in several ways. Garbage collection is used behind reference counting after cyclic structures [17, 24, 26] leak away space, or after too small counters get stuck [4, 8] Similarly, any counting that postpones garbage collection at the cost of a few local transactions makes collection more suitable to real time and parallel performance; it improves the amortized cost of memory cycles per allocated node ....
....needs another MRB bit in every reference, it saves the random fetch whenever that count is inspected. The reference count on any node (e.g. referenced by p above) is known as soon as it becomes accessible, allowing it to be recycled without even touching it. Moreover, a recopying garbage collector [24] can easily correct sticky tags back to unique. The idea is that each newly marked node remembers the source of its first reference, as well as its unique forwarding address. A second reference will update to sticky the first, already forwarded, reference, as well as the forwarding address. ....
D. S. Wise. Stop-and-copy and one-bit reference counting. Information Processing Lett. 46, 5 (July 1993), 243--249. Also ftp://ftp.cs.indiana.edu/pub/techreports/TR360.ps.Z
One-bit Counts between Unique and Sticky - Roth, Wise (1998) (4 citations) Self-citation (Wise) (Correct)
....locality available from on line reference counting. In hybrid systems garbage collection remains important to the algorithms below, where reference counting and garbage collection complement each other in several ways. Garbage collection is used behind reference counting after cyclic structures [19, 26, 28] leak away space, or after too small counters get stuck [5, 9] Similarly, any counting that postpones garbage collection at the cost of a few local transactions makes collection more suitable to real time and parallel performance; it improves the amortized cost of memorycycles per allocated node ....
....needs another MRB bit in every reference, it saves the random fetch whenever that count is inspected. The reference count on any node (e.g. referenced by p above) is known as soon as it becomes accessible, allowing it to be recycled without even touching it. Moreover, a recopying garbage collector [26] can easily correct STICKY tags back to UNIQUE. The idea is that each newly marked node remembers the source of its first (original) reference along with its UNIQUE forwarding address. Any second reference updates the forwarding address to be STICKY and also overwrites it at the original ....
D. S. Wise. Stop-and-copy and one-bit reference counting. Inf. Process. Lett. 46, 5 (July 1993), 243--249. Also ftp://ftp.cs.indiana.edu/pub/techreports/TR360.ps.Z
Static and Dynamic Partitioning of Pointers as Links and Threads - Wise, Walgenbach (1996) Self-citation (Wise) (Correct)
....does; see Section 4. Another is to extend the pointer function to one in N Theta L N Theta T so every pointer carries a tag; this corresponds to dynamic tagging of an attribute at run time. Definition 8 [7] The reference count of a node is the number of links absorbed by it. Definition 9 [27] A link is unique when its destination has a reference count known to be one. Otherwise, it is sticky. The term sticky is borrowed from the convention of fitting a static infinity into the range of reference counts [5] whence neither increments nor decrements change it. But a full garbage ....
....when its destination has a reference count known to be one. Otherwise, it is sticky. The term sticky is borrowed from the convention of fitting a static infinity into the range of reference counts [5] whence neither increments nor decrements change it. But a full garbage collection might [24, 27]. A reference count can be both one and sticky, after an imperfect counting protocol loses the precise count on a node and no longer knows it. Convention Roots emit only links. Definition 10 A node is accessible if it absorbs a link from a root or an accessible node. Invariant 1 Accessible ....
[Article contains additional citation context not shown here]
D. S. Wise. Stop-and-copy and one-bit reference counting. Inform. Proc. Ltrs. 46, 5 (July 1993), 243--249.
Dynamic Language - Parallelization By Requirements (Correct)
No context found.
D. S. Wise. Stop-and-copy and one-bit reference counting. Technical Report 360, Indiana University,1992.
the Garbage Collection Bibliography - Richard Jones (2003) (Correct)
No context found.
David S. Wise. Stop-and-copy and one-bit reference counting. Information Processing Letters, 46(5):243--249, July 1993.
the Garbage Collection Bibliography - Richard Jones (2003) (Correct)
No context found.
David S. Wise. Stop-and-copy and one-bit reference counting. Technical Report 360, Indiana University, Computer Science Department, March 1993.
Minimizing Reference Count Updating with Deferred and Anchored.. - Baker (1994) (2 citations) (Correct)
No context found.
Wise, D.S. "Stop-and-copy and One-bit Reference Counting". TR-360, Indiana U., Bloomington, IN, Oct. 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