Download or read book On the Relative Power of Shared Objects in Fault tolerant Distributed Systems written by and published by . This book was released on 1997 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book On the Relative Power of Shared Objects in Fault tolerant Distributed Systems written by Wai Kau Lo and published by . This book was released on 1997 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: A fundamental question in distributed computing is to determine whether a given set of "base" shared object types can be used to implement a new type. In this thesis we study this problem in a fault-tolerant setting, where implementations must work even if some of the processes that share the objects may crash. An implementation is t-resilient, if it tolerates the crash of t processes; it is wait-free, if it is $(n - 1)$-resilient, where n is the number of processes. This thesis makes two contributions. The first concerns the classification of shared object types according to their ability to support wait-free implementations. A wait-free hierarchy assigns object types to levels in $\{1,2,\...\}$ such that, using only objects of any type assigned to level n, in conjunction with registers, we can implement an object of any type in a wait-free manner in a system of n processes. Such a hierarchy is robust if, in a system of n processes, it is not possible to implement objects of types at level n in a wait-free manner, using any number and combination of objects of types that are below level n. We show that, if nondeterministic types are allowed, then the only robust wait-free hierarchy is the trivial one, which lumps all types into level one. One important and useful object type is consensus, because consensus objects and registers alone can be used to implement objects of any type. The second contribution of the thesis concerns the ability of object types to support one-resilient implementations of the type consensus. Specifically, we study the relationship between the one-resilient implementability of consensus objects for n processes and that for $n - 1$ processes, for every $n \ge 3.$ On the one hand, the following is shown for n = 3: there exists a deterministic type that can be used to implement a one-resilient consensus object for three, but not two, processes. On the other hand, for every $n \ge 4$, we show that given any set ${\cal B}$ of object types, there is a one-resilient implementation of a consensus object for n processes using ${\cal B}$ if and only if there is a one-resilient implementation of a consensus object for $n - 1$ processes using ${\cal B}.$

