Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

52

IPPS
2005
IEEE

favoriteEmaildiscussreport

70views Distributed And Parallel Com...» more IPPS 2005»

Wait-Free Reference Counting and Memory Management

15 years 3 months ago

Wait-Free Reference Counting and Memory Management

Download www.non-blocking.com

Håkan Sundell

Real-time Traffic

Distributed And Parallel Computing | IPPS 2005 |

claim paper

Related Content

» A Lower Bound on WaitFree Counting

» Cyclic reference counting

» Verifying Reference Counting Implementations

» A New Architecture for Concurrent Lazy Cyclic Reference Counting on MultiProcessor Systems

» Using Prefetching to Improve ReferenceCounting Garbage Collectors

» Declarative aspects of memory management in the concurrent collections parallel programmin...

» Experience with safe manual memorymanagement in cyclone

» Statically Inferring Complex Heap Array and Numeric Invariants

» Interreference gap distribution replacement an improved replacement algorithm for setassoc...

Post Info
More Details (n/a)

Added	25 Jun 2010
Updated	25 Jun 2010
Type	Conference
Year	2005
Where	IPPS
Authors	Håkan Sundell

Comments (0)