Download Free A Fault Tolerant Distributed Termination Detection Scheme Book in PDF and EPUB Free Download. You can read online A Fault Tolerant Distributed Termination Detection Scheme and write the review.

Abstract: "A fault tolerant termination detection scheme is proposed. The scheme is distributed and symmetry. It can be applied to any kind of connection topology. It uses the FIFO property of a single transmission line to cope with system wide non-FIFO message transmission. Some of the information concerning termination detection are backed up for fault tolerant purpose [sic]. The backing up does not require the synchronisation of the processing nodes, and it does not interfere with the normal computation. Hence, The [sic] overhead to achieve fault tolerance has been minimised. The scheme is derived using invariant technique [sic]."
Abstract: "A termination detector is a distributed algorithm that, when superimposed on a distributed system of n processes, is able to determine whether the computation of the underlying system has terminated. Fault tolerance is one of the most desirable properties of distributed systems. While some problems are notoriously known to be unsolvable in the presence of faulty processes, many distributed algorithms are able to tolerate failures of processes. When a termination detector is applied to a fault-tolerant underlying system, it is desirable that the detector itself be fault-tolerant. In most existing distributed systems, processes certainly may fail, but only occasionally or even rarely. Thus, a desirable fault-tolerant algorithm is one that can tolerate any number of faults, that runs as efficiently as the best available non-fault-tolerant algorithm if no process fails during the computation, and that incurs only a reasonable amount of extra cost for each process failure that actually occurs. In this paper, we present a fault-tolerant termination detection algorithm with these nice properties. The algorithm is much more efficient than existing (fault-tolerant) ones."
Abstract: "This paper presents a fault-tolerant termination detection algorithm for a distributed system in which processes tend to fail. Allowing arbitrary number of processes to have fail-stop behavior, the algorithm can detect termination efficiently with O(M + kn + n) control messages and O(k) detection delays, where M is the number of basic messages issued, n is the number of processes, and k is the actual number of processes that fail. This algorithm has less detection delays than existing algorithms in the literature and comparable performance in terms of message complexity."
Designing distributed computing systems is a complex process requiring a solid understanding of the design problems and the theoretical and practical aspects of their solutions. This comprehensive textbook covers the fundamental principles and models underlying the theory, algorithms and systems aspects of distributed computing. Broad and detailed coverage of the theory is balanced with practical systems-related issues such as mutual exclusion, deadlock detection, authentication, and failure recovery. Algorithms are carefully selected, lucidly presented, and described without complex proofs. Simple explanations and illustrations are used to elucidate the algorithms. Important emerging topics such as peer-to-peer networks and network security are also considered. With vital algorithms, numerous illustrations, examples and homework problems, this textbook is suitable for advanced undergraduate and graduate students of electrical and computer engineering and computer science. Practitioners in data networking and sensor networks will also find this a valuable resource. Additional resources are available online at www.cambridge.org/9780521876346.
This volume constitutes the refereed proceedings of the 1995 Asian Computing Science Conference, ACSC 95, held in Pathumthani, Thailand in December 1995. The 29 fully revised papers presented were selected from a total of 102 submissions; clearly the majority of the participating researchers come from South-East Asian countries, but there is also a strong international component. The volume reflects research activities, particularly by Asian computer science researchers, in different areas. Special attention is paid to algorithms, knowledge representation, programming and specification languages, verification, concurrency, networking and distributed systems, and databases.