Sciweavers

Share
14 search results - page 1 / 3
» Wait-Free Reference Counting and Memory Management
Sort
View
PODC
1993
ACM
10 years 1 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
TACAS
2009
Springer
131views Algorithms» more  TACAS 2009»
10 years 4 months ago
Verifying Reference Counting Implementations
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
Michael Emmi, Ranjit Jhala, Eddie Kohler, Rupak Ma...
IPL
2008
114views more  IPL 2008»
9 years 9 months ago
Cyclic reference counting
: Reference Counting is the memory management technique of most widespread use today. Very often applications handle objects that are either permanent or get tenured. This paper us...
Rafael Dueire Lins
JUCS
2007
122views more  JUCS 2007»
9 years 9 months ago
A New Architecture for Concurrent Lazy Cyclic Reference Counting on Multi-Processor Systems
: Multi-processor systems have become the standard in current computer architectures. Software developers have the possibility to take advantage of the additional computing power a...
Andrei de Araújo Formiga, Rafael Dueire Lin...
books