menu
{ "item_title" : "Concurrent Crash-Prone Shared Memory Systems", "item_author" : [" Michel Raynal "], "item_description" : "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.", "item_img_path" : "https://covers3.booksamillion.com/covers/bam/3/03/179/201/3031792017_b.jpg", "price_data" : { "retail_price" : "64.99", "online_price" : "64.99", "our_price" : "64.99", "club_price" : "64.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Concurrent Crash-Prone Shared Memory Systems|Michel Raynal

Concurrent Crash-Prone Shared Memory Systems : A Few Theoretical Notions

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9783031792014
  • ISBN-10: 3031792017
  • Publisher: Springer
  • Publish Date: March 2022
  • Dimensions: 9.25 x 7.5 x 0.3 inches
  • Shipping Weight: 0.56 pounds
  • Page Count: 115

Related Categories

You May Also Like...

    1

BAM Customer Reviews