- We will send in 10–14 business days.
/images/books/13375943/9783838127293.jpg)
- Author: Robinson Peter
- Publisher: Sudwestdeutscher Verlag Fur Hochschulschriften AG
- Year: 2011
- Pages: 168
- ISBN-10: 3838127293
- ISBN-13: 9783838127293
- Format: 15.2 x 22.9 x 1 cm, softcover
- Language: English
- SAVE -10% with code: EXTRA
Weak System Models for Distributed Agreement Problems (e-book) (used book) | bookbook.eu
Reviews
Description
This book investigates theoretical aspects of system models for agreement problems in fault-tolerant distributed computing. A distributed system is a collection of processes that communicate with each other by sending messages over a network. Achieving agreement among these processes despite failures is a difficult but important problem. Care must be taken when choosing a system model as a too restrictive model will be applicable to very few systems, whereas too relaxed assumptions might severely reduce the set of problems that can be solved. Part I of this book provides an introduction to the context of this work, discusses related literature and describes the basic system assumptions. Part II introduces the Asynchronous Bounded-Cycle model which is entirely time-free but nevertheless sufficient to solve fault-tolerant consensus despite Byzantine faults. Part III presents an in-depth treatment of algorithms and models for solving the k-set agreement problem which requires processes to agree on at most k distinct values.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 20d.21:46:16
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Robinson Peter
- Publisher: Sudwestdeutscher Verlag Fur Hochschulschriften AG
- Year: 2011
- Pages: 168
- ISBN-10: 3838127293
- ISBN-13: 9783838127293
- Format: 15.2 x 22.9 x 1 cm, softcover
- Language: English English
This book investigates theoretical aspects of system models for agreement problems in fault-tolerant distributed computing. A distributed system is a collection of processes that communicate with each other by sending messages over a network. Achieving agreement among these processes despite failures is a difficult but important problem. Care must be taken when choosing a system model as a too restrictive model will be applicable to very few systems, whereas too relaxed assumptions might severely reduce the set of problems that can be solved. Part I of this book provides an introduction to the context of this work, discusses related literature and describes the basic system assumptions. Part II introduces the Asynchronous Bounded-Cycle model which is entirely time-free but nevertheless sufficient to solve fault-tolerant consensus despite Byzantine faults. Part III presents an in-depth treatment of algorithms and models for solving the k-set agreement problem which requires processes to agree on at most k distinct values.
Reviews