Concurrent Crash-Prone Shared Memory Systems (Record no. 85327)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03161nam a22005295i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-031-79213-7 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20240730164126.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 220601s2022 sz | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783031792137 |
| -- | 978-3-031-79213-7 |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 004 |
| 100 1# - AUTHOR NAME | |
| Author | Raynal, Michel. |
| 245 10 - TITLE STATEMENT | |
| Title | Concurrent Crash-Prone Shared Memory Systems |
| Sub Title | A Few Theoretical Notions / |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 2022. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | XXIII, 115 p. |
| 490 1# - SERIES STATEMENT | |
| Series statement | Synthesis Lectures on Distributed Computing Theory, |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Remark 2 | List of Figures -- List of Algorithms -- List of Tables -- Preface -- Acknowledgments -- Distributed Universality -- Distributed Recursivity -- The BG Simulation -- Anonymity -- Bibliography -- Author's Biography -- Index. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | 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. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | https://doi.org/10.1007/978-3-031-79213-7 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Cham : |
| -- | Springer International Publishing : |
| -- | Imprint: Springer, |
| -- | 2022. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Coding theory. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Information theory. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Data structures (Computer science). |
| 650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Coding and Information Theory. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Data Structures and Information Theory. |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| -- | 2155-1634 |
| 912 ## - | |
| -- | ZDB-2-SXSC |
No items available.