Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems

Joshua J. Daymude, Andréa W. Richa, Christian Scheideler

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Mutual exclusion is a classical problem in distributed computing that provides isolation among concurrent action executions that may require access to the same shared resources. Inspired by algorithmic research on distributed systems of weakly capable entities whose connections change over time, we address the local mutual exclusion problem that tasks each node with acquiring exclusive locks for itself and the maximal subset of its “persistent” neighbors that remain connected to it over the time interval of the lock request. Using the established time-varying graphs model to capture adversarial topological changes, we propose and rigorously analyze a local mutual exclusion algorithm for nodes that are anonymous and communicate via asynchronous message passing. The algorithm satisfies mutual exclusion (non-intersecting lock sets) and lockout freedom (eventual success with probability 1) under both semi-synchronous and asynchronous concurrency. It requires O(∆) memory per node and messages of size Θ(1), where ∆ is the maximum number of connections per node. We conclude by describing how our algorithm can implement the pairwise interactions assumed by population protocols and the concurrency control operations assumed by the canonical amoebot model, demonstrating its utility in both passively and actively dynamic distributed systems.

Original languageEnglish (US)
Title of host publication1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022
EditorsJames Aspnes, Othon Michail
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772242
DOIs
StatePublished - Apr 1 2022
Externally publishedYes
Event1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022 - Virtual, Online
Duration: Mar 28 2022Mar 30 2022

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume221
ISSN (Print)1868-8969

Conference

Conference1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022
CityVirtual, Online
Period3/28/223/30/22

Keywords

  • concurrency
  • dynamic networks
  • message passing
  • Mutual exclusion

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems'. Together they form a unique fingerprint.

Cite this