®®®® SIIA Público

Título del libro: Proceedings Of The 2016 Acm Symposium On Principles Of Distributed Computing (podc'16)
Título del capítulo: Brief Announcement: Asynchronous Coordination with Constraints and Preferences

Autores UNAM:
ARMANDO CASTAÑEDA ROJANO; SERGIO RAJSBAUM GORODEZKY;
Autores externos:

Idioma:
Inglés
Año de publicación:
2016
Palabras clave:

Computation theory; Adaptive renaming; Asynchronous agents; Coordination tasks; Independent set; Model constraints; Undirected graph; Wait free; Distributed computer systems


Resumen:

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. We model constraints between resources as an undirected graph: nodes represent the ressources, and an edge between two ressources indicates that these two ressources cannot be used simultaneously. In such a setting, the sets of resources that processes may use simultaneously form independent sets. In this note, we focus on this task in a model where such independent sets are computed by wait-free processes.


Entidades citadas de la UNAM: