On contention resolution protocols and associated probabilistic phenomena

DOI10.1145/195058.195122MaRDI QIDQ5890840zbMATH OpenOpenAlexFDO

Authors Philip MacKenzie, C. G. Plaxton, Rajmohan Rajaraman

Publication date 1 September 2016

Published in Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network protocols (68M12) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Nonnumerical algorithms (68W05) Randomized algorithms (68W20)

Recommendations

• On contention resolution protocols and associated probabilistic phenomena
• Unbounded contention resolution in multiple-access channels
• scientific article; zbMATH DE number 1263198
• Stochastic Contention Resolution With Short Delays
• Contention Resolution in Hashing Based Shared Memory Simulations

Cited in

(11)

• ERCW PRAMs and optical communication
• Exploiting storage redundancy to speed up randomized shared memory simulations
• Simulating shared memory in real time: On the computation power of reconfigurable architectures
• Resolution of process collisions in the scalable computer systems
• Analysis of randomized protocols for conflict-free distributed access
• Lock-free algorithms under stochastic schedulers
• Stochastic Contention Resolution With Short Delays
• Appearance of complex components in a random bigraph
• On contention resolution protocols and associated probabilistic phenomena
• Shared memory simulations with triple-logarithmic delay
• A lower bound for communication on the crossbar

This page was built for publication: On contention resolution protocols and associated probabilistic phenomena

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