Design and analysis of distributed algorithms:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Hoboken, NJ
Wiley-Interscience
2007
|
| Schriftenreihe: | Wiley series on parallel and distributed computing
|
| Schlagworte: | |
| Online-Zugang: | Table of contents only Inhaltsverzeichnis |
| Beschreibung: | Includes index. |
| Beschreibung: | XVIII, 589 S. graph. Darst. |
| ISBN: | 0471719978 9780471719977 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021839709 | ||
| 003 | DE-604 | ||
| 005 | 20071204 | ||
| 007 | t | ||
| 008 | 061205s2007 xxud||| |||| 00||| eng d | ||
| 010 | |a 2006011214 | ||
| 020 | |a 0471719978 |c cloth |9 0-471-71997-8 | ||
| 020 | |a 9780471719977 |9 978-0-471-71997-7 | ||
| 035 | |a (OCoLC)65521547 | ||
| 035 | |a (DE-599)BVBBV021839709 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-703 |a DE-188 | ||
| 050 | 0 | |a QA76.9.D5 | |
| 082 | 0 | |a 005.1 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Santoro, Nicola |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Design and analysis of distributed algorithms |c Nicola Santoro |
| 264 | 1 | |a Hoboken, NJ |b Wiley-Interscience |c 2007 | |
| 300 | |a XVIII, 589 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 | |
| 500 | |a Includes index. | ||
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Electronic data processing |x Distributed processing | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 0 | 7 | |a Verteilter Algorithmus |0 (DE-588)4200453-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Verteilter Algorithmus |0 (DE-588)4200453-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | |u http://www.loc.gov/catdir/toc/ecip0611/2006011214.html |3 Table of contents only | |
| 856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015051581&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015051581 | ||
Datensatz im Suchindex
| _version_ | 1804135773925015552 |
|---|---|
| adam_text | DESIGN AND ANALYSIS OF DISTRIBUTED ALGORITHMS NICOLA SANTORO CARLETON
UNIVERSITY, OTTAWA, CANADA * ICTUTENHIAL 1 8 O 7 W1LEY 2 O O 7
HCENTLNNLF WILEY-INTERSCIENCE A JOHN WILEY & SONS, INC., PUBLICATION
CONTENTS PREFACE XIV 1. DISTRIBUTED COMPUTING ENVIRONMENTS 1 1.1 ENUETIES
1 1.2 COMMUNICATION 4 1.3 AXIOMS AND RESTRICTIONS 4 1.3.1 AXIOMS 5 1.3.2
RESTRICTIONS 6 1 .4 COST AND COMPLEXITY 9 1.4.1 AMOUNT OF COMMUNICATION
ACTIVIEIES 9 1.4.2 TIME 10 1.5 AN EXAMPLE: BROADCASTING 10 1.6 STATES
AND EVENTS 14 1.6.1 TIME AND EVENTS 14 1.6.2 STATES AND CONFIGURATIONS
16 1.7 PROBLEMS AND SOLUTIONS (*) 17 1.8 KNOWLEDGE 19 1.8.1 LEVELS OF
KNOWLEDGE 19 1.8.2 TYPES OF KNOWLEDGE 21 1.9 TECHNICAL CONSIDERATIONS 22
1.9.1 MESSAGES 22 1.9.2 PROTOCOL 23 1.9.3 COMMUNICATION MECHANISM 24
1.10 SUMMARY OF DEFINITIONS 25 1.11 BIBLIOGRAPHICAL NOTES 25 1.12
EXERCISES, PROBLEMS, AND ANSWERS 26 1.12.1 EXERCISES AND PROBLEMS 26
1.12.2 ANSWERS TO EXERCISES 27 2. BASIC PROBLEMS AND PROTOCOLS 29 2.1
BROADCAST 29 2.1.1 THE PROBLEM 29 2.1.2 COST OF BROADCASTING 30 2.1.3
BROADCASTING IN SPECIAL NETWORKS 32 VII VUEI CONTENTS 2.2 WAKE-UP 36
2.2.1 GENERIC WAKE-UP 36 2.2.2 WAKE-UP IN SPECIAL NETWORKS 37 2.3
TRAVERSAL 41 2.3.1 DEPTH-FIRST TRAVERSAL 42 2.3.2 HACKING (*) 44 2.3.3
TRAVERSAL IN SPECIAL NETWORKS 49 2.3.4 CONSIDERATIONS ON TRAVERSAL 50
2.4 PRACTICAL IMPLICATIONS: USE A SUBNET 51 2.5 CONSTRUCTING A SPANNING
TREE 52 2.5.1 SPT CONSTRUCTION WITH A SINGLE INITIATOR: SHOUT 53 2.5.2
OTHER SPT CONSTRUCTIONS WITH SINGLE INITIATOR 58 2.5.3 CONSIDERATIONS ON
THE CONSTRUCTED TREE 60 2.5.4 APPLICATION: BETTER TRAVERSAL 62 2.5.5
SPAUNING-TREE CONSTRUCTION WITH MULTIPLE INITIATORS 62 2.5.6
IMPOSSIBILITY RESULT 63 2.5.7 SPT WITH INITIAL DISTINCT VALUES 65 2.6
COMPUTATIONS IN TREES 70 2.6.1 SATURATION: A BASIC TECHNIQUE 71 2.6.2
MINIMUM FINDING 74 2.6.3 DISTRIBUTED FUNCTION EVALUATION 76 2.6.4
FINDING ECCENTRICITIES 78 2.6.5 CENTER FINDING 81 2.6.6 OTHER
COMPUTATIONS 84 2.6.7 COMPUTING IN ROOTED TREES 85 2.7 SUMMARY 89 2.7.1
SUMMARY OF PROBLEMS 89 2.7.2 SUMMARY OF TECHNIQUES 90 2.8
BIBLIOGRAPHIEN! NOTES 90 2.9 EXERCISES, PROBLEMS, AND ANSWERS 91 2.9.1
EXERCISES 91 2.9.2 PROBLEMS 95 2.9.3 ANSWERS TO EXERCISES 95 3. ELECTION
99 3.1 INTRODUCTION 99 3.1.1 IMPOSSIBILITY RESULT 99 3.1.2 ADDITIONAL
RESTRICTIONS 100 3.1.3 SOLUTION STRATEGIES 101 3.2 ELECTION IN TREES 102
3.3 ELECTION IN RINGS 104 3.3.1 ALL THE WAY 105 CONTENTS IX 3.3.2 AS FAR
AS IT CAN 109 3.3.3 CONTROLIED DISTANCE 115 3.3.4 ELECTORAL STAGES 122
3.3.5 STAGES WITH FEEDBACK 127 3.3.6 ALTERNATING STEPS 130 3.3.7
UNIDIRECTIONAL PROTOCOLS 134 3.3.8 LIMITS TO IMPROVEMENTS (*) 150 3.3.9
SUMMARY AND LESSONS 157 3.4 ELECTION IN MESH NETWORKS 158 3.4.1 MESHES
158 3.4.2 TORI 161 3.5 ELECTION IN CUBE NETWORKS 166 3.5.1 ORIENTED
HYPERCUBES 166 3.5.2 UNORIENTED HYPERCUBES 174 3.6 ELECTION IN COMPLETE
NETWORKS 174 3.6.1 STAGES AND TERRITORY 174 3.6.2 SURPRISING LIMITATION
177 3.6.3 HARVESTING THE COMMUNICATION POWER 180 3.7 ELECTION IN CHORDAL
RINGS (*) 183 3.7.1 CHORDAL RINGS 183 3.7.2 LOWER BOUNDS 184 3.8
UNIVERSAL ELECTION PROTOCOLS 185 3.8.1 MEGA-MERGER 185 3.8.2 ANALYSIS OF
MEGA-MERGER 193 3.8.3 YO-YO 199 3.8.4 LOWER BOUNDS AND EQUIVALENCES 209
3.9 BIBLIOGRAPHICAL NOTES 212 3.10 EXERCISES, PROBLEMS, AND ANSWERS 214
3.10.1 EXERCISES 214 3.10.2 PROBLEMS 220 3.10.3 ANSWERS TO EXERCISES 222
4, MESSAGE ROUTING AND SHORTEST PATHS 225 4.1 INTRODUCTION 225 4.2
SHORTEST PATH ROUTING 226 4.2.1 GOSSIPING THE NETWORK MAPS 226 4.2.2
ITERATIVE CONSTRUCTION OF ROUTING TABLES 228 4.2.3 CONSTRUCTING
SHORTEST-PATH SPANNING TREE 230 4.2.4 CONSTRUCTING ALL-PAIRS SHORTEST
PATHS 237 4.2.5 MIN-HOP ROUTING 240 4.2.6 SUBOPTIMAL SOLUTIONS: ROUTING
TREES 250 4.3 COPING WITH CHANGES 253 4.3.1 ADAPTIVE ROUTING 253
CONTENTS 4.3.2 FAULT-TOLERANT TABLES 255 4.3.3 ON CORRECTNESS AND
GUARANTEES 259 4.4 ROUTING IN STATIC SYSTEMS: COMPACT TABLES 261 4.4.1
THE SIZC OL~ ROUTING TABLES 261 4.4.2 INTERVAL ROUTING 262 4.5
BIBLIOGRAPHICAL NOTES 267 4.6 EXERCISES, PROBLEMS, AND ANSWERS 269 4.6.1
EXERCISES 269 4.6.2 PROBLEMS 274 4.6.3 ANSWERS TO EXERCISES 274 5.
DISTRIBUTED SET OPERATIONS 277 5. 1 INTRODUCTION 277 5.2 DISTRIBUTED
SELECTION 279 5.2.1 ORDER STATISTICS 279 5.2.2 SELECTION IN A SMALL DATA
SET 280 5.2.3 SIMPLE CASE: SELECTION AMONG TWO SITES 282 5.2.4 GENERAL
SELECTION STRATEGY: RANKSELECT 287 5.2.5 REDUCING THE WERST CASE:
REDUCESCLECT 292 5.3 SORTING A DISTRIBUTED SET 297 5.3.1 DISTRIBUTED
SORTING 297 5.3.2 SPECIAL CASE: SORTING ON A ORDERED LINE 299 5.3.3
RETNOVING THE TOPOLOGICAL CONSTRAINTS: COMPLETE GRAPH 303 5.3.4 BASIC
LIMITATION* 306 5.3.5 EFUCIENT SORTING: SELECTSORT 309 5.3.6
UNRESTRIETED SORTING 312 5.4 DISTRIBUTED SETS OPERATIONS 315 5.4.1
OPERATIONS ON DISTRIBUTED SETS 315 5.4.2 LOCAL STRUCTTIRE 317 5.4.3
LOCAL EVALUATION (*) 319 5.4.4 GLOBAL EVALUATION 322 5.4.5 OPERATIONAL
COSTS 323 5.5 BIBLIOGRAPHICAL NOTES 323 5.6 EXERCISES. PROBLEMS, AND
ANSWERS 324 5.6.1 EXERCISES 324 5.6.2 PROBLEMS 329 5.6.3 ANSWERS TO
EXERCISES 329 6. SYNCHRONOUS COMPUTATIONS 333 6.1 SYNCHRONOUS
DISTRIBUTED COMPUTING 333 6.1.1 FULLY SYNCHRONOUS SYSTEMS 333 CONTENTS
XI 6.1.2 CLOCKS AND UNIT OF TIME 334 6.1.3 COINMUNICATION DELAYS AND
SIZE OF MESSAGES 336 6.1.4 ON THE UNIQUC NATURE OF SYNCHRONOUS
COMPUTATIONS 336 6.1.3 THE COST OF SYNCHRONOUS PROTOEOLS 342 6.2
COMMNNIEATORS, PIPELINE, AND TRANSFORMERS 343 6.2.1 TWO-PARTY
COMMUNICATION 344 6.2.2 PIPELINE 353 6.2.3 TRANSFORMERS 357 6.3
MIN-FINDING AND ELECTION: WAITING AND GUESSING 360 6.3.1 WAITING 360
6.3.2 GUESSING 370 6.3.3 DOUBLE WAIT: INTEGRATING WAITING AND GUESSING
378 6.4 SYNCHRONIZATION PROBLEMS: RESET, UNISON, AND FIRING SQUAD 385
6.4.1 RESET / WAKE-UP 386 6.4.2 UNISON 387 6.4.3 FIRING SQUAD 389 6.5
BIBLIOGRAPHIE^ NOTES 391 6.6 EXERCISES, PROBLEMS, AND ANSWERS 392 6.6.1
EXERCISES 392 6.6.2 PROBLEMS 398 6.6.3 ANSWERS TO HXERCISES 400 7.
COMPUTING IN PRESENCE OF FAULTS 408 7.1 INTRODUCIION 408 7.1.1 FAULTS
AND FAILURES 408 7.1.2 MODELING FAULTS 410 7.1.3 TOPOLOGICAL FACTORS 413
7.1.4 FAULT TOLCRANCE, AGREEMENT, AND COMMON KNOWLEDGE 415 7.2 THE
CRUSHING LMPACT OF FAILURES 417 7.2.1 NODE FAILURES: SINGLE-FAULT
DISASTER 417 7.2.2 CONSEQUENCES OF THE SINGLE-FAULT DISASTER 424 7.3
LOCALIZED ENTITY FAILURES: USING SYNCHRONY 425 7.3.1 SYNCHRONOUS
CONSENSUS WITH CRASH FAILURES 426 7.3.2 SYNCHRONOUS CONSENSUS WITH
BYZANTINE FAILURES 430 7.3.3 LIMIT TO NUMBER OF BYZANTINE ENTITIES FOR
AGREEMENT 435 7.3.4 FROM BOOLEAN TO GENERAL BYZANTINE AGREEMENT 438
7.3.5 BYZANTINE AGREEMENT IN ARBITRARY GRAPHS 440 7.4 LOCALIZED ENTITY
FAUEURES; USING RANDOMIZATION 443 7.4.1 RANDOM ACTIONS ANDCOIN FLIPS 443
7.4.2 RANDOMI/.ED ASYNCHRONOUS CONSENSUS: CRASH FAILURES 444 7.4.3
CONCLUDING REMARKS 449 XII CONTERJTS 7.5 LOCALIZED ENTJTY FAILURES:
USING FAULT DETECTION 449 7.5.1 FAILURE DETENTORS AND THEIR PROPERTIES
450 7.5.2 THE WEAKEST FAILURE DETECTOR 452 7.6 LOCALIZED ENTITY
FAILURES: PREEXECUTION FAILURES 454 7.6.1 PARTIAL RELIABIIILY 454 7.6.2
EXAMPLE: ELECTION IN COMPLETE NETWORK 455 7.7 LOCALIZED LINK FAILURES
457 7.7.1 A TALE OF TWO SYNCHRONOUS GENERALS 458 7.7.2 COMPUTING WITH
FAULTY LINKS 461 7.7.3 CONCLUDING REMARKS 466 7.7.4 CONSIDERATIONS ON
LOCALIZED ENTITY FAILURES 466 7.8 UBIQUITOUS FAULTS 467 7.8.1
COMMUNICATION FAULTS AND AGREEMENT 467 7.8.2 LIMITS TO NUMBER OF
UBIQUITOUS FAULTS FOR MAJORITY 468 7.8.3 UNANIMITY IN SPITE OF
UBIQUITOUS FAULTS 475 7.8.4 TIGHTNESS 485 7.9 BIHLIOGRAPHICAL NOTES 486
7.10 EXERCISES. PROBLEMS, AND ANSWERS 488 7.10.1 EXERCISES 488 7.10.2
PROBLEMS 492 7.10.3 ANSWERS TO EXERCISES 493 S. DETECTING STAHLE
PROPERTIES 500 8.1 INTRODUCLION 500 8.2 DEADLOCK DETECTION 500 8.2.1
DEADLOCK 500 8.2.2 DETECTING DEADLOCK; WAIT-TBR GRAPH 501 8.2.3
SINGLE-REQNEST SYSTEMS 503 8.2.4 MULTIPLE-RCQUESTS SYSTEMS 505 8.2.5
DYNAMIC WAIT-FOR GRAPHS 512 8.2.6 OTHER REQUESTS SYSTEMS 516 8.3 GLOBAL
TERMINATION DETECTION 518 8.3.1 A SIMPLE SOLUTION: REPEAIED TERMINATION
QUERIES 519 8.3.2 IMPROVED PROTOCOLS: SHRINK 523 8.3.3 CONCLUDING
REMARKS 525 8.4 GLOBAL STAHLE PROPERTY DETECTION 526 8.4.1 GENERA]
STRATEGY 526 8.4.2 TIME CUTS AND CONSISTENT SNAPSHOTS 527 8.4.3
COMPUTING A CONSISTENT SNAPSHOT 530 8.4.4 SUMMARY: PUTTING ALL TOGCTHER
53! 8.5 BIBLIOGRAPHICAL NOTES , 532 CONTENTS XIII 8.6 EXERCISES,
PROBLEMS, AND ANSWERS 534 8.6.1 EXERCISES 534 8.6.2 PROBLEMS 536 8.6.3
ANSWERS TO EXERCISES 538 9. CONTINUOUS COMPUTATIONS 541 9.1 INTRODUCTION
54! 9.2 KEEPING VIRTUAL TIME 542 9.2.1 VIRTUAL TIME AND CAUSA! ORDER 542
9.2.2 CAUSA! ORDER: COUNTCR CLOCKS 544 9.2.3 COMPLETE CAUSAL ORDER:
VECTOR CLOCKS 545 9.2.4 CONCLUDING REMARKS 548 9.3 DISLRIBTITED MUTUAL
EXCLUSION 549 9.3.1 THE PROBLEM 549 9.3.2 A SIMPLE AND EFFICIENT
SOLUTION 550 9.3.3 TRAVERSITIG THE NETWORK 551 9.3.4 MANAGING A
DISTRIBULED QUEUE 554 9.3.5 DECENTRALIZED PERMISSIONS 559 9.3.6 MUTUAL
EXCLUSION IN COMPLETE GRAPHS: QUORUM 561 9.3.7 CONCLUDING REMARKS 564
9.4 DEADLOCK: SYSTEM DETECTION AND RESOLUTION 566 9.4.1 SYSTEM DETECTION
AND RESOLUTION 566 9.4.2 DETECTION AND RESOLUTION IN SINGIE-REQUEST
SYSTEMS 567 9.4.3 DETECTION AND RESOLUTION IN MULTIPLE-REQUESTS SYSTEMS
568 9.5 BIBHOGRAPHICAL NOTES 569 9.6 EXERCISES, PROBLEMS, AND ANSWERS
570 9.6.1 EXERCISES 570 9.6.2 PROBLEMS 572 9.6.3 ANSWERS TO EXERCISES
573 INDEX 577
|
| adam_txt |
DESIGN AND ANALYSIS OF DISTRIBUTED ALGORITHMS NICOLA SANTORO CARLETON
UNIVERSITY, OTTAWA, CANADA * ICTUTENHIAL 1 8 O 7 W1LEY 2 O O 7
HCENTLNNLF WILEY-INTERSCIENCE A JOHN WILEY & SONS, INC., PUBLICATION
CONTENTS PREFACE XIV 1. DISTRIBUTED COMPUTING ENVIRONMENTS 1 1.1 ENUETIES
1 1.2 COMMUNICATION 4 1.3 AXIOMS AND RESTRICTIONS 4 1.3.1 AXIOMS 5 1.3.2
RESTRICTIONS 6 1 .4 COST AND COMPLEXITY 9 1.4.1 AMOUNT OF COMMUNICATION
ACTIVIEIES 9 1.4.2 TIME 10 1.5 AN EXAMPLE: BROADCASTING 10 1.6 STATES
AND EVENTS 14 1.6.1 TIME AND EVENTS 14 1.6.2 STATES AND CONFIGURATIONS
16 1.7 PROBLEMS AND SOLUTIONS (*) 17 1.8 KNOWLEDGE 19 1.8.1 LEVELS OF
KNOWLEDGE 19 1.8.2 TYPES OF KNOWLEDGE 21 1.9 TECHNICAL CONSIDERATIONS 22
1.9.1 MESSAGES 22 1.9.2 PROTOCOL 23 1.9.3 COMMUNICATION MECHANISM 24
1.10 SUMMARY OF DEFINITIONS 25 1.11 BIBLIOGRAPHICAL NOTES 25 1.12
EXERCISES, PROBLEMS, AND ANSWERS 26 1.12.1 EXERCISES AND PROBLEMS 26
1.12.2 ANSWERS TO EXERCISES 27 2. BASIC PROBLEMS AND PROTOCOLS 29 2.1
BROADCAST 29 2.1.1 THE PROBLEM 29 2.1.2 COST OF BROADCASTING 30 2.1.3
BROADCASTING IN SPECIAL NETWORKS 32 VII VUEI CONTENTS 2.2 WAKE-UP 36
2.2.1 GENERIC WAKE-UP 36 2.2.2 WAKE-UP IN SPECIAL NETWORKS 37 2.3
TRAVERSAL 41 2.3.1 DEPTH-FIRST TRAVERSAL 42 2.3.2 HACKING (*) 44 2.3.3
TRAVERSAL IN SPECIAL NETWORKS 49 2.3.4 CONSIDERATIONS ON TRAVERSAL 50
2.4 PRACTICAL IMPLICATIONS: USE A SUBNET 51 2.5 CONSTRUCTING A SPANNING
TREE 52 2.5.1 SPT CONSTRUCTION WITH A SINGLE INITIATOR: SHOUT 53 2.5.2
OTHER SPT CONSTRUCTIONS WITH SINGLE INITIATOR 58 2.5.3 CONSIDERATIONS ON
THE CONSTRUCTED TREE 60 2.5.4 APPLICATION: BETTER TRAVERSAL 62 2.5.5
SPAUNING-TREE CONSTRUCTION WITH MULTIPLE INITIATORS 62 2.5.6
IMPOSSIBILITY RESULT 63 2.5.7 SPT WITH INITIAL DISTINCT VALUES 65 2.6
COMPUTATIONS IN TREES 70 2.6.1 SATURATION: A BASIC TECHNIQUE 71 2.6.2
MINIMUM FINDING 74 2.6.3 DISTRIBUTED FUNCTION EVALUATION 76 2.6.4
FINDING ECCENTRICITIES 78 2.6.5 CENTER FINDING 81 2.6.6 OTHER
COMPUTATIONS 84 2.6.7 COMPUTING IN ROOTED TREES 85 2.7 SUMMARY 89 2.7.1
SUMMARY OF PROBLEMS 89 2.7.2 SUMMARY OF TECHNIQUES 90 2.8
BIBLIOGRAPHIEN! NOTES 90 2.9 EXERCISES, PROBLEMS, AND ANSWERS 91 2.9.1
EXERCISES 91 2.9.2 PROBLEMS 95 2.9.3 ANSWERS TO EXERCISES 95 3. ELECTION
99 3.1 INTRODUCTION 99 3.1.1 IMPOSSIBILITY RESULT 99 3.1.2 ADDITIONAL
RESTRICTIONS 100 3.1.3 SOLUTION STRATEGIES 101 3.2 ELECTION IN TREES 102
3.3 ELECTION IN RINGS 104 3.3.1 ALL THE WAY 105 CONTENTS IX 3.3.2 AS FAR
AS IT CAN 109 3.3.3 CONTROLIED DISTANCE 115 3.3.4 ELECTORAL STAGES 122
3.3.5 STAGES WITH FEEDBACK 127 3.3.6 ALTERNATING STEPS 130 3.3.7
UNIDIRECTIONAL PROTOCOLS 134 3.3.8 LIMITS TO IMPROVEMENTS (*) 150 3.3.9
SUMMARY AND LESSONS 157 3.4 ELECTION IN MESH NETWORKS 158 3.4.1 MESHES
158 3.4.2 TORI 161 3.5 ELECTION IN CUBE NETWORKS 166 3.5.1 ORIENTED
HYPERCUBES 166 3.5.2 UNORIENTED HYPERCUBES 174 3.6 ELECTION IN COMPLETE
NETWORKS 174 3.6.1 STAGES AND TERRITORY 174 3.6.2 SURPRISING LIMITATION
177 3.6.3 HARVESTING THE COMMUNICATION POWER 180 3.7 ELECTION IN CHORDAL
RINGS (*) 183 3.7.1 CHORDAL RINGS 183 3.7.2 LOWER BOUNDS 184 3.8
UNIVERSAL ELECTION PROTOCOLS 185 3.8.1 MEGA-MERGER 185 3.8.2 ANALYSIS OF
MEGA-MERGER 193 3.8.3 YO-YO 199 3.8.4 LOWER BOUNDS AND EQUIVALENCES 209
3.9 BIBLIOGRAPHICAL NOTES 212 3.10 EXERCISES, PROBLEMS, AND ANSWERS 214
3.10.1 EXERCISES 214 3.10.2 PROBLEMS 220 3.10.3 ANSWERS TO EXERCISES 222
4, MESSAGE ROUTING AND SHORTEST PATHS 225 4.1 INTRODUCTION 225 4.2
SHORTEST PATH ROUTING 226 4.2.1 GOSSIPING THE NETWORK MAPS 226 4.2.2
ITERATIVE CONSTRUCTION OF ROUTING TABLES 228 4.2.3 CONSTRUCTING
SHORTEST-PATH SPANNING TREE 230 4.2.4 CONSTRUCTING ALL-PAIRS SHORTEST
PATHS 237 4.2.5 MIN-HOP ROUTING 240 4.2.6 SUBOPTIMAL SOLUTIONS: ROUTING
TREES 250 4.3 COPING WITH CHANGES 253 4.3.1 ADAPTIVE ROUTING 253
CONTENTS 4.3.2 FAULT-TOLERANT TABLES 255 4.3.3 ON CORRECTNESS AND
GUARANTEES 259 4.4 ROUTING IN STATIC SYSTEMS: COMPACT TABLES 261 4.4.1
THE SIZC OL~ ROUTING TABLES 261 4.4.2 INTERVAL ROUTING 262 4.5
BIBLIOGRAPHICAL NOTES 267 4.6 EXERCISES, PROBLEMS, AND ANSWERS 269 4.6.1
EXERCISES 269 4.6.2 PROBLEMS 274 4.6.3 ANSWERS TO EXERCISES 274 5.
DISTRIBUTED SET OPERATIONS 277 5. 1 INTRODUCTION 277 5.2 DISTRIBUTED
SELECTION 279 5.2.1 ORDER STATISTICS 279 5.2.2 SELECTION IN A SMALL DATA
SET 280 5.2.3 SIMPLE CASE: SELECTION AMONG TWO SITES 282 5.2.4 GENERAL
SELECTION STRATEGY: RANKSELECT 287 5.2.5 REDUCING THE WERST CASE:
REDUCESCLECT 292 5.3 SORTING A DISTRIBUTED SET 297 5.3.1 DISTRIBUTED
SORTING 297 5.3.2 SPECIAL CASE: SORTING ON A ORDERED LINE 299 5.3.3
RETNOVING THE TOPOLOGICAL CONSTRAINTS: COMPLETE GRAPH 303 5.3.4 BASIC
LIMITATION* 306 5.3.5 EFUCIENT SORTING: SELECTSORT 309 5.3.6
UNRESTRIETED SORTING 312 5.4 DISTRIBUTED SETS OPERATIONS 315 5.4.1
OPERATIONS ON DISTRIBUTED SETS 315 5.4.2 LOCAL STRUCTTIRE 317 5.4.3
LOCAL EVALUATION (*) 319 5.4.4 GLOBAL EVALUATION 322 5.4.5 OPERATIONAL
COSTS 323 5.5 BIBLIOGRAPHICAL NOTES 323 5.6 EXERCISES. PROBLEMS, AND
ANSWERS 324 5.6.1 EXERCISES 324 5.6.2 PROBLEMS 329 5.6.3 ANSWERS TO
EXERCISES 329 6. SYNCHRONOUS COMPUTATIONS 333 6.1 SYNCHRONOUS
DISTRIBUTED COMPUTING 333 6.1.1 FULLY SYNCHRONOUS SYSTEMS 333 CONTENTS
XI 6.1.2 CLOCKS AND UNIT OF TIME 334 6.1.3 COINMUNICATION DELAYS AND
SIZE OF MESSAGES 336 6.1.4 ON THE UNIQUC NATURE OF SYNCHRONOUS
COMPUTATIONS 336 6.1.3 THE COST OF SYNCHRONOUS PROTOEOLS 342 6.2
COMMNNIEATORS, PIPELINE, AND TRANSFORMERS 343 6.2.1 TWO-PARTY
COMMUNICATION 344 6.2.2 PIPELINE 353 6.2.3 TRANSFORMERS 357 6.3
MIN-FINDING AND ELECTION: WAITING AND GUESSING 360 6.3.1 WAITING 360
6.3.2 GUESSING 370 6.3.3 DOUBLE WAIT: INTEGRATING WAITING AND GUESSING
378 6.4 SYNCHRONIZATION PROBLEMS: RESET, UNISON, AND FIRING SQUAD 385
6.4.1 RESET / WAKE-UP 386 6.4.2 UNISON 387 6.4.3 FIRING SQUAD 389 6.5
BIBLIOGRAPHIE^ NOTES 391 6.6 EXERCISES, PROBLEMS, AND ANSWERS 392 6.6.1
EXERCISES 392 6.6.2 PROBLEMS 398 6.6.3 ANSWERS TO HXERCISES 400 7.
COMPUTING IN PRESENCE OF FAULTS 408 7.1 INTRODUCIION 408 7.1.1 FAULTS
AND FAILURES 408 7.1.2 MODELING FAULTS 410 7.1.3 TOPOLOGICAL FACTORS 413
7.1.4 FAULT TOLCRANCE, AGREEMENT, AND COMMON KNOWLEDGE 415 7.2 THE
CRUSHING LMPACT OF FAILURES 417 7.2.1 NODE FAILURES: SINGLE-FAULT
DISASTER 417 7.2.2 CONSEQUENCES OF THE SINGLE-FAULT DISASTER 424 7.3
LOCALIZED ENTITY FAILURES: USING SYNCHRONY 425 7.3.1 SYNCHRONOUS
CONSENSUS WITH CRASH FAILURES 426 7.3.2 SYNCHRONOUS CONSENSUS WITH
BYZANTINE FAILURES 430 7.3.3 LIMIT TO NUMBER OF BYZANTINE ENTITIES FOR
AGREEMENT 435 7.3.4 FROM BOOLEAN TO GENERAL BYZANTINE AGREEMENT 438
7.3.5 BYZANTINE AGREEMENT IN ARBITRARY GRAPHS 440 7.4 LOCALIZED ENTITY
FAUEURES; USING RANDOMIZATION 443 7.4.1 RANDOM ACTIONS ANDCOIN FLIPS 443
7.4.2 RANDOMI/.ED ASYNCHRONOUS CONSENSUS: CRASH FAILURES 444 7.4.3
CONCLUDING REMARKS 449 XII CONTERJTS 7.5 LOCALIZED ENTJTY FAILURES:
USING FAULT DETECTION 449 7.5.1 FAILURE DETENTORS AND THEIR PROPERTIES
450 7.5.2 THE WEAKEST FAILURE DETECTOR 452 7.6 LOCALIZED ENTITY
FAILURES: PREEXECUTION FAILURES 454 7.6.1 PARTIAL RELIABIIILY 454 7.6.2
EXAMPLE: ELECTION IN COMPLETE NETWORK 455 7.7 LOCALIZED LINK FAILURES
457 7.7.1 A TALE OF TWO SYNCHRONOUS GENERALS 458 7.7.2 COMPUTING WITH
FAULTY LINKS 461 7.7.3 CONCLUDING REMARKS 466 7.7.4 CONSIDERATIONS ON
LOCALIZED ENTITY FAILURES 466 7.8 UBIQUITOUS FAULTS 467 7.8.1
COMMUNICATION FAULTS AND AGREEMENT 467 7.8.2 LIMITS TO NUMBER OF
UBIQUITOUS FAULTS FOR MAJORITY 468 7.8.3 UNANIMITY IN SPITE OF
UBIQUITOUS FAULTS 475 7.8.4 TIGHTNESS 485 7.9 BIHLIOGRAPHICAL NOTES 486
7.10 EXERCISES. PROBLEMS, AND ANSWERS 488 7.10.1 EXERCISES 488 7.10.2
PROBLEMS 492 7.10.3 ANSWERS TO EXERCISES 493 S. DETECTING STAHLE
PROPERTIES 500 8.1 INTRODUCLION 500 8.2 DEADLOCK DETECTION 500 8.2.1
DEADLOCK 500 8.2.2 DETECTING DEADLOCK; WAIT-TBR GRAPH 501 8.2.3
SINGLE-REQNEST SYSTEMS 503 8.2.4 MULTIPLE-RCQUESTS SYSTEMS 505 8.2.5
DYNAMIC WAIT-FOR GRAPHS 512 8.2.6 OTHER REQUESTS SYSTEMS 516 8.3 GLOBAL
TERMINATION DETECTION 518 8.3.1 A SIMPLE SOLUTION: REPEAIED TERMINATION
QUERIES 519 8.3.2 IMPROVED PROTOCOLS: SHRINK 523 8.3.3 CONCLUDING
REMARKS 525 8.4 GLOBAL STAHLE PROPERTY DETECTION 526 8.4.1 GENERA]
STRATEGY 526 8.4.2 TIME CUTS AND CONSISTENT SNAPSHOTS 527 8.4.3
COMPUTING A CONSISTENT SNAPSHOT 530 8.4.4 SUMMARY: PUTTING ALL TOGCTHER
53! 8.5 BIBLIOGRAPHICAL NOTES , 532 CONTENTS XIII 8.6 EXERCISES,
PROBLEMS, AND ANSWERS 534 8.6.1 EXERCISES 534 8.6.2 PROBLEMS 536 8.6.3
ANSWERS TO EXERCISES 538 9. CONTINUOUS COMPUTATIONS 541 9.1 INTRODUCTION
54! 9.2 KEEPING VIRTUAL TIME 542 9.2.1 VIRTUAL TIME AND CAUSA! ORDER 542
9.2.2 CAUSA! ORDER: COUNTCR CLOCKS 544 9.2.3 COMPLETE CAUSAL ORDER:
VECTOR CLOCKS 545 9.2.4 CONCLUDING REMARKS 548 9.3 DISLRIBTITED MUTUAL
EXCLUSION 549 9.3.1 THE PROBLEM 549 9.3.2 A SIMPLE AND EFFICIENT
SOLUTION 550 9.3.3 TRAVERSITIG THE NETWORK 551 9.3.4 MANAGING A
DISTRIBULED QUEUE 554 9.3.5 DECENTRALIZED PERMISSIONS 559 9.3.6 MUTUAL
EXCLUSION IN COMPLETE GRAPHS: QUORUM 561 9.3.7 CONCLUDING REMARKS 564
9.4 DEADLOCK: SYSTEM DETECTION AND RESOLUTION 566 9.4.1 SYSTEM DETECTION
AND RESOLUTION 566 9.4.2 DETECTION AND RESOLUTION IN SINGIE-REQUEST
SYSTEMS 567 9.4.3 DETECTION AND RESOLUTION IN MULTIPLE-REQUESTS SYSTEMS
568 9.5 BIBHOGRAPHICAL NOTES 569 9.6 EXERCISES, PROBLEMS, AND ANSWERS
570 9.6.1 EXERCISES 570 9.6.2 PROBLEMS 572 9.6.3 ANSWERS TO EXERCISES
573 INDEX 577 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Santoro, Nicola |
| author_facet | Santoro, Nicola |
| author_role | aut |
| author_sort | Santoro, Nicola |
| author_variant | n s ns |
| building | Verbundindex |
| bvnumber | BV021839709 |
| 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 134 |
| ctrlnum | (OCoLC)65521547 (DE-599)BVBBV021839709 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01665nam a2200445zc 4500</leader><controlfield tag="001">BV021839709</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20071204 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">061205s2007 xxud||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2006011214</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0471719978</subfield><subfield code="c">cloth</subfield><subfield code="9">0-471-71997-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780471719977</subfield><subfield code="9">978-0-471-71997-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)65521547</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021839709</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-703</subfield><subfield code="a">DE-188</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">005.1</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">Santoro, Nicola</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Design and analysis of distributed algorithms</subfield><subfield code="c">Nicola Santoro</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hoboken, NJ</subfield><subfield code="b">Wiley-Interscience</subfield><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVIII, 589 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="500" ind1=" " ind2=" "><subfield code="a">Includes index.</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=" " ind2="4"><subfield code="a">Computer algorithms</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="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=" "><subfield code="u">http://www.loc.gov/catdir/toc/ecip0611/2006011214.html</subfield><subfield code="3">Table of contents only</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015051581&sequence=000001&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-015051581</subfield></datafield></record></collection> |
| id | DE-604.BV021839709 |
| illustrated | Illustrated |
| index_date | 2024-07-02T16:00:04Z |
| indexdate | 2024-07-09T20:45:50Z |
| institution | BVB |
| isbn | 0471719978 9780471719977 |
| language | English |
| lccn | 2006011214 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015051581 |
| oclc_num | 65521547 |
| open_access_boolean | |
| owner | DE-703 DE-188 |
| owner_facet | DE-703 DE-188 |
| physical | XVIII, 589 S. graph. Darst. |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| publisher | Wiley-Interscience |
| record_format | marc |
| series2 | Wiley series on parallel and distributed computing |
| spelling | Santoro, Nicola Verfasser aut Design and analysis of distributed algorithms Nicola Santoro Hoboken, NJ Wiley-Interscience 2007 XVIII, 589 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Wiley series on parallel and distributed computing Includes index. Datenverarbeitung Electronic data processing Distributed processing Computer algorithms Verteilter Algorithmus (DE-588)4200453-6 gnd rswk-swf Verteilter Algorithmus (DE-588)4200453-6 s DE-604 http://www.loc.gov/catdir/toc/ecip0611/2006011214.html Table of contents only GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015051581&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Santoro, Nicola Design and analysis of distributed algorithms Datenverarbeitung Electronic data processing Distributed processing Computer algorithms Verteilter Algorithmus (DE-588)4200453-6 gnd |
| subject_GND | (DE-588)4200453-6 |
| title | Design and analysis of distributed algorithms |
| title_auth | Design and analysis of distributed algorithms |
| title_exact_search | Design and analysis of distributed algorithms |
| title_exact_search_txtP | Design and analysis of distributed algorithms |
| title_full | Design and analysis of distributed algorithms Nicola Santoro |
| title_fullStr | Design and analysis of distributed algorithms Nicola Santoro |
| title_full_unstemmed | Design and analysis of distributed algorithms Nicola Santoro |
| title_short | Design and analysis of distributed algorithms |
| title_sort | design and analysis of distributed algorithms |
| topic | Datenverarbeitung Electronic data processing Distributed processing Computer algorithms Verteilter Algorithmus (DE-588)4200453-6 gnd |
| topic_facet | Datenverarbeitung Electronic data processing Distributed processing Computer algorithms Verteilter Algorithmus |
| url | http://www.loc.gov/catdir/toc/ecip0611/2006011214.html http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015051581&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT santoronicola designandanalysisofdistributedalgorithms |