Holdings: Elements of distributed computing

Elements of distributed computing:

Saved in:

Bibliographic Details
Main Author:	Garg, Vijay K. (Author)
Format:	Book
Language:	English
Published:	New York Wiley-Interscience 2006
Edition:	transferred to digital print.
Subjects:	Verteiltes System
Online Access:	Inhaltsverzeichnis
Item Description:	Includes bibliography (p. 403-419) and index
Physical Description:	XX, 423 S.
ISBN:	0471036005

Staff View

MARC


LEADER	00000nam a2200000zc 4500
001	BV023036872
003	DE-604
005	00000000000000.0
007	t
008	071205s2006 xxu \|\|\|\| 00\|\|\| eng d
020			\|a 0471036005 \|9 0-471-03600-5
035			\|a (OCoLC)633932069
035			\|a (DE-599)BVBBV023036872
040			\|a DE-604 \|b ger \|e aacr
041	0		\|a eng
044			\|a xxu \|c US
049			\|a DE-473 \|a DE-739
084			\|a ST 200 \|0 (DE-625)143611: \|2 rvk
100	1		\|a Garg, Vijay K. \|e Verfasser \|4 aut
245	1	0	\|a Elements of distributed computing \|c Vijay K. Garg
250			\|a transferred to digital print.
264		1	\|a New York \|b Wiley-Interscience \|c 2006
300			\|a XX, 423 S.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
500			\|a Includes bibliography (p. 403-419) and index
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
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=016240634&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
999			\|a oai:aleph.bib-bvb.de:BVB01-016240634

Record in the Search Index

