Distributed computing: fundamentals, simulations and advanced topics
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Hoboken, NJ
Wiley-Interscience
2004
|
| Ausgabe: | 2. ed. |
| Schriftenreihe: | Wiley series on parallel and distributed computing
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XV, 414 S. graph. Darst. |
| ISBN: | 0471453242 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV019325530 | ||
| 003 | DE-604 | ||
| 005 | 20210406 | ||
| 007 | t | ||
| 008 | 040617s2004 xxud||| |||| 00||| eng d | ||
| 020 | |a 0471453242 |9 0-471-45324-2 | ||
| 035 | |a (OCoLC)54046856 | ||
| 035 | |a (DE-599)BVBBV019325530 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-473 |a DE-384 |a DE-739 | ||
| 050 | 0 | |a QA76.9.D5 | |
| 082 | 0 | |a 004/.36 |2 22 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 200 |0 (DE-625)143611: |2 rvk | ||
| 100 | 1 | |a Attiya, Hagit |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Distributed computing |b fundamentals, simulations and advanced topics |c Hagit Attiya ; Jennifer Welch |
| 250 | |a 2. ed. | ||
| 264 | 1 | |a Hoboken, NJ |b Wiley-Interscience |c 2004 | |
| 300 | |a XV, 414 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Wiley series on parallel and distributed computing | |
| 650 | 7 | |a Sistemas distribuídos |2 larpcal | |
| 650 | 4 | |a Traitement réparti | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Electronic data processing |x Distributed processing | |
| 650 | 0 | 7 | |a Verteiltes System |0 (DE-588)4238872-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Verteiltes System |0 (DE-588)4238872-7 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Welch, Jennifer Lundelius |e Verfasser |0 (DE-588)1089587988 |4 aut | |
| 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=012792631&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
Datensatz im Suchindex
| _version_ | 1805084112358211584 |
|---|---|
| adam_text |
Contents
1
Introduction
1.1
Distributed
Systems
1.2
Theory of Distributed Computing
1.3
Overview
1.4
Relationship of Theory to Practice
Part I Fundamentals
2
Basic Algorithms in Message-Passing Systems
2.1
Formal Models for Message Passing Systems
2.1.1
Systems
2.1.2
Complexity Measures
2.1.3
Pseudocode Conventions
2.2
Broadcast and Convergecast on a Spanning Tree
2.3
Flooding and Building a Spanning Tree
2.4
Constructing a Depth-First Search Spanning Tree for
a Specified Root
2.5
Constructing a Depth-First Search Spanning Tree
without a Specified Root
3
Leader
Election in Rings
31
3.1
The Leader Election
Problem
31
3.2
Anonymous
Rings
32
3.3
Asynchronous
Rings
34
3.3.1
An 0(n2)
Algorithm
34
3.3.2
An O{n\ogn)
Algorithm
35
3.3.3
An fi(nlogn)
Lower Bound
38
3.4
Synchronous
Rings
42
3.4.1
An 0{n)
Upper Bound
43
3.4.2
An fi(nlogn)
Lower Bound for Restricted
Algorithms
48
4
Mutual Exclusion
in Shared
Memory
59
4.1
Formal Model for Shared
Memory Systems
60
4.1.1
Systems
60
4.1.2
Complexity Measures
62
4.1.3
Pseudocode Conventions
62
4.2
The Mutual Exclusion
Problem
63
4.3
Mutual Exclusion
Using Powerful
Primitives
65
4.3.1
Binary Test&Set Registers
65
4.3.2
Read-Modify-Write Registers
66
4.3.3
Lower Bound on the Number of Memory States
69
4.4
Mutual Exclusion Using Read/Write Registers
71
4.4.1
The Bakery Algorithm
71
4.4.2
A Bounded Mutual Exclusion Algorithm for
Two Processors
73
4.4.3
A Bounded Mutual Exclusion Algorithm for
η
Processors
77
4.4.4
Lower Bound on the Number of Read/Write
Registers
80
4.4.5
Fast Mutual Exclusion
84
5
Fault-Tolerant Consensus
91
5.1
Synchronous Systems with Crash Failures
92
5.1.1
Formal Model
92
5.1.2
The Consensus Problem
93
5.1.3
A Simple Algorithm
93
5.1.4
Lower Bound on the Number of Rounds
95
5.2
Synchronous Systems with Byzantine Failures
99
5.2.1 Formal
Model
100
5.2.2
The Consensus Problem Revisited
100
5.2.3
Lower Bound on the Ratio of Faulty Processors
101
5.2.4
An Exponential Algorithm
103
5.2.5
A Polynomial Algorithm
106
5.3
Impossibility in Asynchronous Systems
108
5.3.1
Shared Memory—The Wait-Free Case
109
5.3.2
Shared Memory—The General Case 111
5.3.3
Message Passing
119
Causality and Time
125
6.1
Capturing Causality
126
6.1.1
The Happens-Before Relation
126
6.1.2
Logical Clocks
128
6.1.3
Vector Clocks
129
6.1.4
Shared Memory Systems
133
6.2
Examples of Using Causality
133
6.2.1
Consistent Cuts
134
6.2.2
A Limitation of the Happens-Before Relation:
The Session Problem
137
6.3
Clock Synchronization
140
6.3.1
Modeling Physical Clocks
140
6.3.2
The Clock Synchronization Problem
143
6.3.3
The Two Processors Case
144
6.3.4
An Upper Bound
146
6.3.5
A Lower Bound
148
6.3.6
Practical Clock Synchronization: Estimating
Clock Differences
149
Partii
Simulations
7
A Formal Model for Simulations
157
7.1
Problem Specifications
157
7.2
Communication Systems
158
7.2.1
Asynchronous Point-to-Point Message Passing
159
7.2.2
Asynchronous Broadcast
159
7.3
Processes
160
7.4
Admissibility
163
7.5
Simulations
164
7.6
Pseudocode Conventions
165
8
Broadcast and Multicast
167
8.1
Specification of Broadcast Services
168
8.1.1
The Basic Service Specification
168
8.1.2
Broadcast Service Qualities
169
8.2
Implementing a Broadcast Service
171
8.2.1
Basic Broadcast Service
172
8.2.2
Single-Source FIFO Ordering
172
8.2.3
Totally Ordered Broadcast
172
8.2.4
Causality
175
8.2.5
Reliability
177
8.3
Multicast in Groups
179
8.3.1
Specification
180
8.3.2
Implementation
181
8.4
An Application: Replication
183
8.4.1
Replicated Database
183
8.4.2
The State Machine Approach
183
9
Distributed Shared Memory
189
9.1
Linearizable Shared Memory
190
9.2
Sequentially Consistent Shared Memory
192
9.3
Algorithms
193
9.3.1
Linearizability
193
9.3.2
Sequential Consistency
194
9.4
Lower Bounds
198
9.4.1
Adding Time and Clocks to the Layered Model
198
9.4.2
Sequential Consistency
199
9.4.3
Linearizability
199
10
Fault-Tolerant Simulations of Read/Write Objects
207
10.1
Fault-Tolerant Shared Memory Simulations
208
10.2
Simple Read/Write Register Simulations
209
10.2.1
Multi-Valued from Binary
210
10.2.2
Multi-Reader from Single-Reader
215
10.2.3
Multi-Writer from Single-Writer
219
10.3
Atomic Snapshot Objects
222
10.3.1
Handshaking
Procedures
223
10.3.2
A Bounded Memory Simulation
225
10.4
Simulating Shared Registers in Message-Passing
Systems
229
11
Simulating Synchrony
239
11.1
Synchronous Message-Passing Specification
240
11.2
Simulating Synchronous Processors
241
11.3
Simulating Synchronous Processors and Synchronous
Communication
243
11.3.1
A Simple Synchronizer
243
11.3.2
Application: Constructing a Breadth-First
Search Tree
247
11.4
Local vs. Global Simulations
247
12
Improving the Fault Tolerance of Algorithms
251
12.1
Overview
251
12.2
Modeling Synchronous Processors and Byzantine
Failures
253
12.3
Simulating Identical Byzantine Failures on Top of
Byzantine Failures
255
12.3.1
Definition of Identical Byzantine
255
12.3.2
Simulating Identical Byzantine
256
12.4
Simulating Omission Failures on Top of Identical
Byzantine Failures
258
12.4.1
Definition of Omission
259
12.4.2
Simulating Omission
259
12.5
Simulating Crash Failures on Top of Omission Failures
264
12.5.1
Definition of Crash
264
12.5.2
Simulating Crash
265
12.6
Application: Consensus in the Presence of Byzantine
Failures
268
12.7
Asynchronous Identical Byzantine on Top of Byzantine
Failures
269
12.7.1
Definition of Asynchronous Identical
Byzantine
269
12.7.2
Definition of Asynchronous Byzantine
270
12.7.3
Simulating Asynchronous Identical Byzantine
270
13
Fault-Tolerant Clock Synchronization
277
13.1
Problem
Definition 277
13.2
The Ratio of Faulty
Processors
279
13.3
A Clock Synchronization Algorithm
284
13.3.1
Timing Failures
284
13.3.2
Byzantine Failures
290
13.4
Practical Clock Synchronization; Identifying Faulty
Clocb
291
Part III Advanced Topics
14
Randomization
297
14.1
Leader Election: A Case Study
297
14.1.1
Weakening the Problem Definition
297
14.1.2
Synchronous One-Shot Algorithm
299
14.1.3
Synchronous Iterated Algorithm and
Expectation
300
14.1.4
Asynchronous Systems and Adversaries
302
14.1.5
Impossibility of Uniform Algorithms
303
14.1.6
Summary of Probabilistic Definitions
303
14.2
Mutual Exclusion with Small Shared Variables
305
14.3
Consensus
308
14.3.1
The General Algorithm Scheme
309
14.3.2
A Common Coin with Constant Bias
314
14.3.3
Tolerating Byzantine Failures
315
14.3.4
Shared Memory Systems
316
15
Wait-Free Simulations of Arbitrary Objects
321
15.1
Example: A FIFO Queue
322
15.2
The Wait-Free Hierarchy
326
15.3
Universality
327
15.3.1
A Nonblocking Simulation Using
Compare&Swap
328
15.3.2
A Nonblocking Algorithm Using Consensus
Objects
329
15.3.3
A Wait-Free Algorithm Using Consensus
Objects
332
15.3.4
Bounding the Memory Requirements
335
15.3.5
Handling Nondeterminism
337
15.3.6
Employing Randomized
Consensus
338
16
Problems Solvable in Asynchronous Systems
343
16.1
k-Set Consensus
344
16.2
Approximate Agreement
352
16.2.1
Known Input Range
352
16.2.2
Unknown Input Range
354
16.3
Renaming
356
16.3.1
The Wait-Free Case
357
16.3.2
The General Case
359
16.3.3
Long-LivedRenaming
360
16.4
k-Exclusion and k-Assignment
361
16.4.1
An Algorithm fork-Exclusion
362
16.4.2
An Algorithm for k-Assignment
364
17
Solving Consensus in Eventually Stable Systems
369
17.1
Preserving Safety in Shared Memory Systems
3 70
17.2
Failure Detectors
372
17.3
Solving Consensus using Failure Detectors
3 73
17.3.1
Solving Consensus with oS
3 73
17.3.2
Solving Consensus with
S
375
17.3.3
Solving Consensus with
Ω
376
17.4
Implementing Failure Detectors
377
17.5
State Machine Replication with Failure Detectors
377
References
381
Index
401 |
| any_adam_object | 1 |
| author | Attiya, Hagit Welch, Jennifer Lundelius |
| author_GND | (DE-588)1089587988 |
| author_facet | Attiya, Hagit Welch, Jennifer Lundelius |
| author_role | aut aut |
| author_sort | Attiya, Hagit |
| author_variant | h a ha j l w jl jlw |
| building | Verbundindex |
| bvnumber | BV019325530 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.D5 |
| callnumber-search | QA76.9.D5 |
| callnumber-sort | QA 276.9 D5 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 130 ST 200 |
| ctrlnum | (OCoLC)54046856 (DE-599)BVBBV019325530 |
| 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 236 |
| 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 a2200000zc 4500</leader><controlfield tag="001">BV019325530</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210406</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">040617s2004 xxud||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0471453242</subfield><subfield code="9">0-471-45324-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)54046856</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV019325530</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.D5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004/.36</subfield><subfield code="2">22</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 200</subfield><subfield code="0">(DE-625)143611:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Attiya, Hagit</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Distributed computing</subfield><subfield code="b">fundamentals, simulations and advanced topics</subfield><subfield code="c">Hagit Attiya ; Jennifer Welch</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hoboken, NJ</subfield><subfield code="b">Wiley-Interscience</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 414 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="490" ind1="0" ind2=" "><subfield code="a">Wiley series on parallel and distributed computing</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Sistemas distribuídos</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Traitement réparti</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</subfield><subfield code="x">Distributed processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Verteiltes System</subfield><subfield code="0">(DE-588)4238872-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Verteiltes System</subfield><subfield code="0">(DE-588)4238872-7</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">Welch, Jennifer Lundelius</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1089587988</subfield><subfield code="4">aut</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&doc_library=BVB01&local_base=BVB01&doc_number=012792631&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield></record></collection> |
| id | DE-604.BV019325530 |
| illustrated | Illustrated |
| indexdate | 2024-07-20T07:59:16Z |
| institution | BVB |
| isbn | 0471453242 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-012792631 |
| oclc_num | 54046856 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG DE-384 DE-739 |
| owner_facet | DE-473 DE-BY-UBG DE-384 DE-739 |
| physical | XV, 414 S. graph. Darst. |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | Wiley-Interscience |
| record_format | marc |
| series2 | Wiley series on parallel and distributed computing |
| spelling | Attiya, Hagit Verfasser aut Distributed computing fundamentals, simulations and advanced topics Hagit Attiya ; Jennifer Welch 2. ed. Hoboken, NJ Wiley-Interscience 2004 XV, 414 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Wiley series on parallel and distributed computing Sistemas distribuídos larpcal Traitement réparti Datenverarbeitung Electronic data processing Distributed processing Verteiltes System (DE-588)4238872-7 gnd rswk-swf Verteiltes System (DE-588)4238872-7 s DE-604 Welch, Jennifer Lundelius Verfasser (DE-588)1089587988 aut Digitalisierung UB Passau application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012792631&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Attiya, Hagit Welch, Jennifer Lundelius Distributed computing fundamentals, simulations and advanced topics Sistemas distribuídos larpcal Traitement réparti Datenverarbeitung Electronic data processing Distributed processing Verteiltes System (DE-588)4238872-7 gnd |
| subject_GND | (DE-588)4238872-7 |
| title | Distributed computing fundamentals, simulations and advanced topics |
| title_auth | Distributed computing fundamentals, simulations and advanced topics |
| title_exact_search | Distributed computing fundamentals, simulations and advanced topics |
| title_full | Distributed computing fundamentals, simulations and advanced topics Hagit Attiya ; Jennifer Welch |
| title_fullStr | Distributed computing fundamentals, simulations and advanced topics Hagit Attiya ; Jennifer Welch |
| title_full_unstemmed | Distributed computing fundamentals, simulations and advanced topics Hagit Attiya ; Jennifer Welch |
| title_short | Distributed computing |
| title_sort | distributed computing fundamentals simulations and advanced topics |
| title_sub | fundamentals, simulations and advanced topics |
| topic | Sistemas distribuídos larpcal Traitement réparti Datenverarbeitung Electronic data processing Distributed processing Verteiltes System (DE-588)4238872-7 gnd |
| topic_facet | Sistemas distribuídos Traitement réparti Datenverarbeitung Electronic data processing Distributed processing Verteiltes System |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012792631&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT attiyahagit distributedcomputingfundamentalssimulationsandadvancedtopics AT welchjenniferlundelius distributedcomputingfundamentalssimulationsandadvancedtopics |