Distributed algorithms: an intuitive approach
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Cambridge, MA [u.a.]
MIT Pr.
2013
|
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Item Description: | Literaturverz. S. [221] - 224 |
| Physical Description: | X, 231 S. graph. Darst. |
Staff View
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV041792898 | ||
| 003 | DE-604 | ||
| 005 | 20170323 | ||
| 007 | t | ||
| 008 | 140411s2013 d||| |||| 00||| eng d | ||
| 020 | |z 9780262026772 |c hbk |9 978-0-262-026772 | ||
| 035 | |a (OCoLC)881654067 | ||
| 035 | |a (DE-599)HEB334808928 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-473 |a DE-91G |a DE-83 |a DE-29T |a DE-188 | ||
| 082 | 0 | |a 004.36 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a DAT 250f |2 stub | ||
| 084 | |a DAT 539f |2 stub | ||
| 100 | 1 | |a Fokkink, Willem J. |d 1965- |e Verfasser |0 (DE-588)121536831 |4 aut | |
| 245 | 1 | 0 | |a Distributed algorithms |b an intuitive approach |c Wan Fokkink |
| 264 | 1 | |a Cambridge, MA [u.a.] |b MIT Pr. |c 2013 | |
| 300 | |a X, 231 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturverz. S. [221] - 224 | ||
| 650 | 0 | 7 | |a Verteilter Algorithmus |0 (DE-588)4200453-6 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4123623-3 |a Lehrbuch |2 gnd-content | |
| 689 | 0 | 0 | |a Verteilter Algorithmus |0 (DE-588)4200453-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m Digitalisierung UB Bamberg - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027238481&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027238481 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Record in the Search Index
| _version_ | 1804152110387822592 |
|---|---|
| adam_text | Contents
Preface
............................................................ ix
1
Introduction
................................................... 1
1
Message
Passing
2
Preliminaries
.................................................. 7
3
Snapshots
..................................................... 13
3.1
Chandy-Lamport algorithm
.................................. 14
3.2
Lai-Yang algorithm
......................................... 15
4
Waves
........................................................ 19
4.1
Traversal algorithms
........................................ 19
4.2
Tree algorithm
............................................. 23
4.3
Echo algorithm
............................................ 24
5
Deadlock Detection
............................................. 27
5.1
Wait-for graphs
............................................ 27
5.2
Bracha-Toueg algorithm
..................................... 29
6
Termination Detection
.......................................... 37
6.1
Dijkstra-Scholten algorithm
.................................. 38
6.2
Weight-throwing algorithm
.................................. 39
6.3
Rana s algorithm
........................................... 40
6.4
Safra s algorithm
........................................... 42
7
Garbage Collection
............................................. 47
7.1
Reference counting
......................................... 47
7.2
Garbage collection implies termination detection
................ 50
7.3
Tracing
................................................... 51
vi
Contents
8 Routing....................................................... 53
8.1 Chandy-Misra
algorithm
..................................... 53
8.2 Merlin-Segall
algorithm
..................................... 55
8.3
Toueg s algorithm
.......................................... 58
8.4
Frederickson s algorithm
.................................... 61
8.5
Packet switching
........................................... 65
8.6
Routing on the Internet
...................................... 67
9
Election
....................................................... 73
9.1
Election in rings
............................................ 73
9.2
Tree election algorithm
...................................... 77
9.3
Echo algorithm with extinction
............................... 79
9.4
Minimum spanning trees
.................................... 80
10
Anonymous Networks
.......................................... 87
10.1
Impossibility of election in anonymous rings
.................... 87
10.2
Probabilistic algorithms
..................................... 88
10.3
Itai-Rodeh election algorithm for rings
......................... 89
10.4
Echo algorithm with extinction for anonymous networks
.......... 91
10.5
Computing the size of an anonymous ring is impossible
.......... 93
10.6
Itai-Rodeh ring size algorithm
................................ 94
10.7
Election in IEEE
1394 ...................................... 96
11
Synchronous Networks
......................................... 101
11.1
A simple synchronizer
...................................... 101
11.2
Awerbuch s synchronizer
.................................... 102
11.3
Bounded delay networks with local clocks
...................... 105
11.4
Election in anonymous rings with bounded expected delay
........ 106
12
Crash Failures
.................................................
Ill
12.1
Impossibility of 1-crash consensus
............................ 112
12.2
Bracha-Toueg crash consensus algorithm
....................... 113
12.3
Failure detectors
........................................... 115
12.4
Consensus with a weakly accurate failure detector
............... 116
12.5
Chandra-Toueg algorithm
.................................... 116
13
Byzantine Failures
............................................. 121
13.1
Bracha-Toueg Byzantine consensus algorithm
................... 121
13.2
Mahaney-Schneider synchronizer
............................. 125
13.3
Lamport-Shostak-Pease broadcast algorithm
.................... 127
13.4
Lamport-Shostak-Pease authentication algorithm
................ 130
14
Mutual Exclusion
.............................................. 135
14.1
Ricart-Agrawala algorithm
................................... 135
14.2
Raymond s algorithm
....................................... 137
14.3
Agrawal-El Abbadi algorithm
................................ 140
Contents
vii
II Shared Memory
15
Preliminaries
.................................................. 145
16
Mutual Exclusion II
............................................ 147
16.1
Peterson s algorithm
........................................ 147
16.2
Bakery algorithm
........................................... 150
16.3
/V registers are required
..................................... 152
16.4
Fischer s algorithm
......................................... 152
16.5
Tcst-and-test-and-set lock
.................................... 153
16.6
Queue locks
............................................... 155
17
Barriers
....................................................... 161
! 7.1
Sense-reversing barrier
...................................... 161
17.2
Combining tree barrier
...................................... 162
17.3
Tournament barrier
......................................... 165
17.4
Dissemination barrier
....................................... 168
18
Self-Stabilization
............................................... 171
18.1
Dijkstra s
token ring for mutual exclusion
...................... 171
18.2
Arora-Gouda spanning tree algorithm
.......................... 175
18.3
Afek-
Kutten-
Yung spanning tree algorithm
..................... 177
19
Online Scheduling
.............................................. 181
19.1
Jobs
...................................................... 181
19.2
Schedulers
................................................ 182
19.3
Resource access control
..................................... 188
Pseudocode Descriptions
............................................ 193
References
......................................................... 221
Index
............................................................. 225
|
| any_adam_object | 1 |
| author | Fokkink, Willem J. 1965- |
| author_GND | (DE-588)121536831 |
| author_facet | Fokkink, Willem J. 1965- |
| author_role | aut |
| author_sort | Fokkink, Willem J. 1965- |
| author_variant | w j f wj wjf |
| building | Verbundindex |
| bvnumber | BV041792898 |
| classification_rvk | ST 134 |
| classification_tum | DAT 250f DAT 539f |
| ctrlnum | (OCoLC)881654067 (DE-599)HEB334808928 |
| dewey-full | 004.36 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.36 |
| dewey-search | 004.36 |
| dewey-sort | 14.36 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01541nam a2200385zc 4500</leader><controlfield tag="001">BV041792898</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170323 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">140411s2013 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780262026772</subfield><subfield code="c">hbk</subfield><subfield code="9">978-0-262-026772</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)881654067</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)HEB334808928</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.36</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="084" ind1=" " ind2=" "><subfield code="a">DAT 250f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 539f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fokkink, Willem J.</subfield><subfield code="d">1965-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121536831</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Distributed algorithms</subfield><subfield code="b">an intuitive approach</subfield><subfield code="c">Wan Fokkink</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, MA [u.a.]</subfield><subfield code="b">MIT Pr.</subfield><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 231 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="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. [221] - 224</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="8">1\p</subfield><subfield code="0">(DE-588)4123623-3</subfield><subfield code="a">Lehrbuch</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="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bamberg - ADAM Catalogue Enrichment</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=027238481&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027238481</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></record></collection> |
| genre | 1\p (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Lehrbuch |
| id | DE-604.BV041792898 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T01:05:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027238481 |
| oclc_num | 881654067 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG DE-91G DE-BY-TUM DE-83 DE-29T DE-188 |
| owner_facet | DE-473 DE-BY-UBG DE-91G DE-BY-TUM DE-83 DE-29T DE-188 |
| physical | X, 231 S. graph. Darst. |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | MIT Pr. |
| record_format | marc |
| spelling | Fokkink, Willem J. 1965- Verfasser (DE-588)121536831 aut Distributed algorithms an intuitive approach Wan Fokkink Cambridge, MA [u.a.] MIT Pr. 2013 X, 231 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Literaturverz. S. [221] - 224 Verteilter Algorithmus (DE-588)4200453-6 gnd rswk-swf 1\p (DE-588)4123623-3 Lehrbuch gnd-content Verteilter Algorithmus (DE-588)4200453-6 s DE-604 Digitalisierung UB Bamberg - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027238481&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Fokkink, Willem J. 1965- Distributed algorithms an intuitive approach Verteilter Algorithmus (DE-588)4200453-6 gnd |
| subject_GND | (DE-588)4200453-6 (DE-588)4123623-3 |
| title | Distributed algorithms an intuitive approach |
| title_auth | Distributed algorithms an intuitive approach |
| title_exact_search | Distributed algorithms an intuitive approach |
| title_full | Distributed algorithms an intuitive approach Wan Fokkink |
| title_fullStr | Distributed algorithms an intuitive approach Wan Fokkink |
| title_full_unstemmed | Distributed algorithms an intuitive approach Wan Fokkink |
| title_short | Distributed algorithms |
| title_sort | distributed algorithms an intuitive approach |
| title_sub | an intuitive approach |
| topic | Verteilter Algorithmus (DE-588)4200453-6 gnd |
| topic_facet | Verteilter Algorithmus Lehrbuch |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027238481&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT fokkinkwillemj distributedalgorithmsanintuitiveapproach |