Introduction to reliable and secure distributed programming

Gespeichert in:
Bibliographische Detailangaben
Vorheriger Titel:Guerraoui, Rachid Introduction to reliable distributed programming
Hauptverfasser: Cachin, Christian (VerfasserIn), Guerraoui, Rachid (VerfasserIn), Rodrigues, Luís (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Berlin [u.a.] Springer 2011
Ausgabe:2. ed.
Schlagworte:
Online-Zugang:Inhaltstext
Inhaltsverzeichnis
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!

MARC

LEADER 00000nam a2200000 c 4500
001 BV037365772
003 DE-604
005 20170221
007 t
008 110426s2011 gw d||| |||| 00||| eng d
015 |a 10,N37  |2 dnb 
015 |a 11,A10  |2 dnb 
020 |a 9783642152597  |c Hardcover  |9 978-3-642-15259-7 
020 |a 9783642152603  |c eBook  |9 978-3-642-15260-3 
024 3 |a 9783642152597 
028 5 2 |a 80021152 
035 |a (OCoLC)724144288 
035 |a (DE-599)BVBBV037365772 
040 |a DE-604  |b ger  |e rakddb 
041 0 |a eng 
044 |a gw  |c XA-DE-BE 
049 |a DE-634  |a DE-739  |a DE-11  |a DE-29T  |a DE-91G  |a DE-706  |a DE-83 
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 DAT 250f  |2 stub 
084 |a 004  |2 sdnb 
084 |a DAT 461f  |2 stub 
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 [u.a.]  |b Springer  |c 2011 
300 |a XIX, 367 S.  |b graph. Darst. 
336 |b txt  |2 rdacontent 
337 |b n  |2 rdamedia 
338 |b nc  |2 rdacarrier 
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 
650 0 7 |a Byzantinische Einigung  |0 (DE-588)4304923-0  |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 2 |m X:MVB  |q text/html  |u http://deposit.dnb.de/cgi-bin/dokserv?id=3534030&prov=M&dok_var=1&dok_ext=htm  |3 Inhaltstext 
856 4 2 |m Digitalisierung UB Passau  |q application/pdf  |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=022519227&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA  |3 Inhaltsverzeichnis 
943 1 |a oai:aleph.bib-bvb.de:BVB01-022519227 

Datensatz im Suchindex

DE-BY-TUM_call_number 0102/DAT 250f 2012 A 5093(2)
DE-BY-TUM_katkey 1865128
DE-BY-TUM_media_number 040071412174
_version_ 1816713785798295553
adam_text Contents Introduction . 1 1.1 Motivation. 1 1.2 Distributed Programming Abstractions . З 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 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 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: All- 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 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 . Ill 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 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, JV) Regular Register .142 4.2.1 Specification .142 4.2.2 Fail-Stop Algorithm: Read-One Write-All Regular Register .144 4.2.3 Fail-Silent Algorithm: Majority Voting Regular Register .146 4.3 (1, TV) Atomic Register .149 4.3.1 Specification .149 4.3.2 Transformation: From (1, TV) Regular to (1, TV) Atomic Registers .151 4.3.3 Fail-Stop Algorithm: Read-Impose Write-All (1, TV) Atomic Register .156 4.3.4 Fail-Silent Algorithm: Read-Impose Write-Majority (1, TV) Atomic Register .157 4.4 (TV, TV) Atomic Register .159 4.4.1 Multiple Writers .159 4.4.2 Specification .160 4.4.3 Transformation: From (1, TV) Atomic to (TV, TV) Atomic Registers .161 4.4.4 Fail-Stop Algorithm: Read-Impose Write-Consult-All (TV, TV) Atomic Reg .165 4.4.5 Fail-Silent Algorithm: Read-Impose Write-Consult-Majority (TV, TV) Atomic Reg .167 4.5 (1, TV) 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, TV) Byzantine Safe Register .175 4.6.1 Specification .176 4.6.2 Fail-Arbitrary Algorithm: Byzantine Masking Quorum .177 4.7 (1, TV) 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, TV) 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 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 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 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 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 BV037365772
classification_rvk ST 200
classification_tum DAT 250f
DAT 461f
ctrlnum (OCoLC)724144288
(DE-599)BVBBV037365772
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
edition 2. ed.
format Book
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV037365772</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170221</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">110426s2011 gw d||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">10,N37</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">11,A10</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642152597</subfield><subfield code="c">Hardcover</subfield><subfield code="9">978-3-642-15259-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642152603</subfield><subfield code="c">eBook</subfield><subfield code="9">978-3-642-15260-3</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642152597</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">80021152</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)724144288</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV037365772</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-634</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</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">DAT 250f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 461f</subfield><subfield code="2">stub</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 [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</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="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="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="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3534030&amp;prov=M&amp;dok_var=1&amp;dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&amp;doc_library=BVB01&amp;local_base=BVB01&amp;doc_number=022519227&amp;sequence=000002&amp;line_number=0001&amp;func_code=DB_RECORDS&amp;service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-022519227</subfield></datafield></record></collection>
id DE-604.BV037365772
illustrated Illustrated
indexdate 2024-11-25T17:37:10Z
institution BVB
isbn 9783642152597
9783642152603
language English
oai_aleph_id oai:aleph.bib-bvb.de:BVB01-022519227
oclc_num 724144288
open_access_boolean
owner DE-634
DE-739
DE-11
DE-29T
DE-91G
DE-BY-TUM
DE-706
DE-83
owner_facet DE-634
DE-739
DE-11
DE-29T
DE-91G
DE-BY-TUM
DE-706
DE-83
physical XIX, 367 S. graph. Darst.
publishDate 2011
publishDateSearch 2011
publishDateSort 2011
publisher Springer
record_format marc
spellingShingle Cachin, Christian
Guerraoui, Rachid
Rodrigues, Luís
Introduction to reliable and secure distributed programming
Zuverlässigkeit (DE-588)4059245-5 gnd
Verteilte Programmierung (DE-588)4421492-3 gnd
Byzantinische Einigung (DE-588)4304923-0 gnd
subject_GND (DE-588)4059245-5
(DE-588)4421492-3
(DE-588)4304923-0
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 Zuverlässigkeit (DE-588)4059245-5 gnd
Verteilte Programmierung (DE-588)4421492-3 gnd
Byzantinische Einigung (DE-588)4304923-0 gnd
topic_facet Zuverlässigkeit
Verteilte Programmierung
Byzantinische Einigung
url http://deposit.dnb.de/cgi-bin/dokserv?id=3534030&prov=M&dok_var=1&dok_ext=htm
http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=022519227&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv AT cachinchristian introductiontoreliableandsecuredistributedprogramming
AT guerraouirachid introductiontoreliableandsecuredistributedprogramming
AT rodriguesluis introductiontoreliableandsecuredistributedprogramming