Introduction to distributed algorithms:
Distributed algorithms have been the subject of intense development over the last twenty years. The second edition of this successful textbook provides an up-to-date introduction both to the topic, and to the theory behind the algorithms. The clear presentation makes the book suitable for advanced u...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2000
|
| Ausgabe: | Second edition |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 URL des Erstveröffentlichers |
| Zusammenfassung: | Distributed algorithms have been the subject of intense development over the last twenty years. The second edition of this successful textbook provides an up-to-date introduction both to the topic, and to the theory behind the algorithms. The clear presentation makes the book suitable for advanced undergraduate or graduate courses, whilst the coverage is sufficiently deep to make it useful for practising engineers and researchers. The author concentrates on algorithms for the point-to-point message passing model, and includes algorithms for the implementation of computer communication networks. Other key areas discussed are algorithms for the control of distributed applications (wave, broadcast, election, termination detection, randomized algorithms for anonymous networks, snapshots, deadlock detection, synchronous systems), and fault-tolerance achievable by distributed algorithms. The two new chapters on sense of direction and failure detectors are state-of-the-art and will provide an entry to research in these still-developing topics |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (xii, 596 pages) |
| ISBN: | 9781139168724 |
| DOI: | 10.1017/CBO9781139168724 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043942846 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2000 |||| o||u| ||||||eng d | ||
| 020 | |a 9781139168724 |c Online |9 978-1-139-16872-4 | ||
| 024 | 7 | |a 10.1017/CBO9781139168724 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781139168724 | ||
| 035 | |a (OCoLC)992932374 | ||
| 035 | |a (DE-599)BVBBV043942846 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 005.2/76 |2 21 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Tel, Gerard |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Introduction to distributed algorithms |c Gerard Tel |
| 250 | |a Second edition | ||
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2000 | |
| 300 | |a 1 online resource (xii, 596 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 505 | 8 | 0 | |g 1 |g 1 |t Introduction: Distributed Systems |g 1.2 |g 18 |t Architecture and Languages |g 1.3 |g 26 |t Distributed Algorithms |g 1.4 |g 36 |t Outline of the Book |g Part 1 |g 41 |t Protocols |g 2 |g 43 |t Model |g 2.1 |g 44 |t Transition Systems and Algorithms |g 2.2 |g 50 |t Proving Properties of Transition Systems |g 2.3 |g 54 |t Causal Order of Events and Logical Clocks |g 2.4 |g 64 |t Additional Assumptions, Complexity |g 3 |g 74 |t Communication Protocols |g 3.1 |g 76 |t Balanced Sliding-window Protocol |g 3.2 |g 85 |t A Timer-based Protocol |g 4 |g 103 |t Routing Algorithms |g 4.1 |g 105 |t Destination-based Routing |g 4.2 |g 110 |t All-pairs Shortest-path Problem |g 4.3 |g 123 |t Netchange Algorithm |g 4.4 |g 132 |t Routing with Compact Routing Tables |g 4.5 |g 149 |t Hierarchical Routing |g 5 |g 155 |t Deadlock-free Packet Switching |g 5.2 |g 158 |t Structured Solutions |g 5.3 |g 167 |t Unstructured Solutions |g Part 2 |g 179 |t Fundamental Algorithms |g 6 |t Wave and Traversal Algorithms |t Definition and Use of Wave Algorithms |t A Collection of Wave Algorithms |t Traversal Algorithms |t Time Complexity: Depth-first Search |t Election Algorithms |t Ring Networks |t Arbitrary Networks |t Korach-Kutten-Moran Algorithm |t Termination Detection |t Computation Trees and Forests |t Wave-based Solutions |t Anonymous Networks |t Deterministic Algorithms |t A Probabilistic Election Algorithm |t Computing the Network Size |t Snapshots |t Two Snapshot Algorithms |t Using Snapshot Algorithms |t Application: Deadlock Detection |t Sense of Direction and Orientation |t Election in Rings and Chordal Rings |t Computing in Hypercubes |9 |g 181 -- |g 6.1 |g 182 -- |g 6.2 |g 190 -- |g 6.3 |g 202 -- |g 6.4 |g 208 -- |g 7 |g 227 -- |g 7.2 |g 232 -- |g 7.3 |g 245 -- |g 7.4 |g 260 -- |g 8 |g 268 -- |g 8.2 |g 276 -- |g 8.3 |g 284 -- |g 9 |g 307 -- |g 9.2 |g 317 -- |g 9.3 |g 323 -- |g 9.4 |g 327 -- |g 10 |g 335 -- |g 10.2 |g 340 -- |g 10.3 |g 344 -- |g 10.4 |g 349 -- |g 11 |g 356 -- |g 11.2 |g 364 -- |g 11.3 |g 374 -- |g 11.4 |
| 505 | 8 | 0 | |t Complexity-related Issues |t Synchrony in Networks |t Election in Synchronous Networks |t Synchronizer Algorithms |t Application: Breadth-first Search |t Archimedean Assumption |t Fault Tolerance |t Fault Tolerance in Distributed Systems |t Reasons for Using Fault-tolerant Algorithms |t Robust Algorithms |t Stabilizing Algorithms |t Fault Tolerance in Asynchronous Systems |t Impossibility of Consensus |t Initially Dead Processes |t Deterministically Achievable Cases |t Probabilistic Consensus Algorithms |t Weak Termination |t Fault Tolerance in Synchronous Systems |t Synchronous Decision Protocols |t Authenticating Protocols |t Clock Synchronization |t Failure Detection |9 |g 386 -- |g 12 |g 396 -- |g 12.2 |g 404 -- |g 12.3 |g 408 -- |g 12.4 |g 414 -- |g 12.5 |g 420 -- |g Part 3 |g 425 -- |g 13 |g 427 -- |g 13.1 |g 427 -- |g 13.2 |g 429 -- |g 13.3 |g 435 -- |g 14 |g 437 -- |g 14.1 |g 437 -- |g 14.2 |g 442 -- |g 14.3 |g 445 -- |g 14.4 |g 451 -- |g 14.5 |g 462 -- |g 15 |g 469 -- |g 15.1 |g 470 -- |g 15.2 |g 481 -- |g 15.3 |g 493 -- |g 16 |g 505 -- |t Solving Consensus with a Weakly Accurate Detector |t Eventually Weakly Accurate Detectors |t Implementation of Failure Detectors |t Stabilization |t Graph Algorithms |t Methodology for Stabilization |t A Pseudocode Conventions |t Graphs and Networks |9 |g 16.2 |g 510 -- |g 16.3 |g 511 -- |g 16.4 |g 515 -- |g 17 |g 520 -- |g 17.2 |g 526 -- |g 17.3 |g 535 -- |g 551 -- |g B |g 556 |
| 520 | |a Distributed algorithms have been the subject of intense development over the last twenty years. The second edition of this successful textbook provides an up-to-date introduction both to the topic, and to the theory behind the algorithms. The clear presentation makes the book suitable for advanced undergraduate or graduate courses, whilst the coverage is sufficiently deep to make it useful for practising engineers and researchers. The author concentrates on algorithms for the point-to-point message passing model, and includes algorithms for the implementation of computer communication networks. Other key areas discussed are algorithms for the control of distributed applications (wave, broadcast, election, termination detection, randomized algorithms for anonymous networks, snapshots, deadlock detection, synchronous systems), and fault-tolerance achievable by distributed algorithms. The two new chapters on sense of direction and failure detectors are state-of-the-art and will provide an entry to research in these still-developing topics | ||
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Electronic data processing / Distributed processing / Congresses | |
| 650 | 4 | |a Computer algorithms / Congresses | |
| 650 | 0 | 7 | |a Verteilter Algorithmus |0 (DE-588)4200453-6 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Verteilter Algorithmus |0 (DE-588)4200453-6 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-79483-1 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9781139168724 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029351816 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9781139168724 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9781139168724 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176886198173696 |
|---|---|
| any_adam_object | |
| author | Tel, Gerard |
| author_facet | Tel, Gerard |
| author_role | aut |
| author_sort | Tel, Gerard |
| author_variant | g t gt |
| building | Verbundindex |
| bvnumber | BV043942846 |
| classification_rvk | ST 130 ST 134 |
| collection | ZDB-20-CBO |
| contents | Introduction: Distributed Systems Architecture and Languages Distributed Algorithms Outline of the Book Protocols Model Transition Systems and Algorithms Proving Properties of Transition Systems Causal Order of Events and Logical Clocks Additional Assumptions, Complexity Communication Protocols Balanced Sliding-window Protocol A Timer-based Protocol Routing Algorithms Destination-based Routing All-pairs Shortest-path Problem Netchange Algorithm Routing with Compact Routing Tables Hierarchical Routing Deadlock-free Packet Switching Structured Solutions Unstructured Solutions Fundamental Algorithms Wave and Traversal Algorithms Definition and Use of Wave Algorithms A Collection of Wave Algorithms Traversal Algorithms Time Complexity: Depth-first Search Election Algorithms Ring Networks Arbitrary Networks Korach-Kutten-Moran Algorithm Termination Detection Computation Trees and Forests Wave-based Solutions Anonymous Networks Deterministic Algorithms A Probabilistic Election Algorithm Computing the Network Size Snapshots Two Snapshot Algorithms Using Snapshot Algorithms Application: Deadlock Detection Sense of Direction and Orientation Election in Rings and Chordal Rings Computing in Hypercubes Complexity-related Issues Synchrony in Networks Election in Synchronous Networks Synchronizer Algorithms Application: Breadth-first Search Archimedean Assumption Fault Tolerance Fault Tolerance in Distributed Systems Reasons for Using Fault-tolerant Algorithms Robust Algorithms Stabilizing Algorithms Fault Tolerance in Asynchronous Systems Impossibility of Consensus Initially Dead Processes Deterministically Achievable Cases Probabilistic Consensus Algorithms Weak Termination Fault Tolerance in Synchronous Systems Synchronous Decision Protocols Authenticating Protocols Clock Synchronization Failure Detection Solving Consensus with a Weakly Accurate Detector Eventually Weakly Accurate Detectors Implementation of Failure Detectors Stabilization Graph Algorithms Methodology for Stabilization A Pseudocode Conventions Graphs and Networks |
| ctrlnum | (ZDB-20-CBO)CR9781139168724 (OCoLC)992932374 (DE-599)BVBBV043942846 |
| dewey-full | 005.2/76 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.2/76 |
| dewey-search | 005.2/76 |
| dewey-sort | 15.2 276 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1017/CBO9781139168724 |
| edition | Second edition |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>06114nmm a2200529zc 4500</leader><controlfield tag="001">BV043942846</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2000 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139168724</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-139-16872-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9781139168724</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781139168724</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)992932374</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043942846</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.2/76</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Tel, Gerard</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Introduction to distributed algorithms</subfield><subfield code="c">Gerard Tel</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Second edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xii, 596 pages)</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">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="505" ind1="8" ind2="0"><subfield code="g">1</subfield><subfield code="g">1</subfield><subfield code="t">Introduction: Distributed Systems</subfield><subfield code="g">1.2</subfield><subfield code="g">18</subfield><subfield code="t">Architecture and Languages</subfield><subfield code="g">1.3</subfield><subfield code="g">26</subfield><subfield code="t">Distributed Algorithms</subfield><subfield code="g">1.4</subfield><subfield code="g">36</subfield><subfield code="t">Outline of the Book</subfield><subfield code="g">Part 1</subfield><subfield code="g">41</subfield><subfield code="t">Protocols</subfield><subfield code="g">2</subfield><subfield code="g">43</subfield><subfield code="t">Model</subfield><subfield code="g">2.1</subfield><subfield code="g">44</subfield><subfield code="t">Transition Systems and Algorithms</subfield><subfield code="g">2.2</subfield><subfield code="g">50</subfield><subfield code="t">Proving Properties of Transition Systems</subfield><subfield code="g">2.3</subfield><subfield code="g">54</subfield><subfield code="t">Causal Order of Events and Logical Clocks</subfield><subfield code="g">2.4</subfield><subfield code="g">64</subfield><subfield code="t">Additional Assumptions, Complexity</subfield><subfield code="g">3</subfield><subfield code="g">74</subfield><subfield code="t">Communication Protocols</subfield><subfield code="g">3.1</subfield><subfield code="g">76</subfield><subfield code="t">Balanced Sliding-window Protocol</subfield><subfield code="g">3.2</subfield><subfield code="g">85</subfield><subfield code="t">A Timer-based Protocol</subfield><subfield code="g">4</subfield><subfield code="g">103</subfield><subfield code="t">Routing Algorithms</subfield><subfield code="g">4.1</subfield><subfield code="g">105</subfield><subfield code="t">Destination-based Routing</subfield><subfield code="g">4.2</subfield><subfield code="g">110</subfield><subfield code="t">All-pairs Shortest-path Problem</subfield><subfield code="g">4.3</subfield><subfield code="g">123</subfield><subfield code="t">Netchange Algorithm</subfield><subfield code="g">4.4</subfield><subfield code="g">132</subfield><subfield code="t">Routing with Compact Routing Tables</subfield><subfield code="g">4.5</subfield><subfield code="g">149</subfield><subfield code="t">Hierarchical Routing</subfield><subfield code="g">5</subfield><subfield code="g">155</subfield><subfield code="t">Deadlock-free Packet Switching</subfield><subfield code="g">5.2</subfield><subfield code="g">158</subfield><subfield code="t">Structured Solutions</subfield><subfield code="g">5.3</subfield><subfield code="g">167</subfield><subfield code="t">Unstructured Solutions</subfield><subfield code="g">Part 2</subfield><subfield code="g">179</subfield><subfield code="t">Fundamental Algorithms</subfield><subfield code="g">6</subfield><subfield code="t">Wave and Traversal Algorithms</subfield><subfield code="t">Definition and Use of Wave Algorithms</subfield><subfield code="t">A Collection of Wave Algorithms</subfield><subfield code="t">Traversal Algorithms</subfield><subfield code="t">Time Complexity: Depth-first Search</subfield><subfield code="t">Election Algorithms</subfield><subfield code="t">Ring Networks</subfield><subfield code="t">Arbitrary Networks</subfield><subfield code="t">Korach-Kutten-Moran Algorithm</subfield><subfield code="t">Termination Detection</subfield><subfield code="t">Computation Trees and Forests</subfield><subfield code="t">Wave-based Solutions</subfield><subfield code="t">Anonymous Networks</subfield><subfield code="t">Deterministic Algorithms</subfield><subfield code="t">A Probabilistic Election Algorithm</subfield><subfield code="t">Computing the Network Size</subfield><subfield code="t">Snapshots</subfield><subfield code="t">Two Snapshot Algorithms</subfield><subfield code="t">Using Snapshot Algorithms</subfield><subfield code="t">Application: Deadlock Detection</subfield><subfield code="t">Sense of Direction and Orientation</subfield><subfield code="t">Election in Rings and Chordal Rings</subfield><subfield code="t">Computing in Hypercubes</subfield><subfield code="9"> </subfield><subfield code="g">181 --</subfield><subfield code="g">6.1</subfield><subfield code="g">182 --</subfield><subfield code="g">6.2</subfield><subfield code="g">190 --</subfield><subfield code="g">6.3</subfield><subfield code="g">202 --</subfield><subfield code="g">6.4</subfield><subfield code="g">208 --</subfield><subfield code="g">7</subfield><subfield code="g">227 --</subfield><subfield code="g">7.2</subfield><subfield code="g">232 --</subfield><subfield code="g">7.3</subfield><subfield code="g">245 --</subfield><subfield code="g">7.4</subfield><subfield code="g">260 --</subfield><subfield code="g">8</subfield><subfield code="g">268 --</subfield><subfield code="g">8.2</subfield><subfield code="g">276 --</subfield><subfield code="g">8.3</subfield><subfield code="g">284 --</subfield><subfield code="g">9</subfield><subfield code="g">307 --</subfield><subfield code="g">9.2</subfield><subfield code="g">317 --</subfield><subfield code="g">9.3</subfield><subfield code="g">323 --</subfield><subfield code="g">9.4</subfield><subfield code="g">327 --</subfield><subfield code="g">10</subfield><subfield code="g">335 --</subfield><subfield code="g">10.2</subfield><subfield code="g">340 --</subfield><subfield code="g">10.3</subfield><subfield code="g">344 --</subfield><subfield code="g">10.4</subfield><subfield code="g">349 --</subfield><subfield code="g">11</subfield><subfield code="g">356 --</subfield><subfield code="g">11.2</subfield><subfield code="g">364 --</subfield><subfield code="g">11.3</subfield><subfield code="g">374 --</subfield><subfield code="g">11.4</subfield></datafield><datafield tag="505" ind1="8" ind2="0"><subfield code="t">Complexity-related Issues</subfield><subfield code="t">Synchrony in Networks</subfield><subfield code="t">Election in Synchronous Networks</subfield><subfield code="t">Synchronizer Algorithms</subfield><subfield code="t">Application: Breadth-first Search</subfield><subfield code="t">Archimedean Assumption</subfield><subfield code="t">Fault Tolerance</subfield><subfield code="t">Fault Tolerance in Distributed Systems</subfield><subfield code="t">Reasons for Using Fault-tolerant Algorithms</subfield><subfield code="t">Robust Algorithms</subfield><subfield code="t">Stabilizing Algorithms</subfield><subfield code="t">Fault Tolerance in Asynchronous Systems</subfield><subfield code="t">Impossibility of Consensus</subfield><subfield code="t">Initially Dead Processes</subfield><subfield code="t">Deterministically Achievable Cases</subfield><subfield code="t">Probabilistic Consensus Algorithms</subfield><subfield code="t">Weak Termination</subfield><subfield code="t">Fault Tolerance in Synchronous Systems</subfield><subfield code="t">Synchronous Decision Protocols</subfield><subfield code="t">Authenticating Protocols</subfield><subfield code="t">Clock Synchronization</subfield><subfield code="t">Failure Detection</subfield><subfield code="9"> </subfield><subfield code="g">386 --</subfield><subfield code="g">12</subfield><subfield code="g">396 --</subfield><subfield code="g">12.2</subfield><subfield code="g">404 --</subfield><subfield code="g">12.3</subfield><subfield code="g">408 --</subfield><subfield code="g">12.4</subfield><subfield code="g">414 --</subfield><subfield code="g">12.5</subfield><subfield code="g">420 --</subfield><subfield code="g">Part 3</subfield><subfield code="g">425 --</subfield><subfield code="g">13</subfield><subfield code="g">427 --</subfield><subfield code="g">13.1</subfield><subfield code="g">427 --</subfield><subfield code="g">13.2</subfield><subfield code="g">429 --</subfield><subfield code="g">13.3</subfield><subfield code="g">435 --</subfield><subfield code="g">14</subfield><subfield code="g">437 --</subfield><subfield code="g">14.1</subfield><subfield code="g">437 --</subfield><subfield code="g">14.2</subfield><subfield code="g">442 --</subfield><subfield code="g">14.3</subfield><subfield code="g">445 --</subfield><subfield code="g">14.4</subfield><subfield code="g">451 --</subfield><subfield code="g">14.5</subfield><subfield code="g">462 --</subfield><subfield code="g">15</subfield><subfield code="g">469 --</subfield><subfield code="g">15.1</subfield><subfield code="g">470 --</subfield><subfield code="g">15.2</subfield><subfield code="g">481 --</subfield><subfield code="g">15.3</subfield><subfield code="g">493 --</subfield><subfield code="g">16</subfield><subfield code="g">505 --</subfield><subfield code="t">Solving Consensus with a Weakly Accurate Detector</subfield><subfield code="t">Eventually Weakly Accurate Detectors</subfield><subfield code="t">Implementation of Failure Detectors</subfield><subfield code="t">Stabilization</subfield><subfield code="t">Graph Algorithms</subfield><subfield code="t">Methodology for Stabilization</subfield><subfield code="t">A Pseudocode Conventions</subfield><subfield code="t">Graphs and Networks</subfield><subfield code="9"> </subfield><subfield code="g">16.2</subfield><subfield code="g">510 --</subfield><subfield code="g">16.3</subfield><subfield code="g">511 --</subfield><subfield code="g">16.4</subfield><subfield code="g">515 --</subfield><subfield code="g">17</subfield><subfield code="g">520 --</subfield><subfield code="g">17.2</subfield><subfield code="g">526 --</subfield><subfield code="g">17.3</subfield><subfield code="g">535 --</subfield><subfield code="g">551 --</subfield><subfield code="g">B</subfield><subfield code="g">556</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Distributed algorithms have been the subject of intense development over the last twenty years. The second edition of this successful textbook provides an up-to-date introduction both to the topic, and to the theory behind the algorithms. The clear presentation makes the book suitable for advanced undergraduate or graduate courses, whilst the coverage is sufficiently deep to make it useful for practising engineers and researchers. The author concentrates on algorithms for the point-to-point message passing model, and includes algorithms for the implementation of computer communication networks. Other key areas discussed are algorithms for the control of distributed applications (wave, broadcast, election, termination detection, randomized algorithms for anonymous networks, snapshots, deadlock detection, synchronous systems), and fault-tolerance achievable by distributed algorithms. The two new chapters on sense of direction and failure detectors are state-of-the-art and will provide an entry to research in these still-developing topics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electronic data processing / Distributed processing / Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms / Congresses</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Verteilter Algorithmus</subfield><subfield code="0">(DE-588)4200453-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Verteilter Algorithmus</subfield><subfield code="0">(DE-588)4200453-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-79483-1</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9781139168724</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029351816</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781139168724</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</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.1017/CBO9781139168724</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Konferenzschrift |
| id | DE-604.BV043942846 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:18Z |
| institution | BVB |
| isbn | 9781139168724 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029351816 |
| oclc_num | 992932374 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xii, 596 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Tel, Gerard Verfasser aut Introduction to distributed algorithms Gerard Tel Second edition Cambridge Cambridge University Press 2000 1 online resource (xii, 596 pages) txt rdacontent c rdamedia cr rdacarrier Title from publisher's bibliographic system (viewed on 05 Oct 2015) 1 1 Introduction: Distributed Systems 1.2 18 Architecture and Languages 1.3 26 Distributed Algorithms 1.4 36 Outline of the Book Part 1 41 Protocols 2 43 Model 2.1 44 Transition Systems and Algorithms 2.2 50 Proving Properties of Transition Systems 2.3 54 Causal Order of Events and Logical Clocks 2.4 64 Additional Assumptions, Complexity 3 74 Communication Protocols 3.1 76 Balanced Sliding-window Protocol 3.2 85 A Timer-based Protocol 4 103 Routing Algorithms 4.1 105 Destination-based Routing 4.2 110 All-pairs Shortest-path Problem 4.3 123 Netchange Algorithm 4.4 132 Routing with Compact Routing Tables 4.5 149 Hierarchical Routing 5 155 Deadlock-free Packet Switching 5.2 158 Structured Solutions 5.3 167 Unstructured Solutions Part 2 179 Fundamental Algorithms 6 Wave and Traversal Algorithms Definition and Use of Wave Algorithms A Collection of Wave Algorithms Traversal Algorithms Time Complexity: Depth-first Search Election Algorithms Ring Networks Arbitrary Networks Korach-Kutten-Moran Algorithm Termination Detection Computation Trees and Forests Wave-based Solutions Anonymous Networks Deterministic Algorithms A Probabilistic Election Algorithm Computing the Network Size Snapshots Two Snapshot Algorithms Using Snapshot Algorithms Application: Deadlock Detection Sense of Direction and Orientation Election in Rings and Chordal Rings Computing in Hypercubes 181 -- 6.1 182 -- 6.2 190 -- 6.3 202 -- 6.4 208 -- 7 227 -- 7.2 232 -- 7.3 245 -- 7.4 260 -- 8 268 -- 8.2 276 -- 8.3 284 -- 9 307 -- 9.2 317 -- 9.3 323 -- 9.4 327 -- 10 335 -- 10.2 340 -- 10.3 344 -- 10.4 349 -- 11 356 -- 11.2 364 -- 11.3 374 -- 11.4 Complexity-related Issues Synchrony in Networks Election in Synchronous Networks Synchronizer Algorithms Application: Breadth-first Search Archimedean Assumption Fault Tolerance Fault Tolerance in Distributed Systems Reasons for Using Fault-tolerant Algorithms Robust Algorithms Stabilizing Algorithms Fault Tolerance in Asynchronous Systems Impossibility of Consensus Initially Dead Processes Deterministically Achievable Cases Probabilistic Consensus Algorithms Weak Termination Fault Tolerance in Synchronous Systems Synchronous Decision Protocols Authenticating Protocols Clock Synchronization Failure Detection 386 -- 12 396 -- 12.2 404 -- 12.3 408 -- 12.4 414 -- 12.5 420 -- Part 3 425 -- 13 427 -- 13.1 427 -- 13.2 429 -- 13.3 435 -- 14 437 -- 14.1 437 -- 14.2 442 -- 14.3 445 -- 14.4 451 -- 14.5 462 -- 15 469 -- 15.1 470 -- 15.2 481 -- 15.3 493 -- 16 505 -- Solving Consensus with a Weakly Accurate Detector Eventually Weakly Accurate Detectors Implementation of Failure Detectors Stabilization Graph Algorithms Methodology for Stabilization A Pseudocode Conventions Graphs and Networks 16.2 510 -- 16.3 511 -- 16.4 515 -- 17 520 -- 17.2 526 -- 17.3 535 -- 551 -- B 556 Distributed algorithms have been the subject of intense development over the last twenty years. The second edition of this successful textbook provides an up-to-date introduction both to the topic, and to the theory behind the algorithms. The clear presentation makes the book suitable for advanced undergraduate or graduate courses, whilst the coverage is sufficiently deep to make it useful for practising engineers and researchers. The author concentrates on algorithms for the point-to-point message passing model, and includes algorithms for the implementation of computer communication networks. Other key areas discussed are algorithms for the control of distributed applications (wave, broadcast, election, termination detection, randomized algorithms for anonymous networks, snapshots, deadlock detection, synchronous systems), and fault-tolerance achievable by distributed algorithms. The two new chapters on sense of direction and failure detectors are state-of-the-art and will provide an entry to research in these still-developing topics Datenverarbeitung Electronic data processing / Distributed processing / Congresses Computer algorithms / Congresses Verteilter Algorithmus (DE-588)4200453-6 gnd rswk-swf (DE-588)1071861417 Konferenzschrift gnd-content Verteilter Algorithmus (DE-588)4200453-6 s 1\p DE-604 Erscheint auch als Druckausgabe 978-0-521-79483-1 https://doi.org/10.1017/CBO9781139168724 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Tel, Gerard Introduction to distributed algorithms Introduction: Distributed Systems Architecture and Languages Distributed Algorithms Outline of the Book Protocols Model Transition Systems and Algorithms Proving Properties of Transition Systems Causal Order of Events and Logical Clocks Additional Assumptions, Complexity Communication Protocols Balanced Sliding-window Protocol A Timer-based Protocol Routing Algorithms Destination-based Routing All-pairs Shortest-path Problem Netchange Algorithm Routing with Compact Routing Tables Hierarchical Routing Deadlock-free Packet Switching Structured Solutions Unstructured Solutions Fundamental Algorithms Wave and Traversal Algorithms Definition and Use of Wave Algorithms A Collection of Wave Algorithms Traversal Algorithms Time Complexity: Depth-first Search Election Algorithms Ring Networks Arbitrary Networks Korach-Kutten-Moran Algorithm Termination Detection Computation Trees and Forests Wave-based Solutions Anonymous Networks Deterministic Algorithms A Probabilistic Election Algorithm Computing the Network Size Snapshots Two Snapshot Algorithms Using Snapshot Algorithms Application: Deadlock Detection Sense of Direction and Orientation Election in Rings and Chordal Rings Computing in Hypercubes Complexity-related Issues Synchrony in Networks Election in Synchronous Networks Synchronizer Algorithms Application: Breadth-first Search Archimedean Assumption Fault Tolerance Fault Tolerance in Distributed Systems Reasons for Using Fault-tolerant Algorithms Robust Algorithms Stabilizing Algorithms Fault Tolerance in Asynchronous Systems Impossibility of Consensus Initially Dead Processes Deterministically Achievable Cases Probabilistic Consensus Algorithms Weak Termination Fault Tolerance in Synchronous Systems Synchronous Decision Protocols Authenticating Protocols Clock Synchronization Failure Detection Solving Consensus with a Weakly Accurate Detector Eventually Weakly Accurate Detectors Implementation of Failure Detectors Stabilization Graph Algorithms Methodology for Stabilization A Pseudocode Conventions Graphs and Networks Datenverarbeitung Electronic data processing / Distributed processing / Congresses Computer algorithms / Congresses Verteilter Algorithmus (DE-588)4200453-6 gnd |
| subject_GND | (DE-588)4200453-6 (DE-588)1071861417 |
| title | Introduction to distributed algorithms |
| title_alt | Introduction: Distributed Systems Architecture and Languages Distributed Algorithms Outline of the Book Protocols Model Transition Systems and Algorithms Proving Properties of Transition Systems Causal Order of Events and Logical Clocks Additional Assumptions, Complexity Communication Protocols Balanced Sliding-window Protocol A Timer-based Protocol Routing Algorithms Destination-based Routing All-pairs Shortest-path Problem Netchange Algorithm Routing with Compact Routing Tables Hierarchical Routing Deadlock-free Packet Switching Structured Solutions Unstructured Solutions Fundamental Algorithms Wave and Traversal Algorithms Definition and Use of Wave Algorithms A Collection of Wave Algorithms Traversal Algorithms Time Complexity: Depth-first Search Election Algorithms Ring Networks Arbitrary Networks Korach-Kutten-Moran Algorithm Termination Detection Computation Trees and Forests Wave-based Solutions Anonymous Networks Deterministic Algorithms A Probabilistic Election Algorithm Computing the Network Size Snapshots Two Snapshot Algorithms Using Snapshot Algorithms Application: Deadlock Detection Sense of Direction and Orientation Election in Rings and Chordal Rings Computing in Hypercubes Complexity-related Issues Synchrony in Networks Election in Synchronous Networks Synchronizer Algorithms Application: Breadth-first Search Archimedean Assumption Fault Tolerance Fault Tolerance in Distributed Systems Reasons for Using Fault-tolerant Algorithms Robust Algorithms Stabilizing Algorithms Fault Tolerance in Asynchronous Systems Impossibility of Consensus Initially Dead Processes Deterministically Achievable Cases Probabilistic Consensus Algorithms Weak Termination Fault Tolerance in Synchronous Systems Synchronous Decision Protocols Authenticating Protocols Clock Synchronization Failure Detection Solving Consensus with a Weakly Accurate Detector Eventually Weakly Accurate Detectors Implementation of Failure Detectors Stabilization Graph Algorithms Methodology for Stabilization A Pseudocode Conventions Graphs and Networks |
| title_auth | Introduction to distributed algorithms |
| title_exact_search | Introduction to distributed algorithms |
| title_full | Introduction to distributed algorithms Gerard Tel |
| title_fullStr | Introduction to distributed algorithms Gerard Tel |
| title_full_unstemmed | Introduction to distributed algorithms Gerard Tel |
| title_short | Introduction to distributed algorithms |
| title_sort | introduction to distributed algorithms |
| topic | Datenverarbeitung Electronic data processing / Distributed processing / Congresses Computer algorithms / Congresses Verteilter Algorithmus (DE-588)4200453-6 gnd |
| topic_facet | Datenverarbeitung Electronic data processing / Distributed processing / Congresses Computer algorithms / Congresses Verteilter Algorithmus Konferenzschrift |
| url | https://doi.org/10.1017/CBO9781139168724 |
| work_keys_str_mv | AT telgerard introductiontodistributedalgorithms |