Concurrent Crash-Prone Shared Memory Systems : A Few Theoretical Notions
Book Details
Format
Paperback / Softback
ISBN-10
3031792017
ISBN-13
9783031792014
Publisher
Springer International Publishing AG
Imprint
Springer International Publishing AG
Country of Manufacture
GB
Country of Publication
GB
Publication Date
Mar 21st, 2022
Print length
115 Pages
Product Classification:
Information theoryCoding theory & cryptologyAlgorithms & data structuresComputer science
Ksh 9,900.00
Werezi Extended Catalogue
Delivery in 28 days
Delivery Location
Delivery fee: Select location
Delivery in 28 days
Secure
Quality
Fast
Theory is what remains true when technology is changing. So, it is important to know and master the basic concepts and the theoretical tools that underlie the design of the systems we are using today and the systems we will use tomorrow. This means that, given a computing model, we need to know what can be done and what cannot be done in that model. Considering systems built on top of an asynchronous read/write shared memory prone to process crashes, this monograph presents and develops the fundamental notions that are universal constructions, consensus numbers, distributed recursivity, power of the BG simulation, and what can be done when one has to cope with process anonymity and/or memory anonymity. Numerous distributed algorithms are presented, the aim of which is being to help the reader better understand the power and the subtleties of the notions that are presented. In addition, the reader can appreciate the simplicity and beauty of some of these algorithms.
Theory is what remains true when technology is changing. So, it is important to know and master the basic concepts and the theoretical tools that underlie the design of the systems we are using today and the systems we will use tomorrow. This means that, given a computing model, we need to know what can be done and what cannot be done in that model. Considering systems built on top of an asynchronous read/write shared memory prone to process crashes, this monograph presents and develops the fundamental notions that are universal constructions, consensus numbers, distributed recursivity, power of the BG simulation, and what can be done when one has to cope with process anonymity and/or memory anonymity. Numerous distributed algorithms are presented, the aim of which is being to help the reader better understand the power and the subtleties of the notions that are presented. In addition, the reader can appreciate the simplicity and beauty of some of these algorithms.
Get Concurrent Crash-Prone Shared Memory Systems by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Springer International Publishing AG and it has pages.
