Asynchrony from synchrony

Yehuda Afek, Eli Gafni

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A synchronous message passing complete network with an adversary that may purge messages is used to precisely model tasks that are read-write wait-free computable. In the past, adversaries that reduce the computational power of a system as they purge messages were studied in the context of their ability to foil consensus. This paper considers the other extreme. It characterizes the limits on the power of message-adversary so that it cannot foil the solution of tasks which are read-write wait-free solvable but can foil the solution of any task that is not read-write wait-free solvable. Put another way, we study the weakest message-adversary which allows for solving any task that is solvable wait-free in the read-write model. A remarkable side-benefit of this characterization is a simple, as simple as can be, derivation of the Herlihy-Shavit condition that equates the wait-free read-write model with a subdivided-simplex. We show how each step in the computation inductively takes a subdivided-simplex and further subdivides it in the simplest way possible, making the characterization of read-write wait-free widely accessible.

Original languageEnglish
Title of host publicationDistributed Computing and Networking - 14th International Conference, ICDCN 2013, Proceedings
Pages225-239
Number of pages15
DOIs
StatePublished - 2013
Event14th International Conference on Distributed Computing and Networking, ICDCN 2013 - Mumbai, India
Duration: 3 Jan 20136 Jan 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7730 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Conference on Distributed Computing and Networking, ICDCN 2013
Country/TerritoryIndia
CityMumbai
Period3/01/136/01/13

Keywords

  • Asynchronous computability
  • Distributed algorithms
  • Shared memory
  • Subdivided simplex
  • Wait-free

Fingerprint

Dive into the research topics of 'Asynchrony from synchrony'. Together they form a unique fingerprint.

Cite this