Lock-Free Algorithms under Stochastic Schedulers

DOI10.1145/2767386.2767430zbMath1333.68269OpenAlexW1979055695MaRDI QIDQ2796261

Dan Alistarh, Thomas Sauerwald, Milan Vojnovic

Publication date: 23 March 2016

Published in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://www.repository.cam.ac.uk/handle/1810/295104

zbMATH Keywords

schedulingshared memorylock-free algorithms

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Distributed algorithms (68W15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

The entropy of a distributed computation random number generation from memory interleaving ⋮ Unnamed Item

Cites Work

• Memorization and Association on a Realistic Neural Model
• Unnamed Item

This page was built for publication: Lock-Free Algorithms under Stochastic Schedulers