English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Mutual exclusion is a classical problem in distributed computing thatprovides isolation among concurrent action executions that may require accessto the same shared resources. Inspired by algorithmic research on distributedsystems of weakly capable entities whose connections change over time, weaddress the local mutual exclusion problem that tasks each node with acquiringexclusive locks for itself and the maximal subset of its "persistent" neighborsthat remain connected to it over the time interval of the lock request. Usingthe established time-varying graphs model to capture adversarial topologicalchanges, we propose and rigorously analyze a local mutual exclusion algorithmfor nodes that are anonymous and communicate via asynchronous message passing.The algorithm satisfies mutual exclusion (non-intersecting lock sets) andlockout freedom (eventual success with probability 1) under bothsemi-synchronous and asynchronous concurrency. It requires$\mathcal{O}(\Delta)$ memory per node and messages of size $\Theta(1)$, where$\Delta$ is the maximum number of connections per node. We conclude bydescribing how our algorithm can implement the pairwise interactions assumed bypopulation protocols and the concurrency control operations assumed by thecanonical amoebot model, demonstrating its utility in both passively andactively dynamic distributed systems.

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