Analyzing contention and backoff in asynchronous shared memory

DOI10.1145/3087801.3087828MaRDI QIDQ5368940zbMATH OpenOpenAlexFDO

Authors Naama Ben-David, Guy E. Blelloch

Publication date 11 October 2017

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

Full work available at URL https://doi.org/10.1145/3087801.3087828

zbMATH Keywords

backoffcontentionshared memory

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14)

Recommendations

• Contention in shared memory algorithms
• Stochastic Contention Resolution With Short Delays
• Contention resolution with log-logstar channel accesses
• Contention resolution with constant throughput and log-logstar channel accesses
• Asynchronous shared channel

Cited in

(7)

• On the cost of uniform protocols whose memory consumption is adaptive to interval contention
• Windowed backoff algorithms for WiFi: theory and performance under batched arrivals
• Contention in shared memory algorithms
• Lock-free search data structures: throughput modeling with Poisson processes
• Formal Analysis of Memory Contention in a Multiprocessor System
• Contention resolution with message deadlines
• Softening the impact of collisions in contention resolution

This page was built for publication: Analyzing contention and backoff in asynchronous shared memory

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