EUVIMEDEUVIMED entdecken
Crossref

An algorithmic approach to the asynchronous computability theorem

Vikram Saraph, Maurice Herlihy, Eli Gafni

Journal of Applied and Computational Topology · 2018

DOI: 10.1007/s41468-018-0014-4 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Applied and Computational Topology, 2018. Verfasst von Vikram Saraph und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 21 Literaturangaben. Gefördert von: National Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The asynchronous computability theorem (ACT) uses concepts from combinatorial topology to characterize which tasks have wait-free solutions in read–write memory. A task can be expressed as a relation between two chromatic simplicial complexes. The theorem states that a task has a protocol (algorithm) if and only if there is a certain color-preserving simplicial map compatible with that relation. The original proof of the ACT, given by Herlihy and Shavit (Proceedings of the 25th annual ACM symposium on theory of computing, pp 111–120, 1993; J ACM 46(6):858–923, 1999) relied on an involved geometric argument. Borowsky and Gafni (Proceedings of the 16th annual ACM symposium on principles of distributed computing, pp 189–198, 1997) later proposed an alternative proof based on a distributed algorithmic, termed the “convergence algorithm”. However the description of this algorithm was incomplete, and presented without proof. In this paper, we give the first complete description, along with a proof of correctness.

Förderung

  • National Science Foundation

Zitieren

APA

Saraph, V., Herlihy, M., & Gafni, E. (2018). An algorithmic approach to the asynchronous computability theorem. Journal of Applied and Computational Topology. https://doi.org/10.1007/s41468-018-0014-4

Vancouver

Saraph V, Herlihy M, Gafni E. An algorithmic approach to the asynchronous computability theorem. Journal of Applied and Computational Topology. 2018. doi:10.1007/s41468-018-0014-4

BibTeX
@article{Saraph2018,
  author = {Saraph, Vikram and Herlihy, Maurice and Gafni, Eli},
  title = {An algorithmic approach to the asynchronous computability theorem},
  journal = {Journal of Applied and Computational Topology},
  year = {2018},
  doi = {10.1007/s41468-018-0014-4}
}
Kostenlos starten →