允许异步的并发算法的性质
Properties of Concurrent Algorithms that Allow Asynchrony
Arya Tanmay Gupta, Sandeep S Kulkarni
AI 速读 基于摘要
论文研究并发系统在无同步下确定性收敛的条件,提出局部状态偏序是允许异步的充要条件,并区分PO诱导与非PO诱导问题。
cs.DS · cs.DC
查看原文摘要
In this paper, we investigate the conditions under which a concurrent system is able to guarantee convergence deterministically even without synchronization. In general, an algorithm is deemed asynchrony-tolerant iff the global states form a DAG even if the nodes can execute based on outdated/stale values from each other. In this paper, we show that the induction of a partial order (PO) among the local states visited by individual nodes is necessary and sufficient to allow asynchrony. There are certain problems for which the predicate that defines the problem, itself, induces a partial order among the local states (called \textit{PO-inducing problems}). On the other hand, \textit{non-PO-inducing problems} is another class of problems in which a predicate defining the problem cannot induce a partial order among local states. We introduce these classes of problems. We study example PO-inducing and non-PO-inducing problems, and provide example PO-inducing (in other words, asynchrony-tolerant) algorithms (algorithms under which any node traverses a partial order of local states) for all these problems.