Work

Brief Announcement

Year: 2016

Type: conference-paper

Abstract: Adaptive renaming can be viewed as a coordination task involving a set of asynchronous agents, each aiming at grabbing a single resource out of a set of resources totally ordered by their desirability. We consider a generalization of adaptive renaming to take into account scenarios in which resources are not independent.

Source: ACM Symposium on Principles of Distributed Computing (PODC)

DOI: 10.1145/2933057.2933081

Authors: Armando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy

Institutions: Universidad Nacional Autónoma de México, Institut de Recherche en Informatique Fondamentale, University of California, Los Angeles, Centre National de la Recherche Scientifique, Laboratoire d'Analyse et d'Architecture des Systèmes

Language: English

Topic: Distributed systems and fault tolerance

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2483977908

FWCI:

Cites: 7

Cited by:

Related to: 10