Uniform solvability with a finite number of MWMR registers. (Extended abstract)

DOI10.1007/B13831zbMATH Open1180.68053OpenAlexW4247838468MaRDI QIDQ5897397FDOQ5897397

Burkhard Englert, Eli Gafni, Marcos Kawazoe Aguilera

Publication date: 23 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13831

Recommendations

• The Combinatorial Structure of Wait-Free Solvable Tasks
• Bounds on the shared memory requirements for long-lived \& adaptive objects (extended abstract)
• On the mutual-exclusion problem -- a quest for minimal solutions
• Linear space bootstrap communication schemes
• Wait-free solvability of colorless tasks in anonymous shared-memory model

Mathematics Subject Classification ID

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

Cited In (1)

• On the cost of uniform protocols whose memory consumption is adaptive to interval contention

This page was built for publication: Uniform solvability with a finite number of MWMR registers. (Extended abstract)

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