This symposiumproceedings contains 21 papers. Among the subjects covered are: Recovery Issues in distributed Systems, Design Issues in distributed Database Systems, Recent Advances in distributed Processing and Relia...
详细信息
ISBN:
(纸本)0818605014
This symposiumproceedings contains 21 papers. Among the subjects covered are: Recovery Issues in distributed Systems, Design Issues in distributed Database Systems, Recent Advances in distributed Processing and Reliable computing, Design and Analysis of distributed Operating Systems, Implementation of Reliable distributed Systems and Fault Tolerant Algorithms in distributed Systems.
Commit protocols guarantee the consistency of distributed databases in absence of any failures. A commit protocol is resilient to a class of failures if it is possible to guarantee that a) databases at all operational...
详细信息
ISBN:
(纸本)0897910974
Commit protocols guarantee the consistency of distributed databases in absence of any failures. A commit protocol is resilient to a class of failures if it is possible to guarantee that a) databases at all operational sites in presence of these failures are consistent and b) other sites can be recovered consistently with these sites when the failure is repaired. It is proved that quorum-based termination protocols perform very well in the presence of network partitioning. If the central site is reliable, we can prove that centralized commit protocols indeed perform better than all decentralized ones. Thus, the general preference for centralized commit protocols is justified.
The logical design of a reliable transaction management in a distributed multiple processor system is presented. A main characteristic of the system is that it realizes autonomous nodes. This has implications on the c...
详细信息
The proceedings contain 31 papers. The topics discussed include: static and dynamic topological re-configurability in multi-microcomputer systems;modeling dOBS in a distributed system;an interactive graphics editor fo...
ISBN:
(纸本)0897911237
The proceedings contain 31 papers. The topics discussed include: static and dynamic topological re-configurability in multi-microcomputer systems;modeling dOBS in a distributed system;an interactive graphics editor for document preparation;an integrated forth system;generating mc68000 code for ADA;RM: a resource-sharing system for personal computers;comparison of UNIX network systems;and an analysis of CP/NET.
The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. We show that every protocol for this problem h...
详细信息
ISBN:
(纸本)0897910974
The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. We show that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the snychronous case, the 'Byzantine Generals' problem.
The current research on optimizing algorithms for queries in distributed data base networks is presented. An identification of additional factors which add cost and time to processing of a query both at a node and in ...
详细信息
We describe a reliability algorithm being considered for DDM, a distributed database system under development at Computer Corporation of America. The algorithm is designed to tolerate clean site failures in which site...
详细信息
ISBN:
(纸本)0897910974
We describe a reliability algorithm being considered for DDM, a distributed database system under development at Computer Corporation of America. The algorithm is designed to tolerate clean site failures in which sites simply stop running. The algorithm allows the system to reconfigure itself to run correctly as sites fail and recover. The algorithm solves the subproblems of atomic commit and replicated data handling in an integrated manner.
Failures in a distributed system (such as node crashes) can give rise to unwanted computations referred to as orphans. Orphans can interfere with executions of other programs, thus giving rise to unpredictable behavio...
详细信息
ISBN:
(纸本)0818605014
Failures in a distributed system (such as node crashes) can give rise to unwanted computations referred to as orphans. Orphans can interfere with executions of other programs, thus giving rise to unpredictable behavior. In this paper a graph model of computation is utilized to discuss the orphan phenomenon in a rigorous manner. In particular, conditions are derived for interference-free executions of programs. In a distributed system consisting of 'clients' and 'servers', where clients interact with servers by making use of remote procedure calls, various techniques for treating orphans under 'at least once' and 'exactly once' call semantics are next investigated.
暂无评论