Characterizing the performance of algorithms for lock-free objects

DOI10.1109/12.467694MaRDI QIDQ4421167zbMATH OpenOpenAlexFDO

Authors Theodore Johnson

Publication date 1995

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/8ed12007b2134a4f057f41a85d9031442afdd043

zbMATH Keywords

concurrency control protocollock-free concurrency control algorithms

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Nonnumerical algorithms (68W05)

Recommendations

• Analyzing the performance of lock-free data structures: a conflict-based model
• Computer Aided Verification
• How lock-free data structures perform in dynamic environments: models and analyses

Cited in

(14)

• Supporting lock-free synchronization in Pfair-scheduled real-time systems
• Exclusion requirements and potential concurrency for composite objects
• Reuse, don't recycle: transforming lock-free algorithms that throw away descriptors
• Brief announcement: Performance prediction for coarse-grained locking
• Scalable hierarchical locking for distributed systems
• Lock coarsening: Eliminating lock overhead in automatically parallelized object-based programs
• scientific article; zbMATH DE number 2013841 (Why is no real title available?)
• Performance of memory reclamation for lockless synchronization
• Performance issues in non-blocking synchronization on shared-memory multiprocessors
• How lock-free data structures perform in dynamic environments: models and analyses
• Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
• Analyzing the performance of lock-free data structures: a conflict-based model
• Analysis and measurement of the effect of kernel locks in SMP systems
• Lock-free algorithms under stochastic schedulers

This page was built for publication: Characterizing the performance of algorithms for lock-free objects

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