_version_	1804137264189538304
adam_text	Contents Foreword xvii Preface xix 1 Introduction 1 1.1 Introduction ......................... 1 1.2 Distributed Systems Versus Parallel Systems ...... 1 1.3 Characteristics of Distributed Systems .......... 3 1.4 Scope of the Book ..................... 4 1.5 Overview of the Book ................... 5 1.6 Notation ........................... 9 1.7 Problems .......................... 10 1.8 Bibliographic Remarks ................... 10 2 Model of a Computation 11 2.1 Introduction ......................... 11 2.2 Model of a Distributed System .............. 12 2.3 Interleaving Model ..................... 14 2.4 Happened Before Model ................. . 16 2.5 Potential Causality Model ................. 17 2.6 Appropriate Model ..................... 19 2.7 Models Based on States .................. 20 2.7.1 Deposet ....................... 22 2.7.2 Global Sequence of States ............. 23 2.8 Problems .......................... 25 2.9 Bibliographic Remarks ................... 25 3 Logical Clocks 27 3.1 Introduction ......................... 27 3.2 Logical Clocks ....................... 28 3.2.1 Definition...................... 28 3.2.2 Implementation................... 32 3.3 Vector Clocks ........................ 34 3.3.1 Definition...................... 34 3.3.2 Implementation................... 34 3.4 Problems .......................... 37 3.5 Bibliographic Remarks ................... 38 Verifying Clock Algorithms 39 4.1 Introduction ......................... 39 4.2 Using Induction on — ^ ................... 40 4.3 Proof of the Vector Clock Algorithm ........... 42 4.4 Problems .......................... 47 4.5 Bibliographic Remarks ................... 47 Clocks of Different Dimensions 49 5.1 Introduction ......................... 49 5.2 Direct-Dependency Clocks ................. 50 5.2.1 Algorithm ...................... 50 5.2.2 Properties ...................... 51 5.3 Higher-Dimensional Clocks ................ 55 5.3.1 State Interval .................... 56 5.3.2 Predecessor and Successor Functions ....... 56 5.3.3 Algorithm for Matrix Clock ............ 57 5.3.4 Application: Garbage Collection ......... 60 5.4 Problems .......................... 61 5.5 Bibliographic Remarks ................... 63 Mutual Exclusion: Using Timestamps 65 6.1 Introduction ......................... 65 6.2 Specifications of the Problem ............... 67 6.3 Lamport s Algorithm .................... 69 6.3.1 Proof of Correctness ................ 71 6.4 Ricart and Agrawala s Algorithm ............. 76 6.5 Problems .......................... 78 6.6 Bibliographic Remarks ................... 79 Mutual Exclusion: Tokens and Quorums 81 7.1 Introduction ......................... 81 7.2 Centralized Algorithm ................... 82 7.2.1 Proof of Correctness ................ 85 7.3 An Exercise in Decentralization .............. 85 7.4 Quorum-Based Algorithms ................. 86 7.4.1 Voting Systems ................... 89 7.4.2 Crumbling Walls ................. . 89 7.5 Problems .......................... 90 7.6 Bibliographic Remarks ................... 91 8 Drinking Philosophers Problem 93 8.1 Introduction ......................... 93 8.2 Dining Philosophers — Heavy Load ............ 94 8.3 Dining Philosophers — Light Load ............. 97 8.4 Drinking Philosophers ................... 100 8.5 Problems .......................... 104 8.6 Bibliographic Remarks ................... 104 9 Leader Election 107 9.1 Introduction ........................ . 107 9.2 Anonymous Rings ..................... 108 9.3 Chang-Roberts Algorithm ................. 109 9.4 Hirschberg-Sinclair Algorithm ............... Ill 9.5 Problems .......................... 112 9.6 Bibliographic Remarks ................... 113 10 Global State 115 10.1 Introduction ......................... 115 10.2 Consistent Cuts ....................... 118 10.3 Consistent Subcuts ..................... 119 10.4 Global Snapshot Algorithm ............... . 121 10.5 Application: Detecting Stable Properties ......... 125 10.6 Problems .......................... 127 10.7 Bibliographic Remarks ................... 128 11 Observing Global Predicates 131 11.1 Introduction ......................... 131 11.2 Modalities of Observation ................. 132 11.3 Key Problems in Observation of Global Properties . . . 135 11.3.1 Lack of Shared Clock ............... 135 11.3.2 Lack of Shared Memory .............. 136 11.3.3 Combinatorial Explosion ............. . 137 11.4 Linear Predicates ...................... 140 11.4.1 The Least Cut Satisfying a Linear Predicate . . 141 11.5 Regular Predicates ..................... 144 11.6 Problems .......................... 145 11.7 Bibliographic Remarks ................... 148 12 Observing Conjunctive Predicates 149 12.1 Introduction ......................... 149 12.2 Boolean Expressions of Local Predicates ......... 150 12.3 A Vector Clock-Based Centralized Algorithm ...... 152 12.3.1 Application Process ................ 152 12.3.2 Checker Process .................. 152 12.3.3 Proof of Correctness ................ 154 12.3.4 Overhead Analysis ................. 156 12.4 A Direct Dependency-Based Algorithm ......... 158 12.4.1 Application Process ................ 159 12.4.2 Checker Process .................. 159 12.4.3 Proof of Correctness ................ 161 12.4.4 Overhead Analysis ................. 161 12.5 A Vector Clock-Based Distributed Algorithm ...... 162 12.5.1 Overhead Analysis ................. 163 12.6 Problems .......................... 164 12.7 Bibliographic Remarks ................... 166 13 Channel Predicates 167 13.1 Introduction ......................... 167 13.2 Linear Channel Predicates ................. 168 13.3 A Centralized Algorithm .................. 170 13.3.1 Application Processes ............... 170 13.3.2 Checker Process .................. 170 13.3.3 Overhead Analysis ................ . 174 13.4 Problems .......................... 175 13.5 Bibliographic Remarks ................... 175 14 Termination Detection 177 14.1 Introduction ......................... 177 14.2 Dijkstra and Scholten s Algorithm ............ 178 14.3 An Optimization ...................... 180 14.4 Problems .......................... 180 14.5 Bibliographic Remarks ................... 182 15 Control of a Distributed Computation 183 15.1 Introduction ......................... 183 15.2 Hardness of the Control Problem ............. 185 15.3 Mutual Exclusion ...................... 187 15.4 Disjunctive Predicates ................... 189 15.5 Relationship Between Observation and Control ..... 192 15.6 Problems ....................·..... 193 15.7 Bibliographic Remarks ................... 194 16 Causal Message Ordering 195 16.1 Introduction ......................... 195 16.2 Algorithm .......................... 197 16.3 Proof of Correctness .................... 198 16.4 Problems .......................... 200 16.5 Bibliographic Remarks ................... 202 17 Synchronous and Total Order 203 17.1 Introduction ......................... 203 17.2 Synchronous Ordering ................... 207 17.2.1 Relationship Among Message Orderings ..... 208 17.2.2 Crowns in a Distributed Computation ...... 208 17.3 Algorithm .......................... 210 17.3.1 Proof of Correctness ................ 211 17.4 Total Order for Multicast Messages ............ 213 17.4.1 Centralized Algorithm ............... 214 17.4.2 Lamport s Algorithm for Total Order ......214 17.4.3 Skeen s Algorithm ................. 215 17.5 Application: Replicated State Machines ......... 216 17.6 Problems .......................... 216 17.7 Bibliographic Remarks ................... 217 18 Computation of a Global Function 219 18.1 Introduction ......................... 219 18.2 Convergecast and Broadcast ................ 220 18.3 Global Functions ...................... 223 18.4 Problems .......................... 229 18.5 Bibliographic Remarks ................... 230 19 Repeated Global Computation 231 19.1 Introduction ......................... 231 19.2 An Equitable, Revolving Hierarchy ............ 232 19.3 Implementation Issues ................... 239 19.4 Application: Branch-and-Bound Algorithm ....... 241 19.5 Problems .......................... 242 19.6 Bibliographic Remarks ................... 244 20 Synchronizers 245 20.1 Introduction ......................... 245 20.2 A Simple Synchronizer ................... 247 20.3 Synchronizer a ...................... . 248 20.4 Synchronizer β ....................... 249 20.5 Synchronizer 7....................... 249 20.6 Application: BFS Tree Algorithm ............. 251 20.7 Limitations of Synchronizers ................ 252 20.8 Problems .......................... 253 20.9 Bibliographic Remarks ................... 253 21 Slicers 255 21.1 Introduction ......................... 255 21.2 Characterization of an Execution Lattice ......... 257 21.3 Slicing a Distributed Computation ............ 259 21.4 Algorithm for Slicing Regular Predicates ......... 263 21.4.1 Step 1: Computing the Least Cut ........ 263 21.4.2 Step 2: Computing the Greatest Cut ....... 265 21.4.3 Step 3: Computing Join-Irreducible Elements . . 265 21.4.4 Step 4: Forming Equivalence Classes ...... . 266 21.5 Application: Predicate Detection and Control ...... 268 21.6 Problems .......................... 269 21.7 Bibliographic Remarks ................... 270 22 Distributed Shared Memory 271 22.1 Introduction ......................... 271 22.2 System Model ........................ 273 22.3 Sequential Consistency ................... 274 22.3.1 Local Read Algorithm ............... 277 22.3.2 Local Write Algorithm ............... 278 22.4 Linearizability ........................ 280 22.5 Other Consistency Conditions ............... 282 22.6 Problems .......................... 284 22.7 Bibliographie Remarks................... 285 23 Self-Stabilization 287 23.1 Introduction ......................... 287 23.2 Mutual Exclusion with K-State Machines ........ 288 23.2.1 Proof of Correctness ................289 23.3 Mutual Exclusion with Three-State Machines ...... 291 23.3.1 Proof of Correctness ................ 291 23.4 Problems .......................... 295 23.5 Bibliographic Remarks ................... 296 24 Knowledge and Common Knowledge 297 24.1 Introduction ......................... 297 24.2 Knowledge and Common Knowledge ........... 298 24.3 Application: Two-Generals Problem ........... 300 24.4 Defining Knowledge Based en Isomorphism ....... 302 24.5 Problems .......................... 303 24.6 Bibliographic Remarks ................... 304 25 Consensus Under Asynchrony 307 25.1 Introduction ......................... 307 25.2 Requirements and Assumptions .............. 308 25.3 An Informal Proof of the Impossibility Result ...... 311 25.4 A Formal Proof of the Impossibility Result ....... 314 25.4.1 Requirements .................... 315 25.4.2 Classification of Global States ........... 315 25.4.3 Impossibility Result ................ 317 25.5 Terminating Reliable Broadcast .............. 322 25.6 Problems .......................... 322 25.7 Bibliographic Remarks ................... 323 26 Consensus Under Synchrony 325 26.1 Introduction ......................... 325 26.2 Consensus Under Crash Failures ............. 326 26.2.1 An Algorithm for Consensus ........... 327 26.2.2 An Early Stopping Algorithm ........... 329 26.3 Consensus Under Byzantine Faults ............ 331 26.4 Problems .......................... 334 26.5 Bibliographic Remarks ................... 334 27 Failure Detectors 337 27.1 Introduction ......................... 337 27.2 Completeness and Accuracy Properties .......... 338 27.3 Relationship Among Various Failure Detectors ..... 340 27.4 Algorithm for Consensus Using OS ........... 341 27.4.1 Proof of Correctness ................ 342 27.5 Problems .......................... 344 27.6 Bibliographic Remarks ................... 345 28 Solvable Problems in Asynchronous Systems 347 28.1 Introduction ......................... 347 28.2 Failure Detection ..................... . 348 28.2.1 Infinitely Often Accurate Detectors ........ 349 28.2.2 Application: Maintaining a Leader ........ 353 28.3 ¿-Set Consensus Problem ................. 359 28.4 Reliable Broadcast Problem ................ 360 28.5 Problems .......................... 361 28.6 Bibliographic Remarks ................... 361 29 Checkpointing for Recovery 363 29.1 Introduction ......................... 363 29.2 Zig-Zag Relation ...................... 365 29.3 R-Graphs .......................... 368 29.4 Recoverable Global States: Using Slices ......... 369 29.5 Rollback Dependency Trackability (RDT) ........ 371 29.6 Communication-Induced Checkpointing ......... 372 29.7 Problems .......................... 373 29.8 Bibliographic Remarks ................... 374 30 Message Logging for Recovery 375 30.1 Introduction ......................... 375 30.2 Model ............................377 30.2.1 Happened Before With Process Failures ..... 378 30.2.2 Orphan States ................... 379 30.3 Fault-Tolerant Vector Clock ................ 379 30.3.1 Properties of FTVC ................ 381 30.4 Version End Table ..................... 384 30.5 The Protocol ........................ 384 30.5.1 An Example .................... 388 30.5.2 Proof of Correctness ................ 389 30.5.3 Properties of the Protocol ............. 391 30.5.4 Overhead Analysis ................. 392 30.6 Problems .......................... 392 30.7 Bibliographic Remarks ................... 393 A Partial Order 395 A.I Introduction ......................... 395 A. 2 Definition of Partial Orders ................ 397 A.3 Lattices ........................... 398 A. 4 Properties of Functions on Posets ............. 401 A.5 Down-Sets and Up-Sets .................. 401 A.6 Problems .......................... 402 A. 7 Bibliographic Remarks ................... 402 Bibliography 403 Index 420
adam_txt	Contents Foreword xvii Preface xix 1 Introduction 1 1.1 Introduction . 1 1.2 Distributed Systems Versus Parallel Systems . 1 1.3 Characteristics of Distributed Systems . 3 1.4 Scope of the Book . 4 1.5 Overview of the Book . 5 1.6 Notation . 9 1.7 Problems . 10 1.8 Bibliographic Remarks . 10 2 Model of a Computation 11 2.1 Introduction . 11 2.2 Model of a Distributed System . 12 2.3 Interleaving Model . 14 2.4 Happened Before Model . . 16 2.5 Potential Causality Model . 17 2.6 Appropriate Model . 19 2.7 Models Based on States . 20 2.7.1 Deposet . 22 2.7.2 Global Sequence of States . 23 2.8 Problems . 25 2.9 Bibliographic Remarks . 25 3 Logical Clocks 27 3.1 Introduction . 27 3.2 Logical Clocks . 28 3.2.1 Definition. 28 3.2.2 Implementation. 32 3.3 Vector Clocks . 34 3.3.1 Definition. 34 3.3.2 Implementation. 34 3.4 Problems . 37 3.5 Bibliographic Remarks . 38 Verifying Clock Algorithms 39 4.1 Introduction . 39 4.2 Using Induction on — ^ . 40 4.3 Proof of the Vector Clock Algorithm . 42 4.4 Problems . 47 4.5 Bibliographic Remarks . 47 Clocks of Different Dimensions 49 5.1 Introduction . 49 5.2 Direct-Dependency Clocks . 50 5.2.1 Algorithm . 50 5.2.2 Properties . 51 5.3 Higher-Dimensional Clocks . 55 5.3.1 State Interval . 56 5.3.2 Predecessor and Successor Functions . 56 5.3.3 Algorithm for Matrix Clock . 57 5.3.4 Application: Garbage Collection . 60 5.4 Problems . 61 5.5 Bibliographic Remarks . 63 Mutual Exclusion: Using Timestamps 65 6.1 Introduction . 65 6.2 Specifications of the Problem . 67 6.3 Lamport's Algorithm . 69 6.3.1 Proof of Correctness . 71 6.4 Ricart and Agrawala's Algorithm . 76 6.5 Problems . 78 6.6 Bibliographic Remarks . 79 Mutual Exclusion: Tokens and Quorums 81 7.1 Introduction . 81 7.2 Centralized Algorithm . 82 7.2.1 Proof of Correctness . 85 7.3 An Exercise in Decentralization . 85 7.4 Quorum-Based Algorithms . 86 7.4.1 Voting Systems . 89 7.4.2 Crumbling Walls . . 89 7.5 Problems . 90 7.6 Bibliographic Remarks . 91 8 Drinking Philosophers Problem 93 8.1 Introduction . 93 8.2 Dining Philosophers — Heavy Load . 94 8.3 Dining Philosophers — Light Load . 97 8.4 Drinking Philosophers . 100 8.5 Problems . 104 8.6 Bibliographic Remarks . 104 9 Leader Election 107 9.1 Introduction . . 107 9.2 Anonymous Rings . 108 9.3 Chang-Roberts Algorithm . 109 9.4 Hirschberg-Sinclair Algorithm . Ill 9.5 Problems . 112 9.6 Bibliographic Remarks . 113 10 Global State 115 10.1 Introduction . 115 10.2 Consistent Cuts . 118 10.3 Consistent Subcuts . 119 10.4 Global Snapshot Algorithm . . 121 10.5 Application: Detecting Stable Properties . 125 10.6 Problems . 127 10.7 Bibliographic Remarks . 128 11 Observing Global Predicates 131 11.1 Introduction . 131 11.2 Modalities of Observation . 132 11.3 Key Problems in Observation of Global Properties . . . 135 11.3.1 Lack of Shared Clock . 135 11.3.2 Lack of Shared Memory . 136 11.3.3 Combinatorial Explosion . . 137 11.4 Linear Predicates . 140 11.4.1 The Least Cut Satisfying a Linear Predicate . . 141 11.5 Regular Predicates . 144 11.6 Problems . 145 11.7 Bibliographic Remarks . 148 12 Observing Conjunctive Predicates 149 12.1 Introduction . 149 12.2 Boolean Expressions of Local Predicates . 150 12.3 A Vector Clock-Based Centralized Algorithm . 152 12.3.1 Application Process . 152 12.3.2 Checker Process . 152 12.3.3 Proof of Correctness . 154 12.3.4 Overhead Analysis . 156 12.4 A Direct Dependency-Based Algorithm . 158 12.4.1 Application Process . 159 12.4.2 Checker Process . 159 12.4.3 Proof of Correctness . 161 12.4.4 Overhead Analysis . 161 12.5 A Vector Clock-Based Distributed Algorithm . 162 12.5.1 Overhead Analysis . 163 12.6 Problems . 164 12.7 Bibliographic Remarks . 166 13 Channel Predicates 167 13.1 Introduction . 167 13.2 Linear Channel Predicates . 168 13.3 A Centralized Algorithm . 170 13.3.1 Application Processes . 170 13.3.2 Checker Process . 170 13.3.3 Overhead Analysis . . 174 13.4 Problems . 175 13.5 Bibliographic Remarks . 175 14 Termination Detection 177 14.1 Introduction . 177 14.2 Dijkstra and Scholten's Algorithm . 178 14.3 An Optimization . 180 14.4 Problems . 180 14.5 Bibliographic Remarks . 182 15 Control of a Distributed Computation 183 15.1 Introduction . 183 15.2 Hardness of the Control Problem . 185 15.3 Mutual Exclusion . 187 15.4 Disjunctive Predicates . 189 15.5 Relationship Between Observation and Control . 192 15.6 Problems .·. 193 15.7 Bibliographic Remarks . 194 16 Causal Message Ordering 195 16.1 Introduction . 195 16.2 Algorithm . 197 16.3 Proof of Correctness . 198 16.4 Problems . 200 16.5 Bibliographic Remarks . 202 17 Synchronous and Total Order 203 17.1 Introduction . 203 17.2 Synchronous Ordering . 207 17.2.1 Relationship Among Message Orderings . 208 17.2.2 Crowns in a Distributed Computation . 208 17.3 Algorithm . 210 17.3.1 Proof of Correctness . 211 17.4 Total Order for Multicast Messages . 213 17.4.1 Centralized Algorithm . 214 17.4.2 Lamport's Algorithm for Total Order .214 17.4.3 Skeen's Algorithm . 215 17.5 Application: Replicated State Machines . 216 17.6 Problems . 216 17.7 Bibliographic Remarks . 217 18 Computation of a Global Function 219 18.1 Introduction . 219 18.2 Convergecast and Broadcast . 220 18.3 Global Functions . 223 18.4 Problems . 229 18.5 Bibliographic Remarks . 230 19 Repeated Global Computation 231 19.1 Introduction . 231 19.2 An Equitable, Revolving Hierarchy . 232 19.3 Implementation Issues . 239 19.4 Application: Branch-and-Bound Algorithm . 241 19.5 Problems . 242 19.6 Bibliographic Remarks . 244 20 Synchronizers 245 20.1 Introduction . 245 20.2 A Simple Synchronizer . 247 20.3 Synchronizer a . . 248 20.4 Synchronizer β . 249 20.5 Synchronizer 7. 249 20.6 Application: BFS Tree Algorithm . 251 20.7 Limitations of Synchronizers . 252 20.8 Problems . 253 20.9 Bibliographic Remarks . 253 21 Slicers 255 21.1 Introduction . 255 21.2 Characterization of an Execution Lattice . 257 21.3 Slicing a Distributed Computation . 259 21.4 Algorithm for Slicing Regular Predicates . 263 21.4.1 Step 1: Computing the Least Cut . 263 21.4.2 Step 2: Computing the Greatest Cut . 265 21.4.3 Step 3: Computing Join-Irreducible Elements . . 265 21.4.4 Step 4: Forming Equivalence Classes . . 266 21.5 Application: Predicate Detection and Control . 268 21.6 Problems . 269 21.7 Bibliographic Remarks . 270 22 Distributed Shared Memory 271 22.1 Introduction . 271 22.2 System Model . 273 22.3 Sequential Consistency . 274 22.3.1 Local Read Algorithm . 277 22.3.2 Local Write Algorithm . 278 22.4 Linearizability . 280 22.5 Other Consistency Conditions . 282 22.6 Problems . 284 22.7 Bibliographie Remarks. 285 23 Self-Stabilization 287 23.1 Introduction . 287 23.2 Mutual Exclusion with K-State Machines . 288 23.2.1 Proof of Correctness .289 23.3 Mutual Exclusion with Three-State Machines . 291 23.3.1 Proof of Correctness . 291 23.4 Problems . 295 23.5 Bibliographic Remarks . 296 24 Knowledge and Common Knowledge 297 24.1 Introduction . 297 24.2 Knowledge and Common Knowledge . 298 24.3 Application: Two-Generals Problem . 300 24.4 Defining Knowledge Based en Isomorphism . 302 24.5 Problems . 303 24.6 Bibliographic Remarks . 304 25 Consensus Under Asynchrony 307 25.1 Introduction . 307 25.2 Requirements and Assumptions . 308 25.3 An Informal Proof of the Impossibility Result . 311 25.4 A Formal Proof of the Impossibility Result . 314 25.4.1 Requirements . 315 25.4.2 Classification of Global States . 315 25.4.3 Impossibility Result . 317 25.5 Terminating Reliable Broadcast . 322 25.6 Problems . 322 25.7 Bibliographic Remarks . 323 26 Consensus Under Synchrony 325 26.1 Introduction . 325 26.2 Consensus Under Crash Failures . 326 26.2.1 An Algorithm for Consensus . 327 26.2.2 An Early Stopping Algorithm . 329 26.3 Consensus Under Byzantine Faults . 331 26.4 Problems . 334 26.5 Bibliographic Remarks . 334 27 Failure Detectors 337 27.1 Introduction . 337 27.2 Completeness and Accuracy Properties . 338 27.3 Relationship Among Various Failure Detectors . 340 27.4 Algorithm for Consensus Using OS . 341 27.4.1 Proof of Correctness . 342 27.5 Problems . 344 27.6 Bibliographic Remarks . 345 28 Solvable Problems in Asynchronous Systems 347 28.1 Introduction . 347 28.2 Failure Detection . . 348 28.2.1 Infinitely Often Accurate Detectors . 349 28.2.2 Application: Maintaining a Leader . 353 28.3 ¿-Set Consensus Problem . 359 28.4 Reliable Broadcast Problem . 360 28.5 Problems . 361 28.6 Bibliographic Remarks . 361 29 Checkpointing for Recovery 363 29.1 Introduction . 363 29.2 Zig-Zag Relation . 365 29.3 R-Graphs . 368 29.4 Recoverable Global States: Using Slices . 369 29.5 Rollback Dependency Trackability (RDT) . 371 29.6 Communication-Induced Checkpointing . 372 29.7 Problems . 373 29.8 Bibliographic Remarks . 374 30 Message Logging for Recovery 375 30.1 Introduction . 375 30.2 Model .377 30.2.1 Happened Before With Process Failures . 378 30.2.2 Orphan States . 379 30.3 Fault-Tolerant Vector Clock . 379 30.3.1 Properties of FTVC . 381 30.4 Version End Table . 384 30.5 The Protocol . 384 30.5.1 An Example . 388 30.5.2 Proof of Correctness . 389 30.5.3 Properties of the Protocol . 391 30.5.4 Overhead Analysis . 392 30.6 Problems . 392 30.7 Bibliographic Remarks . 393 A Partial Order 395 A.I Introduction . 395 A. 2 Definition of Partial Orders . 397 A.3 Lattices . 398 A. 4 Properties of Functions on Posets . 401 A.5 Down-Sets and Up-Sets . 401 A.6 Problems . 402 A. 7 Bibliographic Remarks . 402 Bibliography 403 Index 420
any_adam_object	1
any_adam_object_boolean	1
author	Garg, Vijay K.
author_facet	Garg, Vijay K.
author_role	aut
author_sort	Garg, Vijay K.
author_variant	v k g vk vkg
building	Verbundindex
bvnumber	BV023036872
classification_rvk	ST 200
ctrlnum	(OCoLC)633932069 (DE-599)BVBBV023036872
discipline	Informatik
discipline_str_mv	Informatik
edition	transferred to digital print.
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01273nam a2200349zc 4500</leader><controlfield tag="001">BV023036872</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">071205s2006 xxu \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0471036005</subfield><subfield code="9">0-471-03600-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)633932069</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023036872</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-739</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">Garg, Vijay K.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Elements of distributed computing</subfield><subfield code="c">Vijay K. Garg</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">transferred to digital print.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York</subfield><subfield code="b">Wiley-Interscience</subfield><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XX, 423 S.</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">Includes bibliography (p. 403-419) and index</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="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=016240634&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-016240634</subfield></datafield></record></collection>
id	DE-604.BV023036872
illustrated	Not Illustrated
index_date	2024-07-02T19:19:19Z
indexdate	2024-07-09T21:09:32Z
institution	BVB
isbn	0471036005
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-016240634
oclc_num	633932069
open_access_boolean
owner	DE-473 DE-BY-UBG DE-739
owner_facet	DE-473 DE-BY-UBG DE-739
physical	XX, 423 S.
publishDate	2006
publishDateSearch	2006
publishDateSort	2006
publisher	Wiley-Interscience
record_format	marc
spelling	Garg, Vijay K. Verfasser aut Elements of distributed computing Vijay K. Garg transferred to digital print. New York Wiley-Interscience 2006 XX, 423 S. txt rdacontent n rdamedia nc rdacarrier Includes bibliography (p. 403-419) and index Verteiltes System (DE-588)4238872-7 gnd rswk-swf Verteiltes System (DE-588)4238872-7 s DE-604 Digitalisierung UB Passau application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016240634&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle	Garg, Vijay K. Elements of distributed computing Verteiltes System (DE-588)4238872-7 gnd
subject_GND	(DE-588)4238872-7
title	Elements of distributed computing
title_auth	Elements of distributed computing
title_exact_search	Elements of distributed computing
title_exact_search_txtP	Elements of distributed computing
title_full	Elements of distributed computing Vijay K. Garg
title_fullStr	Elements of distributed computing Vijay K. Garg
title_full_unstemmed	Elements of distributed computing Vijay K. Garg
title_short	Elements of distributed computing
title_sort	elements of distributed computing
topic	Verteiltes System (DE-588)4238872-7 gnd
topic_facet	Verteiltes System
url	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016240634&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT gargvijayk elementsofdistributedcomputing

Holdings

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Indexes

MARC

Record in the Search Index

There is no print copy available.

Similar Items