Author of the publication

Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting.

, , , and . IEEE Trans. Parallel Distrib. Syst., 20 (8): 1173-1187 (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Sundell, Håkan
add a person with the name Sundell, Håkan
 

Other publications of authors with the same name

Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting., , , and . IEEE Trans. Parallel Distrib. Syst., 20 (8): 1173-1187 (2009)Scalable and lock-free concurrent dictionaries., and . SAC, page 1438-1445. ACM, (2004)Practical and Lock-Free Doubly Linked Lists., and . PDPTA, page 264-270. CSREA Press, (2007)Venn predictors for well-calibrated probability estimation trees., , , , , and . COPA, volume 91 of Proceedings of Machine Learning Research, page 3-14. PMLR, (2018)Fast and Lock-Free Concurrent Priority Queues for Multi-Thread Systems., and . IPDPS, page 84. IEEE Computer Society, (2003)Cache-Aware Lock-Free Queues for Multiple Producers/Consumers and Weak Memory Consistency., , and . OPODIS, volume 6490 of Lecture Notes in Computer Science, page 302-317. Springer, (2010)Lock-free Concurrent Data Structures, , , , , and . CoRR, (2013)Wait-Free Reference Counting and Memory Management.. IPDPS, IEEE Computer Society, (2005)NOBLE: non-blocking programming support via lock-free shared abstract data types., and . SIGARCH Computer Architecture News, 36 (5): 80-87 (2008)A lock-free algorithm for concurrent bags., , , and . SPAA, page 335-344. ACM, (2011)