Power and limits of distributed computing shared memory models
Résumé
Due to the advent of multicore machines, shared memory distributed computing models taking into account asynchrony and process crashes are becoming more and more important. This paper visits some of the models for these systems, and analyses their properties from a computability point of view. Among them, the snapshot model and the iterated model are particularly investigated. The paper visits also several approaches that have been proposed to model crash failures. Among them, the wait-free case where any number of processes can crash is fundamental. The paper also considers models where up to t processes can crash, and where the crashes are not independent. The aim of this survey is to help the reader to better understand recent advances on what is known about the power and limits of distributed computing shared memory models and their underlying mathematics.
Ce rapport est une introduction au modèles de calcul asynchrone pour les systèmes à mémoire partagée.
Mots clés
Adversary
Agreement
Asynchronous system
Borowsky-Gafni's simulation
Concurrency
Core
Crash failure
Distributed computability
Distributed computing model
Fault-Tolerance
Iterated model
Liveness
Model equivalence
Obstruction-freedom
Progress condition
Recursion
Resilience
Shared memory system
Snapshot
Survivor set
Task
Topology
Wait-freedom.
Wait-freedom
Domaines
Autre [cs.OH]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...