Introduction to reliable and secure distributed programming:
Gespeichert in:
| Vorheriger Titel: | Guerraoui, Rachid Introduction to reliable distributed programming |
|---|---|
| Hauptverfasser: | , , |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin ; Heidelberg
Springer
2011
|
| Ausgabe: | 2. ed. |
| Schlagworte: | |
| Online-Zugang: | BTU01 FHA01 FHM01 FHN01 FKE01 UBA01 UBG01 UBM01 UBR01 UBT01 UBW01 UBY01 UPA01 Volltext Inhaltsverzeichnis |
| Beschreibung: | Literaturangaben |
| Beschreibung: | 1 Online-Ressource (XIX, 367 S.) graph. Darst. |
| ISBN: | 9783642152597 9783642152603 |
| DOI: | 10.1007/978-3-642-15260-3 |
Internformat
MARC
| LEADER | 00000nmm a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV037297468 | ||
| 003 | DE-604 | ||
| 005 | 20110511 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 110323s2011 gw |||| o||u| ||||||eng d | ||
| 016 | 7 | |a 1006645012 |2 DE-101 | |
| 020 | |a 9783642152597 |c Pp. : EUR 58.80 (freier Pr.), sfr 79.00 (freier Pr.) |9 978-3-642-15259-7 | ||
| 020 | |a 9783642152603 |c online |9 978-3-642-15260-3 | ||
| 024 | 7 | |a 10.1007/978-3-642-15260-3 |2 doi | |
| 035 | |a (OCoLC)846450513 | ||
| 035 | |a (DE-599)DNB1006645012 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-473 |a DE-M347 |a DE-20 |a DE-703 |a DE-19 |a DE-Aug4 |a DE-92 |a DE-384 |a DE-355 |a DE-859 |a DE-739 |a DE-706 |a DE-634 | ||
| 082 | 0 | |a 004.2 |2 22/ger | |
| 082 | 0 | |a 005.276 |2 22/ger | |
| 084 | |a ST 200 |0 (DE-625)143611: |2 rvk | ||
| 084 | |a 004 |2 sdnb | ||
| 100 | 1 | |a Cachin, Christian |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Introduction to reliable and secure distributed programming |c Christian Cachin ; Rachid Guerraoui ; Luís Rodrigues |
| 250 | |a 2. ed. | ||
| 264 | 1 | |a Berlin ; Heidelberg |b Springer |c 2011 | |
| 300 | |a 1 Online-Ressource (XIX, 367 S.) |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Literaturangaben | ||
| 650 | 0 | 7 | |a Byzantinische Einigung |0 (DE-588)4304923-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Zuverlässigkeit |0 (DE-588)4059245-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Verteilte Programmierung |0 (DE-588)4421492-3 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Verteilte Programmierung |0 (DE-588)4421492-3 |D s |
| 689 | 0 | 1 | |a Zuverlässigkeit |0 (DE-588)4059245-5 |D s |
| 689 | 0 | 2 | |a Byzantinische Einigung |0 (DE-588)4304923-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Guerraoui, Rachid |e Verfasser |4 aut | |
| 700 | 1 | |a Rodrigues, Luís |e Verfasser |4 aut | |
| 780 | 0 | 0 | |i 1. Auflage |a Guerraoui, Rachid |t Introduction to reliable distributed programming |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-15260-3 |x Verlag |3 Volltext |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=021209945&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 912 | |a ZDB-2-SCS | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-021209945 | ||
| 966 | e | |u https://doi.org/10.1007/978-3-642-15260-3 |l BTU01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-15260-3 |l FHA01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-15260-3 |l FHM01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-15260-3 |l FHN01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-15260-3 |l FKE01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-15260-3 |l UBA01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-15260-3 |l UBG01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-15260-3 |l UBM01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-15260-3 |l UBR01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-15260-3 |l UBT01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-15260-3 |l UBW01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-15260-3 |l UBY01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-15260-3 |l UPA01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804143934896603136 |
|---|---|
| adam_text | IMAGE 1
CONTENTS
1 INTRODUCTION 1
1.1 MOTIVATION 1
1.2 DISTRIBUTED PROGRAMMING ABSTRACTIONS 3
1.2.1 INHERENT DISTRIBUTION 4
1.2.2 DISTRIBUTION AS AN ARTIFACT 6
1.3 THE END-TO-END ARGUMENT 7
1.4 SOFTWARE COMPONENTS 8
1.4.1 COMPOSITION MODEL 8
1.4.2 PROGRAMMING INTERFACE 11
1.4.3 MODULES 13
1.5 CLASSES OF ALGORITHMS 16
1.6 CHAPTER NOTES 17
2 BASIC ABSTRACTIONS 19
2.1 DISTRIBUTED COMPUTATION 20
2.1.1 PROCESSES AND MESSAGES 20
2.1.2 AUTOMATA AND STEPS 20
2.1.3 SAFETY AND LIVENESS 22
2.2 ABSTRACTING PROCESSES 24
2.2.1 PROCESS FAILURES 24
2.2.2 CRASHES 24
2.2.3 OMISSIONS 26
2.2.4 CRASHES WITH RECOVERIES 26
2.2.5 EAVESDROPPING FAULTS 28
2.2.6 ARBITRARY FAULTS 29
2.3 CRYPTOGRAPHIC ABSTRACTIONS 30
2.3.1 HASH FUNCTIONS 30
2.3.2 MESSAGE-AUTHENTICATION CODES (MACS) 30
2.3.3 DIGITAL SIGNATURES 31
2.4 ABSTRACTING COMMUNICATION 32
2.4.1 LINK FAILURES 33
2.4.2 FAIR-LOSS LINKS 34
2.4.3 STUBBORN LINKS 35
2.4.4 PERFECT LINKS 37
2.4.5 LOGGED PERFECT LINKS 38
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1006645012
DIGITALISIERT DURCH
IMAGE 2
CONTENTS
2.4.6 AUTHENTICATED PERFECT LINKS 40
2.4.7 ON THE LINK ABSTRACTIONS 43
2.5 TIMING ASSUMPTIONS 44
2.5.1 ASYNCHRONOUS SYSTEM 44
2.5.2 SYNCHRONOUS SYSTEM 45
2.5.3 PARTIAL SYNCHRONY 47
2.6 ABSTRACTING TIME 48
2.6.1 FAILURE DETECTION 48
2.6.2 PERFECT FAILURE DETECTION 49
2.6.3 LEADER ELECTION 51
2.6.4 EVENTUALLY PERFECT FAILURE DETECTION 53
2.6.5 EVENTUAL LEADER ELECTION 56
2.6.6 BYZANTINE LEADER ELECTION 60
2.7 DISTRIBUTED-SYSTEM MODELS 63
2.7.1 COMBINING ABSTRACTIONS 63
2.7.2 SETUP 64
2.7.3 QUORUMS 65
2.7.4 MEASURING PERFORMANCE 65
2.8 EXERCISES 67
2.9 SOLUTIONS 68
2.10 CHAPTER NOTES 71
RELIABLE BROADCAST 73
3.1 MOTIVATION 73
3.1.1 CLIENT-SERVER COMPUTING 73
3.1.2 MULTIPARTICIPANT SYSTEMS 74
3.2 BEST-EFFORT BROADCAST 75
3.2.1 SPECIFICATION 75
3.2.2 FAIL-SILENT ALGORITHM: BASIC BROADCAST 76
3.3 REGULAR RELIABLE BROADCAST 77
3.3.1 SPECIFICATION 77
3.3.2 FAIL-STOP ALGORITHM: LAZY RELIABLE BROADCAST 78 3.3.3 FAIL-SILENT
ALGORITHM: EAGER RELIABLE BROADCAST 79 3.4 UNIFORM RELIABLE BROADCAST 81
3.4.1 SPECIFICATION 81
3.4.2 FAIL-STOP ALGORITHM: AIL-ACK UNIFORM RELIABLE BROADCAST 82
3.4.3 FAIL-SILENT ALGORITHM: MAJORITY-ACK UNIFORM RELIABLE BROADCAST 84
3.5 STUBBORN BROADCAST 85
3.5.1 SPECIFICATION 85
3.5.2 FAIL-RECOVERY ALGORITHM: BASIC STUBBORN BROADCAST 86 3.6 LOGGED
BEST-EFFORT BROADCAST 87
3.6.1 OVERVIEW 87
3.6.2 SPECIFICATION 88
3.6.3 FAIL-RECOVERY ALGORITHM: LOGGED BASIC BROADCAST 89
IMAGE 3
CONTENTS XV
3.7 LOGGED UNIFORM RELIABLE BROADCAST 90
3.7.1 SPECIFICATION 90
3.7.2 FAIL-RECOVERY ALGORITHM: LOGGED MAJORITY-ACK UNIFORM RELIABLE
BROADCAST 90 3.8 PROBABILISTIC BROADCAST 92
3.8.1 THE SCALABILITY OF RELIABLE BROADCAST 92
3.8.2 EPIDEMIC DISSEMINATION 93
3.8.3 SPECIFICATION 94
3.8.4 RANDOMIZED ALGORITHM: EAGER PROBABILISTIC BROADCAST 94 3.8.5
RANDOMIZED ALGORITHM: LAZY PROBABILISTIC BROADCAST 97 3.9 FIFO AND
CAUSAL BROADCAST 100
3.9.1 OVERVIEW 101
3.9.2 FIFO-ORDER SPECIFICATION 101
3.9.3 FAIL-SILENT ALGORITHM: BROADCAST WITH SEQUENCE NUMBER... 101 3.9.4
CAUSAL-ORDER SPECIFICATION 103
3.9.5 FAIL-SILENT ALGORITHM: NO-WAITING CAUSAL BROADCAST 104 3.9.6
FAIL-STOP ALGORITHM: GARBAGE-COLLECTION OF CAUSAL PAST . .. 106 3.9.7
FAIL-SILENT ALGORITHM: WAITING CAUSAL BROADCAST 108 3.10 BYZANTINE
CONSISTENT BROADCAST 110
3.10.1 MOTIVATION 110
3.10.2 SPECIFICATION I LL
3.10.3 FAIL-ARBITRARY ALGORITHM: AUTHENTICATED ECHO BROADCAST 112
3.10.4 FAIL-ARBITRARY ALGORITHM: SIGNED ECHO BROADCAST 114 3.11
BYZANTINE RELIABLE BROADCAST 116
3.11.1 SPECIFICATION 117
3.11.2 FAIL-ARBITRARY ALGORITHM: AUTHENTICATED DOUBLE-ECHO BROADCAST 117
3.12 BYZANTINE BROADCAST CHANNELS 120
3.12.1 SPECIFICATIONS 120
3.12.2 FAIL-ARBITRARY ALGORITHM: BYZANTINE CONSISTENT CHANNEL . .. 122
3.12.3 FAIL-ARBITRARY ALGORITHM: BYZANTINE RELIABLE CHANNEL 123 3.13
EXERCISES 124
3.14 SOLUTIONS 126
3.15 CHAPTER NOTES 134
4 SHARED MEMORY 137
4.1 INTRODUCTION 138
4.1.1 SHARED STORAGE IN A DISTRIBUTED SYSTEM 138
4.1.2 REGISTER OVERVIEW 138
4.1.3 COMPLETENESS AND PRECEDENCE 141
4.2 (1, N) REGULAR REGISTER 142
4.2.1 SPECIFICATION 142
4.2.2 FAIL-STOP ALGORITHM: READ-ONE WRITE-ALL REGULAR REGISTER 144
IMAGE 4
CONTENTS
4.2.3 FAIL-SILENT ALGORITHM:
MAJORITY VOTING REGULAR REGISTER 146
4.3 (1, N) ATOMIC REGISTER 149
4.3.1 SPECIFICATION 149
4.3.2 TRANSFORMATION: FROM (1, N) REGULAR TO (1, N) ATOMIC REGISTERS 151
4.3.3 FAIL-STOP ALGORITHM: READ-IMPOSE WRITE-ALL (1, AT) ATOMIC REGISTER
156 4.3.4 FAIL-SILENT ALGORITHM:
READ-IMPOSE WRITE-MAJORITY (1, N) ATOMIC REGISTER 157 4.4 (N, N) ATOMIC
REGISTER 159
4.4.1 MULTIPLE WRITERS 159
4.4.2 SPECIFICATION 160
4.4.3 TRANSFORMATION: FROM (1, TV) ATOMIC TO (N, N) ATOMIC REGISTERS 161
4.4.4 FAIL-STOP ALGORITHM: READ-IMPOSE WRITE-CONSULT-ALL (N, N) ATOMIC
REG 165 4.4.5 FAIL-SILENT ALGORITHM:
READ-IMPOSE WRITE-CONSULT-MAJORITY (N, N) ATOMIC REG 167
4.5 (1, N) LOGGED REGULAR REGISTER 170
4.5.1 PRECEDENCE IN THE FAIL-RECOVERY MODEL 170
4.5.2 SPECIFICATION 170
4.5.3 FAIL-RECOVERY ALGORITHM: LOGGED MAJORITY VOTING 172 4.6 (1, N)
BYZANTINE SAFE REGISTER 175
4.6.1 SPECIFICATION 176
4.6.2 FAIL-ARBITRARY ALGORITHM: BYZANTINE MASKING QUORUM 177 4.7 (1, N)
BYZANTINE REGULAR REGISTER 179
4.7.1 SPECIFICATION 179
4.7.2 FAIL-ARBITRARY ALGORITHM: AUTHENTICATED-DATA BYZANTINE QUORUM 180
4.7.3 FAIL-ARBITRARY ALGORITHM: DOUBLE-WRITE BYZANTINE QUORUM 182
4.8 (1, JV) BYZANTINE ATOMIC REGISTER 188
4.8.1 SPECIFICATION 189
4.8.2 FAIL-ARBITRARY ALGORITHM: BYZANTINE QUORUM WITH LISTENERS 189
4.9 EXERCISES 194
4.10 SOLUTIONS 195
4.11 CHAPTER NOTES 200
CONSENSUS 203
5.1 REGULAR CONSENSUS 204
5.1.1 SPECIFICATION 204
5.1.2 FAIL-STOP ALGORITHM: FLOODING CONSENSUS 205
5.1.3 FAIL-STOP ALGORITHM: HIERARCHICAL CONSENSUS 208
IMAGE 5
CONTENTS XVII
5.2 UNIFORM CONSENSUS 211
5.2.1 SPECIFICATION 211
5.2.2 FAIL-STOP ALGORITHM: FLOODING UNIFORM CONSENSUS 212 5.2.3
FAIL-STOP ALGORITHM: HIERARCHICAL UNIFORM CONSENSUS 213 5.3 UNIFORM
CONSENSUS IN THE FAIL-NOISY MODEL 216
5.3.1 OVERVIEW 216
5.3.2 EPOCH-CHANGE 217
5.3.3 EPOCH CONSENSUS 220
5.3.4 FAIL-NOISY ALGORITHM: LEADER-DRIVEN CONSENSUS 225 5.4 LOGGED
CONSENSUS 228
5.4.1 SPECIFICATION 228
5.4.2 LOGGED EPOCH-CHANGE 229
5.4.3 LOGGED EPOCH CONSENSUS 230
5.4.4 FAIL-RECOVERY ALGORITHM: LOGGED LEADER-DRIVEN CONSENSUS 234
5.5 RANDOMIZED CONSENSUS 235
5.5.1 SPECIFICATION 236
5.5.2 COMMON COIN 237
5.5.3 RANDOMIZED FAIL-SILENT ALGORITHM: RANDOMIZED BINARY CONSENSUS 238
5.5.4 RANDOMIZED FAIL-SILENT ALGORITHM: RANDOMIZED CONSENSUS WITH LARGE
DOMAIN 242 5.6 BYZANTINE CONSENSUS 244
5.6.1 SPECIFICATIONS 244
5.6.2 BYZANTINE EPOCH-CHANGE 246
5.6.3 BYZANTINE EPOCH CONSENSUS 248
5.6.4 FAIL-NOISY-ARBITRARY ALGORITHM: BYZANTINE LEADER-DRIVEN CONSENSUS
259
5.7 BYZANTINE RANDOMIZED CONSENSUS 261
5.7.1 SPECIFICATION 261
5.7.2 RANDOMIZED FAIL-ARBITRARY ALGORITHM: BYZANTINE RANDOMIZED BINARY
CONSENSUS 261
5.8 EXERCISES 266
5.9 SOLUTIONS 268
5.10 CHAPTER NOTES 277
6 CONSENSUS VARIANTS 281
6.1 TOTAL-ORDER BROADCAST 281
6.1.1 OVERVIEW 281
6.1.2 SPECIFICATIONS 283
6.1.3 FAIL-SILENT ALGORITHM: CONSENSUS-BASED TOTAL-ORDER BROADCAST 284
6.2 BYZANTINE TOTAL-ORDER BROADCAST 287
6.2.1 OVERVIEW 287
6.2.2 SPECIFICATION 288
IMAGE 6
XVIII CONTENTS
6.2.3 FAIL-NOISY-ARBITRARY ALGORITHM:
ROTATING SENDER BYZANTINE BROADCAST 288
6.3 TERMINATING RELIABLE BROADCAST 292
6.3.1 OVERVIEW 292
6.3.2 SPECIFICATION 293
6.3.3 FAIL-STOP ALGORITHM: CONSENSUS-BASED UNIFORM TERMINATING RELIABLE
BROADCAST 293
6.4 FAST CONSENSUS 296
6.4.1 OVERVIEW 296
6.4.2 SPECIFICATION 297
6.4.3 FAIL-SILENT ALGORITHM: FROM UNIFORM CONSENSUS TO UNIFORM FAST
CONSENSUS 297 6.5 FAST BYZANTINE CONSENSUS 300
6.5.1 OVERVIEW 300
6.5.2 SPECIFICATION 300
6.5.3 FAIL-ARBITRARY ALGORITHM: FROM BYZANTINE CONSENSUS TO FAST
BYZANTINE CONSENSUS . .. 300 6.6 NONBLOCKING ATOMIC COMMIT 303
6.6.1 OVERVIEW 303
6.6.2 SPECIFICATION 304
6.6.3 FAIL-STOP ALGORITHM: CONSENSUS-BASED NONBLOCKING ATOMIC COMMIT 304
6.7 GROUP MEMBERSHIP 307
6.7.1 OVERVIEW 307
6.7.2 SPECIFICATION 308
6.7.3 FAIL-STOP ALGORITHM: CONSENSUS-BASED GROUP MEMBERSHIP 309
6.8 VIEW-SYNCHRONOUS COMMUNICATION 311
6.8.1 OVERVIEW 311
6.8.2 SPECIFICATION 312
6.8.3 FAIL-STOP ALGORITHM: TRB-BASED VIEW-SYNCHRONOUS COMMUNICATION 314
6.8.4 FAIL-STOP ALGORITHM: CONSENSUS-BASED UNIFORM VIEW-SYNCHRONOUS
COMMUNICATION 319 6.9 EXERCISES 323
6.10 SOLUTIONS 324
6.11 CHAPTER NOTES 337
7 CONCLUDING REMARKS 341
7.1 IMPLEMENTATION IN APPIA 341
7.2 FURTHER IMPLEMENTATIONS 342
7.3 FURTHER READING 344
IMAGE 7
CONTENTS XIX
REFERENCES 347
LIST OF MODULES 355
LIST OF ALGORITHMS 357
INDEX 361
|
| any_adam_object | 1 |
| author | Cachin, Christian Guerraoui, Rachid Rodrigues, Luís |
| author_facet | Cachin, Christian Guerraoui, Rachid Rodrigues, Luís |
| author_role | aut aut aut |
| author_sort | Cachin, Christian |
| author_variant | c c cc r g rg l r lr |
| building | Verbundindex |
| bvnumber | BV037297468 |
| classification_rvk | ST 200 |
| collection | ZDB-2-SCS |
| ctrlnum | (OCoLC)846450513 (DE-599)DNB1006645012 |
| dewey-full | 004.2 005.276 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science 005 - Computer programming, programs, data, security |
| dewey-raw | 004.2 005.276 |
| dewey-search | 004.2 005.276 |
| dewey-sort | 14.2 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1007/978-3-642-15260-3 |
| edition | 2. ed. |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03505nmm a2200685 c 4500</leader><controlfield tag="001">BV037297468</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20110511 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">110323s2011 gw |||| o||u| ||||||eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1006645012</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642152597</subfield><subfield code="c">Pp. : EUR 58.80 (freier Pr.), sfr 79.00 (freier Pr.)</subfield><subfield code="9">978-3-642-15259-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642152603</subfield><subfield code="c">online</subfield><subfield code="9">978-3-642-15260-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-15260-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)846450513</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1006645012</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.2</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.276</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 200</subfield><subfield code="0">(DE-625)143611:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cachin, Christian</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Introduction to reliable and secure distributed programming</subfield><subfield code="c">Christian Cachin ; Rachid Guerraoui ; Luís Rodrigues</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ; Heidelberg</subfield><subfield code="b">Springer</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIX, 367 S.)</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Byzantinische Einigung</subfield><subfield code="0">(DE-588)4304923-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Zuverlässigkeit</subfield><subfield code="0">(DE-588)4059245-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Verteilte Programmierung</subfield><subfield code="0">(DE-588)4421492-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Verteilte Programmierung</subfield><subfield code="0">(DE-588)4421492-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Zuverlässigkeit</subfield><subfield code="0">(DE-588)4059245-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Byzantinische Einigung</subfield><subfield code="0">(DE-588)4304923-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Guerraoui, Rachid</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rodrigues, Luís</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="780" ind1="0" ind2="0"><subfield code="i">1. Auflage</subfield><subfield code="a">Guerraoui, Rachid</subfield><subfield code="t">Introduction to reliable distributed programming</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-15260-3</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=021209945&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-021209945</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-15260-3</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-15260-3</subfield><subfield code="l">FHA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-15260-3</subfield><subfield code="l">FHM01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-15260-3</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-15260-3</subfield><subfield code="l">FKE01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-15260-3</subfield><subfield code="l">UBA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-15260-3</subfield><subfield code="l">UBG01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-15260-3</subfield><subfield code="l">UBM01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-15260-3</subfield><subfield code="l">UBR01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-15260-3</subfield><subfield code="l">UBT01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-15260-3</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-15260-3</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-15260-3</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV037297468 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T22:55:33Z |
| institution | BVB |
| isbn | 9783642152597 9783642152603 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-021209945 |
| oclc_num | 846450513 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG DE-M347 DE-20 DE-703 DE-19 DE-BY-UBM DE-Aug4 DE-92 DE-384 DE-355 DE-BY-UBR DE-859 DE-739 DE-706 DE-634 |
| owner_facet | DE-473 DE-BY-UBG DE-M347 DE-20 DE-703 DE-19 DE-BY-UBM DE-Aug4 DE-92 DE-384 DE-355 DE-BY-UBR DE-859 DE-739 DE-706 DE-634 |
| physical | 1 Online-Ressource (XIX, 367 S.) graph. Darst. |
| psigel | ZDB-2-SCS |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Springer |
| record_format | marc |
| spelling | Cachin, Christian Verfasser aut Introduction to reliable and secure distributed programming Christian Cachin ; Rachid Guerraoui ; Luís Rodrigues 2. ed. Berlin ; Heidelberg Springer 2011 1 Online-Ressource (XIX, 367 S.) graph. Darst. txt rdacontent c rdamedia cr rdacarrier Literaturangaben Byzantinische Einigung (DE-588)4304923-0 gnd rswk-swf Zuverlässigkeit (DE-588)4059245-5 gnd rswk-swf Verteilte Programmierung (DE-588)4421492-3 gnd rswk-swf Verteilte Programmierung (DE-588)4421492-3 s Zuverlässigkeit (DE-588)4059245-5 s Byzantinische Einigung (DE-588)4304923-0 s DE-604 Guerraoui, Rachid Verfasser aut Rodrigues, Luís Verfasser aut 1. Auflage Guerraoui, Rachid Introduction to reliable distributed programming https://doi.org/10.1007/978-3-642-15260-3 Verlag Volltext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=021209945&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Cachin, Christian Guerraoui, Rachid Rodrigues, Luís Introduction to reliable and secure distributed programming Byzantinische Einigung (DE-588)4304923-0 gnd Zuverlässigkeit (DE-588)4059245-5 gnd Verteilte Programmierung (DE-588)4421492-3 gnd |
| subject_GND | (DE-588)4304923-0 (DE-588)4059245-5 (DE-588)4421492-3 |
| title | Introduction to reliable and secure distributed programming |
| title_auth | Introduction to reliable and secure distributed programming |
| title_exact_search | Introduction to reliable and secure distributed programming |
| title_full | Introduction to reliable and secure distributed programming Christian Cachin ; Rachid Guerraoui ; Luís Rodrigues |
| title_fullStr | Introduction to reliable and secure distributed programming Christian Cachin ; Rachid Guerraoui ; Luís Rodrigues |
| title_full_unstemmed | Introduction to reliable and secure distributed programming Christian Cachin ; Rachid Guerraoui ; Luís Rodrigues |
| title_old | Guerraoui, Rachid Introduction to reliable distributed programming |
| title_short | Introduction to reliable and secure distributed programming |
| title_sort | introduction to reliable and secure distributed programming |
| topic | Byzantinische Einigung (DE-588)4304923-0 gnd Zuverlässigkeit (DE-588)4059245-5 gnd Verteilte Programmierung (DE-588)4421492-3 gnd |
| topic_facet | Byzantinische Einigung Zuverlässigkeit Verteilte Programmierung |
| url | https://doi.org/10.1007/978-3-642-15260-3 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=021209945&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT cachinchristian introductiontoreliableandsecuredistributedprogramming AT guerraouirachid introductiontoreliableandsecuredistributedprogramming AT rodriguesluis introductiontoreliableandsecuredistributedprogramming |