Strata: wait-free synchronization with efficient memory reclamation by using chronological memory allocation

Authors:
Eunhwan Shin;Inhyuk Kim;Junghan Kim;Young Ik Eom
Affiliations:
School of Information and Communication Eng., Sungkyunkwan University, Suwon, Gyeonggi-do, Korea;School of Information and Communication Eng., Sungkyunkwan University, Suwon, Gyeonggi-do, Korea;School of Information and Communication Eng., Sungkyunkwan University, Suwon, Gyeonggi-do, Korea;School of Information and Communication Eng., Sungkyunkwan University, Suwon, Gyeonggi-do, Korea
Venue:
ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V
Year:
2011

Citing 7
Cited 0

Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Lock-free reference counting

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Nonblocking synchronization and system design

Nonblocking synchronization and system design
Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects

IEEE Transactions on Parallel and Distributed Systems
Wait-Free Reference Counting and Memory Management

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Making lockless synchronization fast: performance implications of memory reclamation

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
User-Level Implementations of Read-Copy Update

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A locking is the typical mechanism to coordinate the race between multiple threads. But it downgrades the overall system performance due to the waiting time for the locked data to be unlocked. Wait-free synchronization is the one of the schemes to cope with the locking cost. The basic idea is making a replica of the shared data in order to manipulate it, and then applying the updated data. Due to the allocation of replicas without waiting, the most cost consuming step of wait-free synchronization is the reclamation of memory. This paper presents strata, a wait-free synchronization scheme with efficient memory reclamation. It allocates memory in the chronological order for efficient reclamation, and guarantees both update and read side wait-free in O(1) execution time.