Download or read book The Consensus Power of Shared memory Distributed Systems written by Eric Ruppert and published by . This book was released on 2000 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: In many asynchronous distributed systems, processes communicate by accessing objects in a shared memory. The ability of systems to solve problems in a fault-tolerant manner depends on the types of objects provided. Here, the wait-free model of fault-tolerance is used: non-faulty processes must run correctly even if other processes experience halting failures. The consensus problem, where processes begin with private inputs and must agree on one of them, has played a central role in analysing the power of distributed systems. This thesis studies the ability of different types of objects to solve consensus. An object type has consensus number 'n' if it can be used (with read/writehsp sp="0.167"hsp sp="0.167"regist ers to solve consensus among 'n' processes but not among ' n'+1 processes. Conditions are given that are necessary and sufficient for an object type to have consensus number 'n'. This characterization applies to two large classes of objects: readable objects and read-modify-write (RMW) objects. An object is readable if processes can read its state without changing the state. For a RMW object, all operations update the state and then return the previous state of the object. When the type is of bounded size, the characterization may be used to decide the question "Does the type 'T' have consensus number 'n'?", which is undecidable for arbitrary types. The characterization is also used to show that different readable and RMW types with consensus number ' n' cannot be used in combination to solve consensus for 'n '+1 processes. Ordinarily, processes may access only one object in shared memory at a time. This thesis also studies how much the consensus number of a type increases in the multi-object and transactional models, where processes can perform operations on up to 'm' of the objects in a single atomic action. These models are much more convenient for programmers to use, since they guarantee that certain blocks of operations will be executed without interruptions from other processes. This thesis establishes bounds on the consensus numbers of multi-objects and transactional objects as a function of 'm' and the consensus numbers of the corresponding single-access types.

Download or read book Distributed Computing written by Hagit Attiya and published by John Wiley & Sons. This book was released on 2004-03-25 with total page 440 pages. Available in PDF, EPUB and Kindle. Book excerpt: * Comprehensive introduction to the fundamental results in the mathematical foundations of distributed computing * Accompanied by supporting material, such as lecture notes and solutions for selected exercises * Each chapter ends with bibliographical notes and a set of exercises * Covers the fundamental models, issues and techniques, and features some of the more advanced topics

Download or read book American Doctoral Dissertations written by and published by . This book was released on 2000 with total page 816 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Fault tolerant Message passing Distributed Systems written by Michel Raynal and published by . This book was released on 2018 with total page 459 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book presents the most important fault-tolerant distributed programming abstractions and their associated distributed algorithms, in particular in terms of reliable communication and agreement, which lie at the heart of nearly all distributed applications. These programming abstractions, distributed objects or services, allow software designers and programmers to cope with asynchrony and the most important types of failures such as process crashes, message losses, and malicious behaviors of computing entities, widely known under the term "Byzantine fault-tolerance". The author introduces these notions in an incremental manner, starting from a clear specification, followed by algorithms which are first described intuitively and then proved correct. The book also presents impossibility results in classic distributed computing models, along with strategies, mainly failure detectors and randomization, that allow us to enrich these models. In this sense, the book constitutes an introduction to the science of distributed computing, with applications in all domains of distributed systems, such as cloud computing and blockchains. Each chapter comes with exercises and bibliographic notes to help the reader approach, understand, and master the fascinating field of fault-tolerant distributed computing.

Download or read book Dissertation Abstracts International written by and published by . This book was released on 2007 with total page 902 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Fault Tolerant Objects in Distributed Systems Using Hot Replication written by Ganesha Beedubail and published by . This book was released on 1995 with total page 32 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book A Framework for Supporting Fault tolerant Objects in Distributed Systems written by Chih-yung Chen and published by . This book was released on 2001 with total page 161 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Fault Tolerance in Distributed Systems written by Pankaj Jalote and published by Prentice Hall. This book was released on 1994 with total page 456 pages. Available in PDF, EPUB and Kindle. Book excerpt: Fault tolerance is an approach by which reliability of a computer system can be increased beyond what can be achieved by traditional methods. Comprehensive and self-contained, this book explores the information available on software supported fault tolerance techniques, with a focus on fault tolerance in distributed systems.

Download or read book Fault tolerance Implemented by Voting Protocols in Distributed Systems written by Per Gunningberg and published by . This book was released on 1983 with total page 138 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Fault tolerant Wait free Shared Objects written by Prasad Jayanti and published by . This book was released on 1992 with total page 38 pages. Available in PDF, EPUB and Kindle. Book excerpt: Of special interest is the problem of implementing fault-tolerant objects using only objects of the same type. We present such fault-tolerant self-implementations for many common object types.

Download or read book A Fault tolerant Coherence Protocol for Distributed Shared Memory Systems written by Pallavi K. Ramam and published by . This book was released on 1998 with total page 436 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Toward Self stabilizing Wait free Shared Memory Objects written by Jaap-Henk Hoepman and published by . This book was released on 1995 with total page 15 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "Past research on fault tolerant distributed systems has focussed on either processor failures, ranging from benign crash failures to the malicious byzantine failure types, or on transient memory failures, which can suddenly corrupt the state of the system. An interesting question in the theory of distributed computing is whether one can device [sic] highly fault tolerant protocols which can tolerate both processor failures as well as transient errors. To answer this question we consider the construction of self-stabilizing wait-free shared memory objects. These objects occur naturally in distributed systems in which both processors and memory may be faulty. Our contribution in this paper is threefold. First, we propose a general definition of a self-stabilizing wait-free shared memory object that expresses safety guarantees even in the face of processor failures. Second, we show that within this framework one cannot construct a self-stabilizing single-reader single-writer regular bit from single-reader single-writer safe bits. This result leads us to postulate a self-stabilizing dual-reader single-writer safe bit with which, as a third contribution, we construct self-stabilizing regular and atomic registers."

Download or read book Fault tolerant Distributed Shared Memory on a Broadcast based Interconnection Architecture written by Diana Lynn Hecht and published by . This book was released on 2002 with total page 268 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Performance and Dependability Analysis of Fault tolerant Layered Distributed Systems written by and published by . This book was released on 1998 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Low Cost Management of Replicated Data in Fault tolerant Distributed Systems written by Kenneth P. Birman and published by . This book was released on 1984 with total page 18 pages. Available in PDF, EPUB and Kindle. Book excerpt: