Lock-free search data structures: throughput modeling with Poisson processes

DOI10.4230/LIPICS.OPODIS.2018.9MaRDI QIDQ5091080zbMATH OpenFDO

Authors Aras Atalar, Paul Renaud-Goud, Philippas Tsigas

Publication date 21 July 2022

Full work available at URL https://arxiv.org/abs/1805.04794

zbMATH Keywords

performancemodelinganalysislock-freesearch data structures

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Recommendations

• Analyzing the performance of lock-free data structures: a conflict-based model
• How lock-free data structures perform in dynamic environments: models and analyses
• Efficient lock-free binary search trees

Cites work

• scientific article; zbMATH DE number 2006660 (Why is no real title available?)
• scientific article; zbMATH DE number 2079386 (Why is no real title available?)
• A Proof for the Queuing Formula: L = λW
• A note on the height of binary search trees
• Algorithms adapting to point contention
• Analyzing contention and backoff in asynchronous shared memory
• Analyzing the performance of lock-free data structures: a conflict-based model
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Contention in shared memory algorithms
• Fast and lock-free concurrent priority queues for multi-thread systems
• How lock-free data structures perform in dynamic environments: models and analyses
• Randomized search trees
• Removing logarithms from Poisson process error bounds.
• Stein's method and point process approximation

This page was built for publication: Lock-free search data structures: throughput modeling with Poisson processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091080)