國立虎尾科技大學 |

Concurrent Crash-Prone Shared Memory Systems = A Few Theoretical Notions /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Concurrent Crash-Prone Shared Memory Systems/ by Raynal Michel.
其他題名:	A Few Theoretical Notions /
作者:	Michel, Raynal.
面頁冊數:	XXIII, 115 p.online resource. :
Contained By:	Springer Nature eBook
標題:	Data Structures and Information Theory. -
電子資源:	https://doi.org/10.1007/978-3-031-79213-7
ISBN:	9783031792137

Concurrent Crash-Prone Shared Memory Systems = A Few Theoretical Notions /
Michel, Raynal.

Concurrent Crash-Prone Shared Memory SystemsA Few Theoretical Notions /[electronic resource] :by Raynal Michel. - 1st ed. 2022. - XXIII, 115 p.online resource. - Synthesis Lectures on Distributed Computing Theory,2155-1634. - Synthesis Lectures on Distributed Computing Theory,.

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.

ISBN: 9783031792137

Standard No.: 10.1007/978-3-031-79213-7doiSubjects--Topical Terms:

1211601
Data Structures and Information Theory.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004

Concurrent Crash-Prone Shared Memory Systems = A Few Theoretical Notions /
LDR:02546nam a22003855i 4500 001 1087000
003 DE-He213
005 20220601141056.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031792137 $9 978-3-031-79213-7
024 7 $a 10.1007/978-3-031-79213-7 $2 doi
035 $a 978-3-031-79213-7
050 4 $a QA75.5-76.95
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
082 0 4 $a 004 $2 23
100 1 $a Michel, Raynal. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1393921
245 1 0 $a Concurrent Crash-Prone Shared Memory Systems $h [electronic resource] : $b A Few Theoretical Notions / $c by Raynal Michel.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XXIII, 115 p. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Synthesis Lectures on Distributed Computing Theory, $x 2155-1634
505 0 $a 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 $a 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.
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Coding and Information Theory. $3 669784
650 1 4 $a Computer Science. $3 593922
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Information theory. $3 595305
650 0 $a Coding theory. $3 561460
650 0 $a Computer science. $3 573171
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031792250
776 0 8 $i Printed edition: $z 9783031792014
776 0 8 $i Printed edition: $z 9783031792373
830 0 $a Synthesis Lectures on Distributed Computing Theory, $x 2155-1634 $3 1390295
856 4 0 $u https://doi.org/10.1007/978-3-031-79213-7
912 $a ZDB-2-SXSC
950 $a Synthesis Collection of Technology (R0) (SpringerNature-85007)