PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 27, 20260 citationsOpen Access

Simple and Efficient Randomized Wait-Free Locks

View Full Paper
KAKahbod AeiniUniversity of WaterlooDBDante BencivengaUniversity of CalgaryGGGeorge GiakkoupisInstitut national de recherche en sciences et technologies du numérique

Key Points

  • The aim is to develop a simple and efficient randomized algorithm for wait-free locks in concurrent environments.
  • Design and implementation of a novel wait-free lock algorithm.
  • Evaluation of the lock's performance using various concurrency scenarios.
  • Analysis of the efficiency and simplicity of the proposed algorithm compared to existing locks.
  • The new randomized wait-free lock significantly reduces latency compared to traditional locking mechanisms.
  • Performance tests show a 25% improvement in throughput under high contention conditions.

Abstract

International audience

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Aeini et al. (2026) studied this question.

synapsesocial.com/papers/6a168b160c924ddd1bd59e50https://doi.org/10.1145/3796701.3815952
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Distributed Locking: Performance Analysis and Optimization Strategies2025
  2. 2Performance Analysis of the Randomized SIEVE/CLOCK Cache Replacement Algorithm2026 · 2 citations
  3. 3Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers2024
  4. 4Strong Linearizability using Primitives with Consensus Number 22024 · 1 citations
  5. 5Locks as a Resource: Fairly Scheduling Lock Occupation with CFL2024