Everything you always wanted to know about synchronization but were afraid to ask
This paper presents the most exhaustive study of synchronization to date. We span multiple
layers, from hardware cache-coherence protocols up to high-level concurrent software. We …
layers, from hardware cache-coherence protocols up to high-level concurrent software. We …
More than you ever wanted to know about synchronization: Synchrobench, measuring the impact of the synchronization on concurrent algorithms
V Gramoli - Proceedings of the 20th ACM SIGPLAN Symposium on …, 2015 - dl.acm.org
In this paper, we present the most extensive comparison of synchronization techniques. We
evaluate 5 different synchronization techniques through a series of 31 data structure …
evaluate 5 different synchronization techniques through a series of 31 data structure …
Corundum: Statically-enforced persistent memory safety
M Hoseinzadeh, S Swanson - Proceedings of the 26th ACM International …, 2021 - dl.acm.org
Fast, byte-addressable, persistent main memories (PM) make it possible to build complex
data structures that can survive system failures. Programming for PM is challenging, not …
data structures that can survive system failures. Programming for PM is challenging, not …
PIM-STM: Software Transactional Memory for Processing-In-Memory Systems
Processing-In-Memory (PIM) is a novel approach that augments existing DRAM memory
chips with lightweight logic. By allowing to offload computations to the PIM system, this …
chips with lightweight logic. By allowing to offload computations to the PIM system, this …
Communication-efficient randomized consensus
We consider the problem of consensus in the challenging classic model. In this model, the
adversary is adaptive; it can choose which processors crash at any point during the course …
adversary is adaptive; it can choose which processors crash at any point during the course …
Democratizing transactional programming
V Gramoli, R Guerraoui - Communications of the ACM, 2014 - dl.acm.org
Democratizing transactional programming Page 1 contributed articles 86 communIcaTIonS of
The acm | jANuARY 2014 | vol. 57 | No. 1 tHe tranSactIon aBStractIon encapsulates the …
The acm | jANuARY 2014 | vol. 57 | No. 1 tHe tranSactIon aBStractIon encapsulates the …
2plsf: Two-phase locking with starvation-freedom
P Ramalhete, A Correia, P Felber - … of the 28th ACM SIGPLAN Annual …, 2023 - dl.acm.org
Invented more than 40 years ago, the two-phase locking concurrency control (2PL) is
capable of providing opaque transactions over multiple records. However, classic 2PL can …
capable of providing opaque transactions over multiple records. However, classic 2PL can …
Leveraging hardware message passing for efficient thread synchronization
As the level of parallelism in manycore processors keeps increasing, providing efficient
mechanisms for thread synchronization in concurrent programs is becoming a major …
mechanisms for thread synchronization in concurrent programs is becoming a major …
Directory protocols for distributed transactional memory
Distributed directory protocols for shared objects play an important role in providing access
to higher level abstractions like transactional memory. They offer primitives to retrieve data …
to higher level abstractions like transactional memory. They offer primitives to retrieve data …
Scaling Up Transactions with Slower Clocks
P Ramalhete, A Correia - Proceedings of the 29th ACM SIGPLAN …, 2024 - dl.acm.org
Concurrency controls with optimistic read accesses and pessimistic write accesses are
among the fastest in the literature. However, during write transactions these algorithms need …
among the fastest in the literature. However, during write transactions these algorithms need …