Central Library

Normal view MARC view ISBD view

Concurrent Crash-Prone Shared Memory Systems [electronic resource] : A Few Theoretical Notions / by Michel Raynal.

By: Raynal, Michel [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Synthesis Lectures on Distributed Computing Theory: Publisher: Cham : Springer International Publishing : Imprint: Springer, 2022Edition: 1st ed. 2022.Description: XXIII, 115 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783031792137.Subject(s): Computer science | Coding theory | Information theory | Data structures (Computer science) | Computer Science | Coding and Information Theory | Data Structures and Information TheoryAdditional physical formats: Printed edition:: No title; Printed edition:: No title; Printed edition:: No titleDDC classification: 004 Online resources: Click here to access online
Contents:
List of Figures -- List of Algorithms -- List of Tables -- Preface -- Acknowledgments -- Distributed Universality -- Distributed Recursivity -- The BG Simulation -- Anonymity -- Bibliography -- Author's Biography -- Index.
In: Springer Nature eBookSummary: 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.
    average rating: 0.0 (0 votes)
No physical items for this record

List of Figures -- List of Algorithms -- List of Tables -- Preface -- Acknowledgments -- Distributed Universality -- Distributed Recursivity -- The BG Simulation -- Anonymity -- Bibliography -- Author's Biography -- Index.

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.

There are no comments for this item.

Log in to your account to post a comment.