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 ...
详细信息
The proceedings contain 30 papers. The topics discussed include: a maximum flow approach to anomaly isolation in unification-based incremental type inference;code motion of control structures in high-level languages;h...
ISBN:
(纸本)089791175X
The proceedings contain 30 papers. The topics discussed include: a maximum flow approach to anomaly isolation in unification-based incremental type inference;code motion of control structures in high-level languages;higher-order strictness analysis in untyped lambda calculus;retargetable high-level alias analysis;high-quality code generation via bottom-up tree pattern matching;a parallel language and its compilation to multiprocesser machines or VLSI;towards programming with knowledge expressions;limiitations of synchronous communication with static process structure in languages for distributedcomputing;atomic data abstractions in a distributed collaborative editing system;a really abstract concurrent, model and its temporal logic;expressing interesting properties of programs in propositional temporal logic;operational semantics of a parallel filter-oriented language;equational logic programming: an extension to equational programming;unification in many-sorted algebras as a device for incremental semantic analysis;distributed data structures in Linda;para-functional programming: a paradigm for programming multiproeessor systems;data flow analysis of applicative programs using minimal function graphs;a mechanically certified theorem about optimal concurrency of sorting networks;and executable specifications with quantifiers in the FASE system.
Consider a ring of n anonymous processors, i.e. the processors have no id's. Each processor receives an input string and the ring is to compute a function of the circular input configuration in the asynchronous bi...
详细信息
One of the most studied problems in combinatorial optimization is the maximum matching problem. A new technique for designing algorithms for finding maximum matchings is presented. This technique is based on finding t...
详细信息
The proceedings contain 27 papers. The topics discussed include: easy impossibility proofs for distributed consensus problems;symmetry and similarity in distributed systems;site optimal termination protocols for a dis...
ISBN:
(纸本)0897911687
The proceedings contain 27 papers. The topics discussed include: easy impossibility proofs for distributed consensus problems;symmetry and similarity in distributed systems;site optimal termination protocols for a distributed database under network partitioning;on the analysis of cooperation and antagonism in networks of communicating processes;optimal clock synchronization;fast distributed agreement;distributed version management for read-only actions;simple constant-time consensus protocols in realistic failure models;a modular technique for the design of efficient distributed leader finding algorithms;improvements in the time complexity of two message-optimal election algorithms;time and message bounds for election in . synchronous and asynchronous complete networks;how processes learn;a provably secure polynomial approximation scheme for the distributed lottery problem;computing on an anonymous ring;cheating husbands and other stories: a case study of knowledge, action, and communication;inexact agreement: accuracy, precision, and graceful degradation;and towards a universal directory service.
An efficient algorithm for synchronized termination of iterative solution of simultaneous equations in a distributed message passing system is presented. The algorithm is based on an assumption that distributed proces...
详细信息
暂无评论