Work

Invited paper: Full Anonymity in Read/Write and Read/Modify/Write Distributed Computing

Year: 2025

Type: conference-paper

Abstract: This paper considers distributed algorithms where asynchronous processes cooperate through a shared memory in the adversarial context where both the computing entities (namely sequential processes) are anonymous and the communication medium is made up of shared registers that have no global names in the following sense: a shared register known as A by a process p can be known as Z by another process q (and this is unknown to the processes). So the crucial question is then: what can be computed in such a very weak addressing computing model? The paper is a short visit that answers this question.

DOI: 10.1145/3743642.3743652

Authors: Michel Raynal, Gadi Taubenfeld

Institutions: Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, Institut de Recherche en Informatique et Systèmes Aléatoires, Université de Rennes, Reichman University

Language: English

Topic: Distributed systems and fault tolerance

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: gold

Funder: Agence Nationale de la Recherche

Awards: G2014946915, G3343749973, BeYond BLOckchainS: Modular Building Blocks for Large-Scale Trustless Multi-users Apps, G7240651115

OpenAlex ID: W4411979463

FWCI: 1.331

Cites: 12

Cited by: 1

Related to: 10