Bounds on the shared memory requirements for long-lived & adaptive objects

Yehuda Afek*, Pazi Boxer, Dan Touitou

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

Abstract

In a previous study, Burns and Lynch proved that at least n multi-writer-multi-reader (MWMR) registers are necessary in any mutual exclusion algorithm that uses only MWMR registers. The present work extends the techniques of Burns and Lynch to prove that adaptive algorithms that use both n single-writer-multi-reader (SWMR) and MWMR registers, need in addition to the Ω(n) SWMR registers a non-constant, F(n) number of MWMR registers.

Original languageEnglish
Pages81-89
Number of pages9
DOIs
StatePublished - 2000
Event19th Annual ACM Symposium on Principles of Distributed Computing - Portland, OR, USA
Duration: 16 Jul 200019 Jul 2000

Conference

Conference19th Annual ACM Symposium on Principles of Distributed Computing
CityPortland, OR, USA
Period16/07/0019/07/00

Fingerprint

Dive into the research topics of 'Bounds on the shared memory requirements for long-lived & adaptive objects'. Together they form a unique fingerprint.

Cite this