David S. Wise and Daniel P. Friedman. The one-bit reference count. BIT, 17(3):351--9, 1977. 90  Home/Search   Document Not in Database   Summary   Related Articles   Check

....a count is saturated if the byte is negative. This only allows a count to accurately record up to 127 references. Clark s measurements of LISP programs [Clark, 1979] show that about 97 of list cells have a reference count of 1. This suggests an extreme form of saturation using a single bit count [Friedman and Wise, 1977; Chikayama and Kimura, 1987] A clear bit is used to indicate a single reference to a cell. When a second reference to the cell is created the bit is set. Once set the bit cannot be cleared because, without tracing from the root, it cannot be determined if the cell has more than one reference. To ....

Friedman DP and Wise DS (1977) The one-bit reference count, BIT (17)351-59.

....is negative, allowing the count to record from 0 to 127 references. Clark s measurements of LISP programs (see [Deutsch and Bobrow, 1976; Field and Harrison, 1988] show that about 97 of list cells have a reference count of 1. This suggests an extreme form of saturation using a singlebit count [Friedman and Wise, 1977]. A clear bit is used to indicate a single reference to cell. When a second reference to the cell is created the bit is set. Once set the bit cannot be cleared because it cannot be determined, without great cost, if the cell has more than one reference. To reclaim cells that acquire more than one ....

Friedman DP and Wise DS (1977) The one-bit reference count, BIT (17), 351359.

....of work done by the running program in most systems, but with a lower constant of proportionality. 2.1. 4 Variations on Reference Counting Another optimization of reference counting is to use a very small count field, perhaps only a single bit, to avoid the need for a large field per object [WF77] Given that deferred reference counting avoids the need to continually represent the count of pointers from the stack, a single bit is sufficient for most objects; the minority of objects whose reference counts are not zero or one cannot be reclaimed by the reference counting system, but are ....

David S. Wise and Daniel P. Friedman. The one-bit reference count. BIT, 17(3):351--359, September 1977.

....counts have to be updated (incremented or decremented) only the global reference count and one difference count have to be modified. ffl Difference counts are usually much smaller, often equal to 0. Hence it is easier to use storage saving techniques such as 1 or 2 bits reference counts [DB76, WF77] 6 Related works Our algorithm, like many others, is based on the concept of multi area collection which was pioneered by Bishop [Bis77] Distributed [Hug85, LL86, Rud86, Bev87, Gol89, Der90, Piq91] or fault tolerant [Ves87, Sch89, SGP90] or real time [Bak78, QBQ89, Yua90, Bak91] or concurrent ....

David S. Wise and Daniel P. Friedman. The one-bit reference count. BIT, 17(3):351--359, 1977.

....implementation that became important was our heap management and garbage collection schemes. We used a simple semi space, stop and copy collector, but this was supplemented by a one bit reference count, a mechanism that distinguishes shared and unshared pointers, as suggested by Wise and Friedman [26]. This allows operations to detect operands that have never been shared and can be reused or returned to a free list as soon as they have been used, reducing the frequency of garbage collection. In the case of our application, it was particularly our wish that the enormous amount of data that ....

David S. Wise and Daniel P. Friedman. The one-bit reference count. BIT, 17:351--359, 1977.

....= new Object( The whole point of counting is to reuse space in situ like this Other references inside the reused node will be handled later as they, themselves, are subsequently initialized assigned [22, 26] 5 One bit reference counting. The smallest possible reference count is a single bit [25, 18], also called the multiple reference bit (MRB) 3, 12] Of course, such a count distinguishes between only two values: unique and sticky, or 1 and . The original proposal for 1 bit reference counts [25] located the count at the referenced node. A much better strategy [18] is to place this bit as ....

....26] 5 One bit reference counting. The smallest possible reference count is a single bit [25, 18] also called the multiple reference bit (MRB) 3, 12] Of course, such a count distinguishes between only two values: unique and sticky, or 1 and . The original proposal for 1 bit reference counts [25] located the count at the referenced node. A much better strategy [18] is to place this bit as a tag on each reference to the node illustrated in the first two sketches of Figure 1 rather than at the node, itself. Although this needs another MRB bit in every reference, it saves the random ....

D. S. Wise & D. P. Friedman. The one-bit reference count. BIT 17, 3 (September 1977), 351--359.

....new Object( The whole point of counting is to reuse space in situ like this Other references inside the reused node will be handled later as they, themselves, are subsequently initialized assigned [24, 28] 5 One bit reference counting. The smallest possible reference count is a single bit [27, 20], also called the multiple reference bit (MRB) 4, 13] Of course, twoRef registers twoRef registers twoRef registers S U U U S S Figure 1: One bit tag for reference counting: UNIQUE, STICKY, and cached count of two. such a count distinguishes between only two values: UNIQUE and STICKY, or 1 ....

....Of course, twoRef registers twoRef registers twoRef registers S U U U S S Figure 1: One bit tag for reference counting: UNIQUE, STICKY, and cached count of two. such a count distinguishes between only two values: UNIQUE and STICKY, or 1 and . The original proposal for 1 bit reference counts [27] located the count at the referenced node. A much better strategy [20] is to place this bit as a tag on each reference to the node illustrated in the first two sketches of Figure 1 rather than at the node, itself. Although this needs another MRB bit in every reference, it saves the random ....

[Article contains additional citation context not shown here]

D. S. Wise & D. P. Friedman. The one-bit reference count. BIT 17, 3 (September 1977), 351--359.

....reference count field is only a single bit, whose value can only represent uniquely referenced or shared. The terms unique and sticky will be associated with these two alternatives, which are indicated as u fl and s fl in the figures. The first proposal for one bit reference counting [31] only addresses the need to save space for the counter; it uses the mark bit, already in every node, as a reference count between garbage collections. The second formulation [24] is far superior. It has since been rediscovered [9] and developed [18, 23, 19] in logic programming, where it is called ....

D.S. Wise & D.P. Friedman. The one-bit reference count. BIT 17, 3 (September 1977), 351--359.

No context found.

David S. Wise and Daniel P. Friedman. The one-bit reference count. BIT, 17(3):351--9, 1977. 90

No context found.

Wise, D.S., and Friedman, D.P. "The One-Bit Reference Count". BIT 17 (1977),351-359.

No context found.

Wise, D.S., and Friedman, D.P. "The one-bit reference count". BIT 17,3 (Sept. 1977), 351-359.

No context found.

Wise, D.S., and Friedman, D.P. "The one-bit reference count". BIT 17,3 (Sept. 1977),351-359.

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