We prove that it is impossible to express asynchronous message passing within the framework of first-order temporal logic with both future and past operators (as studied by Kamp). This is an extension of a result of S...
详细信息
We describe applications of a virtually synchronous environment for distributed programming, which underlies a collection of distributed programming tools in the ISIS2 system. A virtually synchronous environment allow...
详细信息
ISBN:
(纸本)089791242X
We describe applications of a virtually synchronous environment for distributed programming, which underlies a collection of distributed programming tools in the ISIS2 system. A virtually synchronous environment allows processes to be structured into process groups, and makes events like broadcasts to the group as an entity, group membership changes, and even migration of an activity from one place to another appear to occur instantaneously - in other words, synchronously. A major advantage to this approach is that many aspects of a distributed application can be treated independently without compromising correctness. Moreover, user code that is designed as if the system were synchronous can often be executed concurrently. We argue that this approach to building distributed and fault-tolerant software is more straightforward, more flexible, and more likely to yield correct solutions than alternative approaches.
This paper describes the Time Warp Operating System, under development for three years at the Jet Propulsion Laboratory for the Caltech Mark III Hypercube multiprocessor. Its primary goal is concurrent execution of la...
详细信息
The proceedings contain 23 papers. The topics discussed include: concurrent programming for the masses;symmetry and similarity in distributed systems;on the analysis of cooperation and antagonism in networks of commun...
ISBN:
(纸本)0897911989
The proceedings contain 23 papers. The topics discussed include: concurrent programming for the masses;symmetry and similarity in distributed systems;on the analysis of cooperation and antagonism in networks of communicating processes;on characterization of safety and liveness properties in temporal logic;a model and proof system for asynchronous networks;easy impossibility proofs for distributed consensus problems;optimal clock synchronization;comparing how atomicity mechanisms support replication;site optimal termination protocols for a distributed database under network partitioning;distributed version management for read-only actions;a provably secure polynomial approximation scheme for the distributed lottery problem;and simple constant-time consensus protocols in realistic failure models.
A name service maps a name of an individual, organization or facility into a set of labelled properties, each of which is a string. It is the basis for resource location, mail addressing, and authentication in a distr...
详细信息
We present a model of distributed program editing and algorithms for the incremental checking of static semantic properties of modules that are at once semantically interdependent and physically distributed across a n...
详细信息
This paper describes two techniques that are only loosely related. The first is a method for constructing a highly available service for use in a distributed system. The service presents its clients with a consistent ...
详细信息
We study the bit complexity of pattern recognition in a distributed ring with a leader. Each processor gets as input a letter from some alphabet, and these concatenated letters, starting at the leader, form the patter...
详细信息
Many fault-tolerant distributed protocols are known. Some of these require a large (exponential) amount of communication. We present a general simulation of any synchronous fault-tolerant consensus protocol by a commu...
详细信息
In designing fault-tolerant distributed database systems, a frequent goal is making the system highly available despite component failure. We examine software approaches to achieving high availability in the presence ...
详细信息
暂无评论