We develop necessary conditions for the development of asynchronous distributed software that will perform uniform actions (events that if performed by any process, must be performed at all processes). The paper focus...
A method of analyzing time bounds for randomized distributed algorithms is presented, in the context of a new and general framework for describing and reasoning about randomized algorithms. The method consists of prov...
详细信息
This paper presents a strong characterization that precisely determines the ability of n-process deterministic types to solve n-process wait-free consensus. This characterization, called the High Gap Theorem, has seve...
详细信息
暂无评论