Fault-Tolerant Message-Passing Distributed Systems Algorithmic Approach by M

Description

The Nile on eBay Fault-Tolerant Message-Passing Distributed Systems by Michel Raynal 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. FORMAT Paperback LANGUAGE English CONDITION Brand New Publisher Description 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. Back Cover 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. Table of Contents Part I: Introductory : Chapter: a Few Definitions and Two Examples.- Part II : I The Reliable Broadcast Communication Abstraction.- Reliable Broadcast in the Presence of Process Crash Failures.- Reliable Broadcast in the Presence of Process Crashes and Unreliable Channels.- Reliable Broadcast in the Presence of Byzantine Processes.- Part III : The Read/Write Register Communication Abstraction.- The Read/Write Register Abstraction.- Building Read/Write Registers Despite Asynchrony and Less Than Half of Processes Crash (t < n/2).- Circumventing the t < n/2 Read/Write Register Impossibility: the Failure Detector Approach.- A Broadcast Abstraction Suited to the Family of Read/Write Implementable Objects.- Atomic Read/Write Registers in the Presence of Byzantine Processes.- Part IV: Agreement in Synchronous Systems.- Consensus and Interactive Consistency in Synchronous Systems Prone to Process Crash Failures.- Expedite Decision in Synchronous Systems with Process Crash Failures.- Consensus Variants: Simultaneous Consensus and k-Set Agreement.- Non-blocking Atomic Commit in Synchronous Systems with Process Crash Failures.- Consensus in Synchronous Systems Prone to Byzantine Process Failures.- Part V: Agreement in Asynchronous Systems.- Implementable Agreement Abstractions Despite Asynchrony and a Minority of Process Crashes.- Consensus: Power and Implementability Limit in Crash-Prone Asynchronous Systems.- Implementing Consensus in Enriched Crash-Prone Asynchronous Systems.- Implementing Oracles in Asynchronous Systems with Process Crash Failures.- Implementing Consensus in Enriched Byzantine Asynchronous Systems.-Part VI : Appendix - Bibliography.- Index. Long Description 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. Feature Author among the world's leading researchers in distributed computing Useful for graduate students and researchers in distributed systems Content supplemented throughout with exercises, summaries, and bibliographic notes Details ISBN 303006803X Author Michel Raynal Language English ISBN-10 303006803X ISBN-13 9783030068035 Format Paperback Subtitle An Algorithmic Approach DEWEY 004.0151 Imprint Springer Nature Switzerland AG Place of Publication Cham Country of Publication Switzerland Pages 459 Year 2018 Publication Date 2018-12-29 Short Title Fault-Tolerant Message-Passing Distributed Systems UK Release Date 2018-12-29 Illustrations XXXI, 459 p. Edited by Emma Robinson Birth 1974 Affiliation European University Viadrina, Germany Position journalist Qualifications Ph.D. Publisher Springer Nature Switzerland AG Alternative 9783319941400 Audience Professional & Vocational Edition Description Softcover Reprint of the Original 1st 2018 ed. We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! TheNile_Item_ID:131019641;