This paper is an attempt to bridge thzgap that is developing between practitioners and theoreticians with respect to the use of Byzantine Agreement protocols in distributed database systems. We present an informal ove...
详细信息
Design principles for MIMD multiprocessor computers with virtual memory based on a common, global and uniform logical address space, supporting parallel, procedural languages such as Ada (Ada is a registered trademark...
详细信息
ISBN:
(纸本)0818605383
Design principles for MIMD multiprocessor computers with virtual memory based on a common, global and uniform logical address space, supporting parallel, procedural languages such as Ada (Ada is a registered trademark of the US Government, AJPO), are discussed. The major design issues are identified and suggested solutions given, the most important of which are distributed, associative address translation, and local mechanisms supporting efficient resource allocation policies to reduce over-all communication costs. Arguments are given for using shared memory and bus-based global communication. Some preliminary studies of bus-based intercommunication schemes, parallel language implementation, capacity simulation and VLSI implementation are reviewed, as well as a number of existing experimental and commercial multiprocessors. Finally an experimental system for evaluation of different mechanisms and policies in systems of the suggested type is outlined.
This paper presents the principles followed in designing Zeus, an object-oriented distributed operating system designed to study integration of recovery mechanisms into the designs of distributed command and control s...
详细信息
ISBN:
(纸本)089791144X
This paper presents the principles followed in designing Zeus, an object-oriented distributed operating system designed to study integration of recovery mechanisms into the designs of distributed command and control systems. The primary goal of the Zeus design is to define reliable object management functions for distributed command and control systems and to evaluate the performance and the correctness of the recovery mechanisms for these functions. Therefore, no implementation of this design currently exists. The user provided functions support definition of object types, creation of objects, and updating of distributed objects using atomic transactions.
Unlimited asynchronism is intolerable in real physically distributed computer systems. Such systems, synchronous or not, use clocks and timeouts. Therefore the magnitudes of elapsed absolute time in the system need to...
详细信息
Efforts at achieving reliability in distributedcomputing include the incorporation of fault-tolerance into system software such as routing tables, and the introduction of extra software to mask processor failures, su...
详细信息
ISBN:
(纸本)0818605642
Efforts at achieving reliability in distributedcomputing include the incorporation of fault-tolerance into system software such as routing tables, and the introduction of extra software to mask processor failures, such as Byzantine agreement. A set of n processors running software that can tolerate k faults is called a (k,n)-resilient system. Most (k,n)-resilient systems have a higher probability of failure in the long run, and a smaller mean time-to-failure, than one processor. Further, large systems fail in a very well-defined period, and they fail very quickly if n is more than linear in k.
A system is presented that involves a debugging tool to help detect logical errors and remove them efficiently. The debugging tool is supported by a special architecture named SPRING, which was originally developed fo...
详细信息
ISBN:
(纸本)0818605642
A system is presented that involves a debugging tool to help detect logical errors and remove them efficiently. The debugging tool is supported by a special architecture named SPRING, which was originally developed for reliable execution of Ada or Pascal programs. Following an overview of the system backed up by SPRING, the implementation of high-level debugging on the SPRING architecture is discussed in detail. In conclusion, the trial is seen as a step toward an advanced programming environment for the development of reliable software.
作者：
Leitner, GeraldColumbia Univ
Dep of Computer Science New York NY USA Columbia Univ Dep of Computer Science New York NY USA
Many distributed applications are structured as a set of client processes generating requests for service, and a set of server processes servicing these requests. The common form of interprocess communication (IPC) be...
详细信息
ISBN:
(纸本)0818605642
Many distributed applications are structured as a set of client processes generating requests for service, and a set of server processes servicing these requests. The common form of interprocess communication (IPC) between two single processes does not provide adequate support for robustness and throughput optimization. The author presents a stylized form of IPC between a group of client processes and a group of server processes. The choice of a particular server process to service a request is made dynamically at run-time. This dynamic task distribution provides the kernel support needed to make individual failures of server processes transparent and to optimize system performance through load leveling. The semantics of stylized IPC and the high-level protocol to implement it are described. Particular emphasis is placed on minimizing the performance overhead incurred by this mechanism.
This paper presents two distributed algorithms for detecting and resolving deadlocks. By insuring that only one of the deadlock processes will detect it, the problem of resolving the deadlock is simplified. That proce...
ISBN:
(纸本)9780897911436
This paper presents two distributed algorithms for detecting and resolving deadlocks. By insuring that only one of the deadlock processes will detect it, the problem of resolving the deadlock is simplified. That process could simply abort itself. In one version of the algorithm, an arbitrary process detects deadlock; and in a second version, the process with the lowest priority detects deadlock.
An efficient distributed algorithm to detect deadlocks in distributed and dynamically changing systems is presented. In our model, processes can request any N available resources from a pool of size M. This is a gener...
ISBN:
(纸本)9780897911436
An efficient distributed algorithm to detect deadlocks in distributed and dynamically changing systems is presented. In our model, processes can request any N available resources from a pool of size M. This is a generalization of the well-known AND-OR request model. The algorithm is incrementally derived and proven correct. Its communication, computational, and space complexity compares favorably with those of previously known distributed AND-OR deadlock detection algorithms.
Message passing is one of the primary methods of information exchange between communicating processes. Many programming languages (e.g., CSP, ADA) provide interprocess communication through a rendezvous in which a sen...
ISBN:
(纸本)9780897911436
Message passing is one of the primary methods of information exchange between communicating processes. Many programming languages (e.g., CSP, ADA) provide interprocess communication through a rendezvous in which a sender (receiver) process waits until the receiver (sender) is ready to receive (send) a message; thus there is no buffering of messages. Many of these languages also allow non-deterministic constructs by which a process may wait to communication with any of a set of other processes. In this paper we consider the problem of ensuring different fairness properties in such a system of processes. In a natural model we prove a simple lower bound on the time complexity to ensure weak fairness and present near optimal algorithms in special cases. We also give new efficient algorithms to ensure strong *** this paper we introduce a formal model for processes and consider two different fairness properties: weak fairness and strong fairness. We investigate different distributed scheduling algorithms for ensuring the various fairness properties in a model where neighboring schedulers interact with each other using shared variables. We use the time complexity measure as defined in [Ly80].
暂无评论