Asynchronous exclusive selection

From MaRDI portal

Revision as of 20:15, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2934360

Jump to:navigation, search

DOI10.1145/1400751.1400801zbMath1301.68125arXiv1512.09314OpenAlexW2021785007MaRDI QIDQ2934360

Dariusz R. Kowalski, Bogdan S. Chlebus

Publication date: 12 December 2014

Published in: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

asynchrony wait-free renaming non-blocking crashes graph expansion adaptation to contention local step complexity read-write shared registers store and collect

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (4)

Tight Bounds for Asynchronous Renaming ⋮ Deterministic multi-channel information exchange ⋮ Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms ⋮ Fully-adaptive algorithms for long-lived renaming

This page was built for publication: Asynchronous exclusive selection

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2934360&oldid=15921213"