Introduction to Reliable and Secure Distributed Programming - Paperback
$79.99
Quantity
01
Pay over time for orders over $35.00 with
Offers & Perks
Earn 79 points with this purchase
Added to your rewards balance after checkout.
100 points welcome bonus
Create an account and start with extra points.
Languages:EnglishPublisher:SpringerISBN-13:9783642423277ISBN-10:3642423272UPC:9783642423277Book Category:ComputersBook Subcategory:Computer Science, Operating Systems, ProgrammingBook Topic:AlgorithmsSize:9.21 x 6.14 x 0.80 inchesWeight:1.19Product ID:SCZ0R0MAH0
1. Introduction. - 1.1 Motivation. -1.2 Distributed Programming Abstractions. 1.3 The End-to-End Argument. 1.4 Software Components. - 1.5 Classes of Algorithms. -1.6 Chapter Notes. 2. Basic Abstractions. - 2.1 Distributed Computation. - 2.2 Abstracting Processes. - 2.3 Cryptographic Abstractions. - 2.4 Abstracting Communication. - 2.5 Timing Assumptions. - 2.6 Abstracting Time. - 2.7 Distributed-System Models. - 2.8 Exercises. - 2.9 Solutions. - 2.10 Chapter Notes . - . - 3. Reliable Broadcast. - 3.1 Motivation. - 3.2 Best-Effort Broadcast. - 3.3 Regular Reliable Broadcast. - 3.4 Uniform Reliable Broadcast. - 3.5 Stubborn Broadcast. - 3.6 Logged Best-Effort Broadcast. - 3.7 Logged Uniform Reliable Broadcast. - 3.8 Probabilistic Broadcast. - 3.9 FIFO and Causal Broadcast. - 3.10 Byzantine Consistent Broadcast. - 3.11 Byzantine Reliable Broadcast. - 3.12 Byzantine Broadcast Channels. - 3.13 Exercises. - 3.14 Solutions. - 3.15 Chapter Notes . - . - 4. Shared Memory. - 4.1 Introduction. - 4.2 (1, N) Regular Register. - 4.3 (1, N) Atomic Register. - 4.4 (N, N) Atomic Register. - 4.5 (1, N) Logged Regular Register. - 4.6 (1, N) Byzantine Safe Register. - 4.7 (1, N) Byzantine Regular Register. - 4.8 (1, N) Byzantine Atomic Register. - 4.9 Exercises. - 4.10 Solutions. - 4.11 Chapter Notes . - . - 5. Consensus. - 5.1 Regular Consensus. - 5.2 Uniform Consensus. - 5.3 Uniform Consensus in the Fail-Noisy Model. - 5.4 Logged Consensus. - 5.5 Randomized Consensus. - 5.6 Byzantine Consensus. - 5.7 Byzantine Randomized Consensus. - 5.8 Exercises. - 5.9 Solutions. - 5.10 Chapter Notes . - . - 6. Consensus Variants. - 6.1 Total-Order Broadcast. - 6.2 Byzantine Total-Order Broadcast. - 6.3 Terminating Reliable Broadcast. - 6.4 Fast Consensus. - 6.5 Fast Byzantine Consensus. - 6.6 Non-blocking Atomic Commit. - 6.7 Group Membership. - 6.8 View-Synchronous Communication. - 6.9 Exercises. - 6.10 Solutions. - 6.11 Chapter Notes . - . - 7. Concluding Remarks. - 7.1 Implementation in Appia. - 7.2 Further Implementations. - 7.3 Further Readi
Languages:EnglishPublisher:SpringerISBN-13:9783642423277ISBN-10:3642423272UPC:9783642423277Book Category:ComputersBook Subcategory:Computer Science, Operating Systems, ProgrammingBook Topic:AlgorithmsSize:9.21 x 6.14 x 0.80 inchesWeight:1.19Product ID:SCZ0R0MAH0
Rachid Guerraoui is Professor in the School of Computer and Communication Sciences (LPD), at EPFL in Lausanne, Switzerland. Luís E. T. Rodrigues is Professor (Professor Catedrático) at the Departamento de Engenharia Informática, Instituto Superior Técnico (IST), at the Universidade Técnica de Lisboa in Portugal. Christian Cachin works at IBM Research in Zurich, Switzerland.
Publisher: Springer
Edition
2nd 2011 Edition
Contributor(s)
Free shipping on orders over $75. Standard shipping takes 3-7 business days. Returns accepted within 30 days of purchase.