| 000 | 03161nam a22005295i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-79213-7 | ||
| 003 | DE-He213 | ||
| 005 | 20240730164126.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 220601s2022 sz | s |||| 0|eng d | ||
| 020 |
_a9783031792137 _9978-3-031-79213-7 |
||
| 024 | 7 |
_a10.1007/978-3-031-79213-7 _2doi |
|
| 050 | 4 | _aQA75.5-76.95 | |
| 072 | 7 |
_aUY _2bicssc |
|
| 072 | 7 |
_aCOM000000 _2bisacsh |
|
| 072 | 7 |
_aUY _2thema |
|
| 082 | 0 | 4 |
_a004 _223 |
| 100 | 1 |
_aRaynal, Michel. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _982250 |
|
| 245 | 1 | 0 |
_aConcurrent Crash-Prone Shared Memory Systems _h[electronic resource] : _bA Few Theoretical Notions / _cby Michel Raynal. |
| 250 | _a1st ed. 2022. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2022. |
|
| 300 |
_aXXIII, 115 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aSynthesis Lectures on Distributed Computing Theory, _x2155-1634 |
|
| 505 | 0 | _aList of Figures -- List of Algorithms -- List of Tables -- Preface -- Acknowledgments -- Distributed Universality -- Distributed Recursivity -- The BG Simulation -- Anonymity -- Bibliography -- Author's Biography -- Index. | |
| 520 | _aTheory 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. | ||
| 650 | 0 |
_aComputer science. _99832 |
|
| 650 | 0 |
_aCoding theory. _94154 |
|
| 650 | 0 |
_aInformation theory. _914256 |
|
| 650 | 0 |
_aData structures (Computer science). _98188 |
|
| 650 | 1 | 4 |
_aComputer Science. _99832 |
| 650 | 2 | 4 |
_aCoding and Information Theory. _982251 |
| 650 | 2 | 4 |
_aData Structures and Information Theory. _931923 |
| 710 | 2 |
_aSpringerLink (Online service) _982252 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031792250 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031792014 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031792373 |
| 830 | 0 |
_aSynthesis Lectures on Distributed Computing Theory, _x2155-1634 _982253 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-79213-7 |
| 912 | _aZDB-2-SXSC | ||
| 942 | _cEBK | ||
| 999 |
_c85327 _d85327 |
||