Content deleted Content added
m Dating maintenance tags: {{Cleanup HTML}} |
<tt> → <code> |
||
Line 1:
{{Use dmy dates|date=August 2012}}
{{More citations needed|date=October 2015}}
In [[computer science]], '''reference counting''' is a technique of storing the number of [[Reference (computer science)|references]], [[Pointer (computer programming)|pointers]], or [[Handle (computing)|handles]] to a resource such as an object, block of memory, disk space or other resource.
Line 83 ⟶ 82:
| volume = 28
| citeseerx = 10.1.1.15.9106
}}</ref> They introduce the '''update coalescing method''' which coalesces many of the redundant reference count updates. Consider a pointer that in a given interval of the execution is updated several times. It first points to an object <
Levanoni and Petrank showed in 2001 how to use such update coalescing in a reference counting collector. When using update coalescing with an appropriate treatment of new objects, more than 99% of the counter updates are eliminated for typical Java benchmarks. In addition, the need for [[atomic operations]] during pointer updates on parallel processors is eliminated. Finally, they presented an enhanced algorithm that may run concurrently with multithreaded applications employing only fine synchronization.<ref>{{cite web|url=http://www.cs.technion.ac.il/%7Eerez/Papers/refcount.pdf |title=An On-the-Fly Reference-Counting Garbage Collector for Java |website=Cs.technion.ac.il |accessdate=2017-06-24}}</ref>
|