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

11/17/2021
by   Joshua J. Daymude, et al.
0

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) under both semi-synchronous and asynchronous concurrency. It requires 𝒪(ΔlogΔ) memory per node and messages of size 𝒪(logΔ), where Δ is the maximum number of connections per node. For systems of weak entities, Δ is often a small constant, reducing the memory and message size requirements to 𝒪(1). We conclude by describing how our algorithm can be used to implement the schedulers 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.

READ FULL TEXT

page 1

page 3

page 5

page 13

page 15

page 17

research
07/16/2018

An asynchronous message-passing distributed algorithm for the global critical section problem

This paper considers the global (l,k)-CS problem which is the problem of...
research
02/13/2020

Ressource Efficient Stabilization for Local Tasks despite Unknown Capacity Links

Self-stabilizing protocols enable distributed systems to recover correct...
research
05/03/2023

Time is not a Healer, but it Sure Makes Hindsight 20:20

In the 1980s, three related impossibility results emerged in the field o...
research
05/24/2022

Asynchronous Neural Networks for Learning in Graphs

This paper studies asynchronous message passing (AMP), a new paradigm fo...
research
03/07/2022

Self-Stabilizing Periodic Mutual-exclusive Propagation in Sparse Networks

Message propagation is fundamental in constructing distributed systems u...
research
04/04/2022

Parameterized algorithm for replicated objects with local reads

We consider the problem of implementing linearizable objects that suppor...
research
12/14/2018

Mastering Concurrent Computing Through Sequential Thinking: A Half-century Evolution

Concurrency, the art of doing many things at the same time is slowly bec...

Please sign up or login with your details

Forgot password? Click here to reset