Asynchronous Computability Theorem in Arbitrary Solo Models

Asynchronous Computability Theorem in Arbitrary Solo Models

In this paper, we establish the asynchronous computability theorem in <i>d</i>-solo system by borrowing concepts from combinatorial topology, in which we state a necessary and sufficient conditions for a task to be wait-free computable in that system. Intuitively, a <i>d</i>-...

Full description

Bibliographic Details
Main Authors: Yunguang Yue, Fengchun Lei, Xingwu Liu, Jie Wu
Format: Article
Language:English
Published: MDPI AG 2020-05-01
Series:Mathematics
Subjects:
distributed computing
asynchronous computability
solo model
solvability
combinatorial topology
Online Access:https://www.mdpi.com/2227-7390/8/5/757

Internet

https://www.mdpi.com/2227-7390/8/5/757

Similar Items