This conference proceedings contains 27 papers. The main topics discussed are: distributed computer systems, computer networks protocols, distributed database systems, and some aspects of automata theory. Some general...
详细信息
ISBN:
(纸本)0897911431
This conference proceedings contains 27 papers. The main topics discussed are: distributed computer systems, computer networks protocols, distributed database systems, and some aspects of automata theory. Some general applications of concurrent programming, and the deadlock detection and resolution are also presented.
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:
(纸本)0897911431
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.
The design and implementation study discussed in this paper can be viewed in two ways. On one hand, it represents a contribution to the active area of design of 'smart' communications controllers which use inc...
详细信息
ISBN:
(纸本)0897911431
The design and implementation study discussed in this paper can be viewed in two ways. On one hand, it represents a contribution to the active area of design of 'smart' communications controllers which use increasingly sophisticated processor memory configurations to improve the performance of interprocessor communication. On the other hand, it represents an application of the minimalist principles of the RISC (Reduced Instruction-Set Computer) architecture to operating systems kernel design.
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:
(纸本)0897911431
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.
distributed algorithms for complete asynchronous networks of processors (i. e. , networks where each pair of processors is connected by a communication line) are discussed. The main result is O(nlogn) lower and upper ...
详细信息
ISBN:
(纸本)0897911431
distributed algorithms for complete asynchronous networks of processors (i. e. , networks where each pair of processors is connected by a communication line) are discussed. The main result is O(nlogn) lower and upper bounds on the number of messages required by any algorithm in a given class of distributed algorithms for such networks. This class includes algorithms for problems like finding a leader or constructing a spanning tree. O(n**2) bounds for other problems, like constructing a maximal matching or a Hamiltonian circuit are also given.
The authors argue that the right way to understand distributed protocols is by considering how messages change the state of knowledge of a system. They present a hierarchy of knowledge states that a system may be in, ...
详细信息
ISBN:
(纸本)0897911431
The authors argue that the right way to understand distributed protocols is by considering how messages change the state of knowledge of a system. They present a hierarchy of knowledge states that a system may be in, and discuss how communication can move the system's state of knowledge of a fact up the hierarchy. Of special interest is the notion of common knowledge. Common knowledge is an essential state of knowledge for reaching agreements and coordinating action. The authors show that in practical distributed systems, common knowledge is not attainable. They introduce various relaxations of common knowledge that are attainable in many cases of interest. They describe in what sense these notions are appropriate, and discuss their relationship to each other. They conclude with a discussion of the role of knowledge in distributed systems.
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 th...
详细信息
ISBN:
(纸本)0897911431
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. This paper considers the problem of ensuring different fairness properties in such a system of processes. In a natural model is proved a simple lower bound on the time complexity to ensure weak fairness and also presented is near optimal algorithms in special cases. Also given is new efficient algorithms to ensure strong fairness.
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.
暂无评论