Distributed algorithms:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
San Francisco, Calif.
Morgan Kaufmann
2003
|
| Ausgabe: | [Nachdr.] |
| Schriftenreihe: | The Morgan Kaufmann series in data management systems
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XXIII, 872 S. graph. Darst. |
| ISBN: | 1558603484 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV019367118 | ||
| 003 | DE-604 | ||
| 005 | 20020410 | ||
| 007 | t | ||
| 008 | 040817s2003 d||| |||| 00||| eng d | ||
| 020 | |a 1558603484 |9 1-55860-348-4 | ||
| 035 | |a (OCoLC)249149491 | ||
| 035 | |a (DE-599)BVBBV019367118 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-473 |a DE-634 | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a DAT 516d |2 stub | ||
| 100 | 1 | |a Lynch, Nancy A. |d 1948- |e Verfasser |0 (DE-588)121919625 |4 aut | |
| 245 | 1 | 0 | |a Distributed algorithms |c Nancy A. Lynch |
| 250 | |a [Nachdr.] | ||
| 264 | 1 | |a San Francisco, Calif. |b Morgan Kaufmann |c 2003 | |
| 300 | |a XXIII, 872 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a The Morgan Kaufmann series in data management systems | |
| 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 | 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=012830688&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-012830688 | ||
Datensatz im Suchindex
| _version_ | 1804132804236148736 |
|---|---|
| adam_text | DISTRIBUTED ALGORITHMS NANCY A. LYNCH MORGAN KAUFMANN PUBLISHERS, INC.
SAN FRANCISCO, CALIFORNIA CONTENTS PREFACE X J X 1 INTRODUCTION 1 1.1
THE SUBJECT MATTER 1 1.2 OUR VIEWPOINT 4 1.3 OVERVIEW OF CHAPTERS 2-25 6
1.4 BIBLIOGRAPHIE NOTES 13 1.5 NOTATION 14 PART I SYNCHRONOUS NETWORK
ALGORITHMS 15 2 MODELLING I: SYNCHRONOUS NETWORK MODEL 17 2.1
SYNCHRONOUS NETWORK SYSTEMS 17 2.2 FAILURES 19 2.3 INPUTS AND OUTPUTS 20
2.4 EXECUTIONS 20 2.5 PROOF METHODS 21 2.6 COMPLEXITY MEASURES 21 2.7
RANDOMIZATION 22 2.8 BIBLIOGRAPHIE NOTES 23 3 LEADER ELECTION IN A
SYNCHRONOUS RING 25 3.1 THE PROBLEM 25 3.2 IMPOSSIBILITY RESULT FOR
IDENTICAL PROCESSES 27 3.3 A BASIC ALGORITHM 27 3.4 AN ALGORITHM WITH O
(N LOG N) COMMUNICATION COMPLEXITY ... 31 3.5 NON-COMPARISON-BASED
ALGORITHMS 35 3.5.1 THE TIMESLICE ALGORITHM 35 3.5.2 THE VARIABLESPEEDS
ALGORITHM 36 3.6 LOWER BOUND FOR COMPARISON-BASED ALGORITHMS 38 VIUE
CONTENTS 3.7 LOWER BOUND FOR NON-COMPARISON-BASED ALGORITHMS* 44 3.8
BIBLIOGRAPHIE NOTES 46 3.9 EXERCISES 47 4 ALGORITHMS IN GENERAL
SYNCHRONOUS NETWORKS 51 4.1 LEADER ELECTION IN A GENERAL NETWORK 52
4.1.1 THE PROBLEM 52 4.1.2 A SIMPLE FLOODING ALGORITHM 52 4.1.3
R.EDUCING THE COMMUNICATION COMPLEXITY 54 4.2 BREADTH-FIRST SEARCH 57
4.2.1 THE PROBLEM 57 4.2.2 A BASIC BREADTH-FIRST SEARCH ALGORITHM 58
4.2.3 APPLICATIONS 60 4.3 SHORTEST PATHS 61 4.4 MINIMUM SPANNING TREE 63
4.4.1 THE PROBLEM 63 4.4.2 BASIC THEORY 64 4.4.3 THE ALGORITHM 66 4.5
MAXIMAL INDEPENDCNT SET 71 4.5.1 THE PROBLEM 71 4.5.2 A RANDOMIZED
ALGORITHM 71 4.5.3 ANALYSIS* 74 4.6 BIBLIOGRAPHIE NOTES 76 4.7 EXERCISES
77 5 DISTRIBUTED CONSENSUS WITH LINK FAILURES 81 5.1 THE COORDINATED
ATTACK PROBLEM*DETERMINISTIC VERSION . . . . 82 5.2 THE COORDINATED
ATTACK PROBLEM*RANDOMIZED VERSION 86 5.2.1 FORMAL MODELIMG 87 5.2.2 AN
ALGORITHM 88 5.2.3 A LOWER BOUND ON DISAGREEMCNT 93 5.3 BIBLIOGRAPHIE
NOTES 95 5.4 EXERCISES 95 6 DISTRIBUTED CONSENSUS WITH PROCESS FAILURES
99 6.1 THE PROBLEM 100 6.2 ALGORITHMS FOR STOPPING FAILURES 102 6.2.1 A
BASIC ALGORITHM 103 6.2.2 REDUCING THE COMMUNICATION 105 6.2.3
EXPONENTIAL INFORMATION GATHERING ALGORITHMS 108 CONTENTS IX 6.2.4
BYZANTINE AGREEMENT WITH AUTHENTICATION 115 6.3 ALGORITHMS FOR BYZANTINE
FAILURES 116 6.3.1 AN EXAMPLE 117 6.3.2 EIG ALGORITHM FOR BYZANTINE
AGREEMENT 119 6.3.3 GENERAL BYZANTINE AGREEMENT USING BINARY BYZANTINE
AGREEMENT 123 6.3.4 REDUCING THE COMMURIICATION COST 125 6.4 NUMBER OF
PROCESSCS FOR BYZANTINE AGREEMENT 129 6.5 BYZANTINE AGREEMENT IN GENERAL
GRAPHS 135 6.6 WEAK BYZANTINE AGREEMENT 139 6.7 NUMBER OF ROUNDS WITH
STOPPING FAILURES 142 6.8 BIBLIOGRAPHIE NOTES 152 6.9 EXERCISES 153 7
MORE CONSENSUS PROBLEMS 161 7.1 K- AGREEMENT 161 7.1.1 THE PROBLEM 162
7.1.2 AN ALGORITHM 162 7.1.3 LOWER BOUND* 164 7.2 APPROXIMATE AGREEMENT
177 7.3 THE COMMIT PROBLEM 182 7.3.1 THE PROBLEM 182 7.3.2 TWO-PHASE
COMMIT 184 7.3.3 THREE-PHASE CORNMIT 185 7.3.4 LOWER BOUND ON THE NUMBER
OF MESSAGES 189 7.4 BIBLIOGRAPHIE NOTES 192 7.5 EXERCISES 192 PART II
ASYNCHRONOUS ALGORITHMS 197 8 MODELLING II: ASYNCHRONOUS SYSTEM MODEL
199 8.1 I/O AUTOMATA 200 8.2 OPERATIONS ON AUTOMATA 206 8.2.1
COMPOSITION 207 8.2.2 HIDING 212 8.3 FAIRNESS 212 8.4 INPUTS AND OUTPUTS
FOR PROBLEMS 215 8.5 PROPERTIES AND PROOF METHODS 216 8.5.1 INVARIANT
ASSERTIONS 216 X CONTENTS 8.5.2 TRACE PROPERTIES 216 8.5.3 SAFETY AND
LIVENESS PROPERTIES 218 8.5.4 COMPOSITIONAL REASONING 221 8.5.5
HIERARCHICAL PROOFS 224 8.6 COMPLEXITY MEASURES 228 8.7
INDISTINGUISHABLE EXECUTIONS 229 8.8 RANDOMIZATION 229 8.9 BIBLIOGRAPHIE
NOTES 230 8.10 EXERCISES 231 PART IIA ASYNCHRONOUS SHARED MEMORY
ALGORITHMS 235 9 MODELLING III: ASYNCHRONOUS SHARED MEMORY MODEL 237 9.1
SHARED MEMORY SYSTEMS 237 9.2 ENVIRONMENT MODEL 241 9.3
INDISTINGUISHABLE STATES 244 9.4 SHARED VARIABLE TYPES 244 9.5
COMPLEXITY MEASURES 250 9.6 FAILURES 251 9.7 RANDOMIZATION 251 9.8
BIBLIOGRAPHIE NOTES 251 9.9 EXERCISES 252 10 MUTUAL EXCLUSION 255 10.1
ASYNCHRONOUS SHARED MEMORY MODEL 256 10.2 THE PROBLEM 259 10.3
DIJKSTRA S MUTUAL EXCLUSION ALGORITHM 265 10.3.1 THE ALGORITHM 265
10.3.2 A CORRECTNESS ARGUMENT 269 10.3.3 AN ASSERTIONAL PROOF OF THE
MUTUAL EXCLUSION CONDITION . 272 10.3.4 RUNNING TIME 274 10.4 STRONGER
CONDITIONS FOR MUTUAL EXCLUSION ALGORITHMS 276 10.5 LOCKOUT-FREE MUTUAL
EXCLUSION ALGORITHMS 278 10.5.1 A TWO-PROCESS ALGORITHM 278 10.5.2 AN
N-PROCESS ALGORITHM 283 10.5.3 TOURNAMENT ALGORITHM 289 10.6 AN
ALGORITHM USING SINGLE-WRITER SHARED REGISTERS 294 10.7 THE BAKERY
ALGORITHM 296 10.8 LOWER BOUND ON THE NUMBER OF REGISTERS 300 CONTENTS
XI 10.8.1 BASIC FACTS 301 10.8.2 SINGLE-WRITER SHARED VARIABLES 302
10.8.3 MULTI-WRITER SHARED VARIABLES 302 10.9 MUTUAL EXCLUSION USING
READ-MODIFY-WRITE SHARED VARIABLES . . 309 10.9.1 THE BASIC PROBLEM 310
10.9.2 BOUNDED BYPASS 311 10.9.3 LOCKOUT-FREEDOM 319 10.9.4 A SIMULATION
PROOF 322 10.10 BIBLIOGRAPHIE NOTES 326 10.11 EXERCISES 327 11 RESOURCE
ALLOCATION 335 11.1 THE PROBLEM 336 11.1.1 EXPLICIT RESOURCE
SPECIFICATIONS AND EXCLUSION SPECIFLCATIONS 336 11.1.2
RESOURCE-ALLOCATION PROBLEM 337 11.1.3 DINING PHILOSOPHERS PROBLEM 339
11.1.4 RESTRICTED FORM OF SOLUTIONS 341 11.2 NONEXISTENCE OF SYMMETRIE
DINING PHILOSOPHERS ALGORITHMS ... 341 11.3 RIGHT-LEFT DINING
PHILOSOPHERS ALGORITHM 344 11.3.1 WAITING CHAINS 344 11.3.2 THE BASIC
ALGORITHM 346 11.3.3 A GENERALIZATION 349 11.4 RANDOMIZED DINING
PHILOSOPHERS ALGORITHM* 354 11.4.1 THE ALGORITHM* 354 11.4.2
CORRECTNESS* 357 11.5 BIBLIOGRAPHIE NOTES 367 11.6 EXERCISES 367 12
CONSENSUS 371 12.1 THE PROBLEM 372 12.2 AGREEMENT USING READ/WRITE
SHARED MEMORY 376 12.2.1 RESTRICTIONS 376 12.2.2 TERMINOLOGY 376 12.2.3
BIVALENT INITIALIZATIONS 377 12.2.4 IMPOSSIBILITY FOR WAIT-FREE
TERMINATION 378 12.2.5 IMPOSSIBILITY FOR SINGLE-FAILURE TERMINATION 383
12.3 AGREEMENT USING READ-MODIFY-WRITE SHARED MEMORY 387 12.4 OTHER
TYPES OF SHARED MEMORY 388 12.5 COMPUTABILITY IN ASYNCHRONOUS SHARED
MEMORY SYSTEMS* . . . . 389 XII CONTENTS 12.6 BIBLIOGRAPHIE NOTES 391
12.7 EXERCISES 392 13 ATOMIC OBJECTS 397 13.1 DEFINITIONS AND BASIC
RESULTS 398 13.1.1 ATOMIC OBJECT DEFINITION 398 13.1.2 A CANONICAL
WAIT-FREE ATOMIC OBJECT AUTOMATON . . . . 408 13.1.3 COMPOSITION OF
ATOMIC OBJECTS 411 13.1.4 ATOMIC OBJECTS VERSUS SHARED VARIABLES 411
13.1.5 A SUMCIENT CONDITION FOR SHOWING ATOMICITY 419 13.2 IMPLEMENTING
READ-MODIFY-WRITE ATOMIC OBJECTS IN TERMS OF RCAD/WRITE VARIABLES 420
13.3 ATOMIC SNAPSHOTS OF SHARED MEMORY 421 13.3.1 THE PROBLEM 422 13.3.2
AN ALGORITHM WITH UNBOUNDED VARIABLES 423 13.3.3 AN ALGORITHM WITH
BOUNDED VARIABLES* 428 13.4 READ/WRITE ATOMIC OBJECTS 434 13.4.1 THE
PROBLEM 434 13.4.2 ANOTHER LEMMA FOR SHOWING ATOMICITY 434 13.4.3 AN
ALGORITHM WITH UNBOUNDED VARIABLES 436 13.4.4 A BOUNDED ALGORITHM FOR
TWO WRITERS 440 13.4.5 AN ALGORITHM USING SNAPSHOTS 447 13.5
BIBLIOGRAPHIE NOTES 449 13.6 EXERCISES 450 PART IIB ASYNCHRONOUS NETWORK
ALGORITHMS 455 14 MODELLING IV: ASYNCHRONOUS NETWORK MODEL 457 14.1
SEND/RECEIVE SYSTEMS 457 14.1.1 PROCESSES 458 14.1.2 SEND/RECEIVE
CHANNELS 458 14.1.3 ASYNCHRONOUS SEND/RECEIVE SYSTEMS 464 14.1.4
PROPERTIES OF SEND/RECEIVE SYSTEMS WITH RELIABLE FIFO CHANNELS 464
14.1.5 COMPLEXITY MEASURES 466 14.2 BROADCAST SYSTEMS 466 14.2.1
PROCESSES 466 14.2.2 BROADCAST CHANNEL 467 14.2.3 ASYNCHRONOUS BROADCAST
SYSTEMS 468 CONTENTS XIII 14.2.4 PROPERTIES OF BROADCAST SYSTEMS WITH
RELIABLE BROADCAST CHANNELS 468 14.2.5 COMPLEXITY MEASURES 469 14.3
MULTICAST SYSTEMS 469 14.3.1 PROCCSSES 469 14.3.2 MULTICAST CHANNEL 470
14.3.3 ASYNCHRONOUS MULTICAST SYSTEMS 471 14.4 BIBLIOGRAPHIE NOTES 471
14.5 EXERCISES 471 15 BASIC ASYNCHRONOUS NETWORK ALGORITHMS 475 15.1
LEADER ELECTION IN A RING 475 15.1.1 THE LCR ALGORITHM 476 15.1.2 THE HS
ALGORITHM 482 15.1.3 THE PETERSON LEADER-ELECTION ALGORITHM 482 15.1.4 A
LOWER BOUND ON COMMUNICATION COMPLEXITY 486 15.2 LEADER ELECTION IN AN
ARBITRARY NETWORK 495 15.3 SPANNING TREE CONSTRUCTION, BROADCAST AND
CONVERGECAST . . . . 496 15.4 BREADTH-FIRST SEARCH AND SHORTEST PATHS
501 15.5 MINIMUM SPANNING TREE 509 15.5.1 PROBLEM STATEMENT 509 15.5.2
THE SYNCHRONOUS ALGORITHM: REVIEW 510 15.5.3 THE GHS ALGORITHM: OUTLINE
511 15.5.4 IN MORE DETAIL 513 15.5.5 SPECIFIC MESSAGES 517 15.5.6
COMPLEXITY ANALYSIS 519 15.5.7 PROVING CORRECTNESS FOR THE GHS ALGORITHM
521 15.5.8 A SIMPLER SYNCHRONOUS STRATEGY 522 15.5.9 APPLICATION TO
LEADER ELECTION 523 15.6 BIBLIOGRAPHIE NOTES 523 15.7 EXERCISES 524 16
SYNCHRONIZERS 531 16.1 THE PROBLEM 532 16.2 THE LOCAL SYNCHRONIZER 535
16.3 THE SAFE SYNCHRONIZER 541 16.3.1 FRONT-END AUTOMATA 542 16.3.2
CHANNEL AUTOMATA 544 16.3.3 THE SAFE SYNCHRONIZER 544 16.3.4 CORRECTNESS
545 XIV CONTENTS WA SAFE SYNCHRONIZER IMPLEMENTATIONS 546 16.4.1
SYNCHRONIZER ALPHA 546 16.4.2 SYNCHRONIZER BETA 547 16.4.3 SYNCHRONIZER
GAMMA 548 16.5 APPLICATIONS 553 16.5.1 LEADER ELECTION 553 16.5.2
BREADTH-FIRST SEARCH 554 16.5.3 SHORTEST PATHS 554 16.5.4 BROADCAST AND
ACKNOWLEDGMENT 555 16.5.5 MAXIMAL INDEPENDENT SET 555 16.6 LOWER BOUND
ON TIME 555 16.7 BIBLIOGRAPHIE NOTES 560 16.8 EXERCISES 560 17 SHARED
MEMORY VERSUS NETWORKS 565 17.1 TRANSFORMATIONS FROM THE SHARED MEMORY
MODEL TO THE NETWORK MODEL 566 17.1.1 THE PROBLEM 566 17.1.2 STRATEGIES
ASSUMING NO FAILURES 567 17.1.3 AN ALGORITHM TOLERATING PROCESS FAILURES
575 17.1.4 AN IMPOSSIBILITY RESULT FOR F FAILURES 580 17.2
TRANSFORMATIONS FROM THE NETWORK MODEL TO THE SHARED MEMORY MODEL 582
17.2.1 SEND/RECEIVE SYSTEMS 583 17.2.2 BROADCAST SYSTEMS 585 17.2.3
IMPOSSIBILITY OF AGREEMENT IN ASYNCHRONOUS NETWORKS . . 586 17.3
BIBLIOGRAPHIE NOTES 586 17.4 EXERCISES 587 18 LOGICAL TIME 591 18.1
LOGICAL TIME FOR ASYNCHRONOUS NETWORKS 591 18.1.1 SEND/RECEIVE SYSTEMS
592 18.1.2 BROADCAST SYSTEMS 594 18.2 ADDING LOGICAL TIME TO
ASYNCHRONOUS ALGORITHMS 596 18.2.1 ADVANCING THE CLOCK 597 18.2.2
DELAYING FUTURE EVENTS 598 18.3 APPLICATIONS 600 18.3.1 BANKING SYSTEM
600 18.3.2 GLOBAL SNAPSHOTS 604 18.3.3 SIMULATING A SINGLE STATE MACHINE
606 CONTENTS XV 18.4 TRANSFORMING REAL-TIME ALGORITHMS TO LOGICAL-TIME
ALGORITHMS* 610 18.5 BIBLIOGRAPHIE NOTES 612 18.6 EXERCISES 612 19
GLOBAL SNAPSHOTS AND STABLE PROPERTIES 617 19.1 TERMINATION-DETECTION
FOR DIFFUSING ALGORITHMS 618 19.1.1 THE PROBLEM 618 19.1.2 THE
DIJKSTRASCHOLTEN ALGORITHM 619 19.2 CONSISTENT GLOBAL SNAPSHOTS 625
19.2.1 THE PROBLEM 625 19.2.2 THE CHANDYLAMPORT ALGORITHM 627 19.2.3
APPLICATIONS 632 19.3 BIBLIOGRAPHIE NOTES 636 19.4 EXERCISES 637 20
NETWORK RESOURCE ALLOCATION 641 20.1 MUTUAL EXCLUSION 641 20.1.1 THE
PROBLEM 641 20.1.2 SIMULATING SHARED MEMORY 643 20.1.3 CIRCULATING TOKEN
ALGORITHM 643 20.1.4 AN ALGORITHM BASED ON LOGICAL TIME 646 20.1.5
IMPROVEMENTS TO THE LOGICALTIMEME ALGORITHM 649 20.2 GENERAL RESOURCE
ALLOCATION 653 20.2.1 THE PROBLEM 653 20.2.2 COLORING ALGORITHM 654
20.2.3 ALGORITHMS BASED ON LOGICAL TIME 655 20.2.4 ACYCLIC DIGRAPH
ALGORITHM 656 20.2.5 DRINKING PHILOSOPHERS* 658 20.3 BIBLIOGRAPHIE NOTES
665 20.4 EXERCISES 665 21 ASYNCHRONOUS NETWORKS WITH PROCESS FAILURES
669 21.1 THE NETWORK MODEL 670 21.2 IMPOSSIBILITY OF AGREEMENT IN THE
PRESENCE OF FAULTS 671 21.3 A RANDOMIZED ALGORITHM 672 21.4 FAILURE
DETECTORS 677 21.5 FC-AGREEMENT 681 21.6 APPROXIMATE AGREEMENT 682 21.7
COMPUTABILITY IN ASYNCHRONOUS NETWORKS* 684 21.8 BIBLIOGRAPHIE NOTES 685
21.9 EXERCISES 686 XVI CONTENTS 22 DATA LINK PROTOCOLS 691 22.1 THE
PROBLEM 692 22.2 STENNING S PROTOCOL 693 22.3 ALTERNATING BIT PROTOCOL
697 22.4 BOUNDED TAG PROTOCOLS TOLERATING REORDERING 703 22.4.1
IMPOSSIBILITY RESULT FOR REORDERING AND DUPLICATION . . . 704 22.4.2 A
BOUNDED TAG PROTOCOL TOLERATING LOSS AND REORDERING 706 22.4.3
NONEXISTENCE OF EFFICIENT PROTOCOLS TOLERATING LOSS AND REORDERING 712
22.5 TOLERATING CRASHES 715 22.5.1 A SIMPLE IMPOSSIBILITY RESULT 716
22.5.2 A HAERDER IMPOSSIBILITY RESULT 718 22.5.3 A PRACTICAL PROTOCOL 721
22.6 BIBLIOGRAPHIE NOTES 728 22.7 EXERCISES 729 PART III PARTIALLY
SYNCHRONOUS ALGORITHMS 733 23 PARTIALLY SYNCHRONOUS SYSTEM MODELS 735
23.1 MMT TIMED AUTOMATA 736 23.1.1 BASIC DEFINITIONS 736 23.1.2
OPERATIONS 741 23.2 GENERAL TIMED AUTOMATA 744 23.2.1 BASIC DEFINITIONS
745 23.2.2 TRANSFORMING MMT AUTOMATA INTO GENERAL TIMED AUTOMATA 751
23.2.3 OPERATIONS 754 23.3 PROPERTIES AND PROOF METHODS 756 23.3.1
INVARIANT ASSERTIONS 757 23.3.2 TIMED TRACE PROPERTIES 759 23.3.3
SIMULATIONS 760 23.4 MODELLING SHARED MEMORY AND NETWORK SYSTEMS 768
23.4.1 SHARED MEMORY SYSTEMS 768 23.4.2 NETWORKS 768 23.5 BIBLIOGRAPHIE
NOTES 769 23.6 EXERCISES 770 CONTENTS XVN 24 MUTUAL EXCLUSION WITH
PARTIAL SYNCHRONY 773 24.1 THE PROBLEM 773 24.2 A SINGLE-REGISTER
ALGORITHM 774 24.3 RESILIENCE TO TIMING FAILURES 784 24.4 IMPOSSIBILITY
RESULTS 788 24.4.1 A LOWER BOUND ON THE TIME 788 24.4.2 IMPOSSIBILITY
RESULT FOR EVENTUAL TIME BOUNDS* 789 24.5 BIBLIOGRAPHIE NOTES 790 24.6
EXERCISES 791 25 CONSENSUS WITH PARTIAL SYNCHRONY 795 25.1 THE PROBLEM
795 25.2 A FAILURE DETECTOR 796 25.3 BASIC RESULTS 798 25.3.1 UPPER
BOUND 798 25.3.2 LOWER BOUND 801 25.4 AN EFFICIENT ALGORITHM 803 25.4.1
THE ALGORITHM 803 25.4.2 SAFETY PROPERTIES 805 25.4.3 LIVENESS AND
COMPLEXITY 806 25.5 A LOWER BOUND INVOLVING THE TIMING UNCERTAINTY* 810
25.6 OTHER RESULTS* 818 25.6.1 SYNCHRONOUS PROCESSES, ASYNCHRONOUS
CHANNELS* 818 25.6.2 ASYNCHRONOUS PROCESSES, SYNCHRONOUS CHANNELS* 819
25.6.3 EVENTUAL TIME BOUNDS* 819 25.7 POSTSCRIPT 823 25.8 BIBLIOGRAPHIE
NOTES 823 25.9 EXERCISES . 824 BIBLIOGRAPHY 829 INDEX 857
|
| any_adam_object | 1 |
| author | Lynch, Nancy A. 1948- |
| author_GND | (DE-588)121919625 |
| author_facet | Lynch, Nancy A. 1948- |
| author_role | aut |
| author_sort | Lynch, Nancy A. 1948- |
| author_variant | n a l na nal |
| building | Verbundindex |
| bvnumber | BV019367118 |
| classification_rvk | ST 130 ST 134 |
| classification_tum | DAT 516d |
| ctrlnum | (OCoLC)249149491 (DE-599)BVBBV019367118 |
| discipline | Informatik |
| edition | [Nachdr.] |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01367nam a2200361 c 4500</leader><controlfield tag="001">BV019367118</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20020410 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">040817s2003 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1558603484</subfield><subfield code="9">1-55860-348-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)249149491</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV019367118</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</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-634</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="084" ind1=" " ind2=" "><subfield code="a">DAT 516d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lynch, Nancy A.</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121919625</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Distributed algorithms</subfield><subfield code="c">Nancy A. Lynch</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">[Nachdr.]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">San Francisco, Calif.</subfield><subfield code="b">Morgan Kaufmann</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXIII, 872 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">The Morgan Kaufmann series in data management systems</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="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=012830688&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-012830688</subfield></datafield></record></collection> |
| id | DE-604.BV019367118 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T19:58:38Z |
| institution | BVB |
| isbn | 1558603484 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-012830688 |
| oclc_num | 249149491 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG DE-634 |
| owner_facet | DE-473 DE-BY-UBG DE-634 |
| physical | XXIII, 872 S. graph. Darst. |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Morgan Kaufmann |
| record_format | marc |
| series2 | The Morgan Kaufmann series in data management systems |
| spelling | Lynch, Nancy A. 1948- Verfasser (DE-588)121919625 aut Distributed algorithms Nancy A. Lynch [Nachdr.] San Francisco, Calif. Morgan Kaufmann 2003 XXIII, 872 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier The Morgan Kaufmann series in data management systems Verteilter Algorithmus (DE-588)4200453-6 gnd rswk-swf Verteilter Algorithmus (DE-588)4200453-6 s DE-604 GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012830688&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Lynch, Nancy A. 1948- Distributed algorithms Verteilter Algorithmus (DE-588)4200453-6 gnd |
| subject_GND | (DE-588)4200453-6 |
| title | Distributed algorithms |
| title_auth | Distributed algorithms |
| title_exact_search | Distributed algorithms |
| title_full | Distributed algorithms Nancy A. Lynch |
| title_fullStr | Distributed algorithms Nancy A. Lynch |
| title_full_unstemmed | Distributed algorithms Nancy A. Lynch |
| title_short | Distributed algorithms |
| title_sort | distributed algorithms |
| topic | Verteilter Algorithmus (DE-588)4200453-6 gnd |
| topic_facet | Verteilter Algorithmus |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012830688&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT lynchnancya distributedalgorithms |