Durable algorithms for writable LL/SC and CAS with dynamic joining
VERLIB: Concurrent Versioned Pointers
Recent work has shown how to augment any CAS-based concurrent data structure to
support taking a snapshot of the current memory state. Taking the snapshot, as well as loads …
support taking a snapshot of the current memory state. Taking the snapshot, as well as loads …
Declarative linearizability proofs for descriptor-based concurrent hel** algorithms
J Domínguez, A Nanevski - arxiv preprint arxiv:2307.04653, 2023 - arxiv.org
Linearizability is a standard correctness criterion for concurrent algorithms, typically proved
by establishing the algorithms' linearization points. However, relying on linearization points …
by establishing the algorithms' linearization points. However, relying on linearization points …
Efficient randomized DCAS
Double Compare-And-Swap (DCAS) is a tremendously useful synchronization primitive,
which is also notoriously difficult to implement efficiently from objects that are provided by …
which is also notoriously difficult to implement efficiently from objects that are provided by …
Findex: A Concurrent and Database-Independent Searchable Encryption Scheme
T Brézot, C Hébant - Cryptology ePrint Archive, 2024 - eprint.iacr.org
State-of-the-art database implementations offer a wide range of functionalities and
impressive performances while supporting highly concurrent loads. However they all rely on …
impressive performances while supporting highly concurrent loads. However they all rely on …
Separating Mechanism from Policy in STM
When designing concurrent data structures (CDSs), it can feel like programmers must
choose between performance and convenience. On one hand, Software Transactional …
choose between performance and convenience. On one hand, Software Transactional …