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...
详细信息
A general purpose parallel programming model called mixed consistency is developed for distributed shared memory systems. This model combines two kinds of weak memory consistency conditions: causal memory and pipeline...
详细信息
We propose a global flush communication primitive which allows the sender to order receipt of a message with respect to receipt of messages in its past and/or its future. The past of a message includes all messages th...
详细信息
The computational power of concurrent data types has been the focus of much recent research. Herlihy showed that such power may be measured by examining the type's ability to implement wait-free consensus. Jayanti...
详细信息
This paper introduces a framework for knowledgebased analysis of issues of timing and clocks in systems with real-time constraints. We define the notion of timed precedence, a generalization of Lamport's potential...
详细信息
We present a methodology for the implementation of resilient shared objects that allows the desired level of resiliency to be selected based on performance concerns. This methodology is based on the k-exclusion and re...
详细信息
暂无评论