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/

Zendy Pro

Presents the zaia usage as premium feature

ZAIA

Presents AI Discovery search usage as a premium feature

AI Discovery

Presents AI Discovery explain and summary usage as a premium feature

Content Analysis

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Presents the pdf analysis as premium feature

PDF Analysis

1500 Top-up

3000 Top-up

Zendy Basic

2500 Top-up

Zendy Unlimited

Presents the access of premium content as premium feature

Premium Content

We investigate the fault-tolerant capability of distributed systems in anonymous and unreliable settings. In the anonymous model, processes have no identifiers and execute an identical code. The present paper assumes that processes are prone to crash failures and communicate via multi-writer/multi-reader shared registers. We study the wait-free solvability of colorless tasks in the anonymous model. Especially, we propose an anonymous full-information protocol for colorless tasks and give a topological characterization of colorless tasks that are wait-free solvable in the anonymous model. The characterization implies that the anonymity does not reduce the computational power of the asynchronous shared-memory model as long as colorless tasks are concerned. We also show that some of the existing topological arguments on the eponymous model apply to the anonymous one.

Wait-free Solvability of Colorless Tasks in Anonymous Shared-memory Model