A. Udaya Shankar. Distributed Programming. and Practice. Theory. 4^1 Springer

Size: px

Start display at page:

Download "A. Udaya Shankar. Distributed Programming. and Practice. Theory. 4^1 Springer"

Lesley Adams
5 years ago
Views:

1 A. Udaya Shankar Distributed Programming Theory and Practice 4^1 Springer

2 Contents 1 Introduction Objective Programs and Services Correctness Properties and Assertional Reasoning Services and Systems Framework (SESF) Programs in SESF Input Assumptions Platforms Atomicity Assumptions About the Platform and Effective Atomicity Progress Assumptions About the Platform Aggregate Systems Composite Systems Producer-Consumer-Lock Example Service Programs Distributed Services Implements Definition Using Services to Design Programs Background to SESF Organization of This Book Introducing SESF by Examples (Chaps. 2-5) Theory of SESF (Chaps. 6-8) More Applications of SESF (Chap. 9 Onwards) 32 References 34 2 Simple Lock Introduction Conventions Lock Program Fault-Freedom and Effective Atomicity Lock Service Program 45 XI

3 xii Contents 2.4 Implements Conditions Proving the Implements Conditions Proving the Safety Condition: B Proving the Progress Condition: S -B Assertional Proof of Inv C\ Assertional Proof of Do Producer and Consumer Using Lock Service Concluding Remarks 59 Exercises 60 References 61 3 Bounded Buffer Introduction Conventions Bounded-Buffer Service Bounded-Buffer Service Inverse Awaits Bounded-Buffer Implementation Using Awaits Locks and Condition Variables Bounded-Buffer Implementation Using Locks and Condition Variables Semaphores Bounded-Buffer Implementation Using Semaphores Increasing Parallelism Technique Technique Bounded-Buffer Service with Cancelable Put and Get Concluding Remarks 82 Exercises 85 References 87 4 Message-Passing Services Introduction Conventions Connection-less Fifo Channels Weaker Progress Assumption Termination and RX Cancellation Fifo Channel Inverse Connection-less Lossy Channels Connection-less LRD Channels Connection-oriented Fifo Channel Multiplexing Ports onto Channels Concluding Remarks Conventions 106 References 109

4 Contents xiii 5 Fifo Channels from Unreliable Channels Ill 5.1 Introduction Ill Conventions Distributed Sliding Window Program: Algorithm Level Source Sink Effective Atomicity of SwpDist Analysis of the Sliding Window Algorithm Correct Interpretation Conditions Achieving Correct Interpretation over Lossy Channel Achieving Correct Interpretation over LRD Channel Achieving Progress Distributed Sliding Window Program Source and Sink Programs with Awaits Source and Sink Programs with Locks and Condition Variables Increasing Parallelism Data Transfer Protocol Proving That DtpDist Implements FifoChannel Graceful-Closing Data Transfer Protocol Abortable Data Transfer Protocol Concluding Remarks 134 Exercises 135 References Programs, Semantics and Effective Atomicity Introduction Programs Inputs and Outputs Input Assumptions Service Programs Input Functions Output Functions Atomicity and Progress Assumptions Usability and Fault-Freedom State Transition Semantics of Systems States Transitions Evolutions Predicates and their Evaluation Assertions and Their Evaluation Splitting and Stitching of Evolutions Auxiliary Variables 156

5 xiv Contents 6.9 Effective Atomicity Defining Effective Atomicity Commuting Statements Some Simple Sufficient Conditions Proof Rules Hoare-Triples Proof Rules for Safety Assertions Proof Rules for Progress Assertions Concluding Remarks 165 References Implements and Compositionality Introduction Conventions Implements Compositionality Program Version of Implements for Services without Internal Parameters Program Version of Implements for Services with Internal Parameters Proof of Theorem Proof of Safety Parts of Theorem Proof of Progress Parts oftheorem Proof of Theorem Proof of Theorems 7.3 and Concluding Remarks 187 Exercises 188 References SESF for Time-Constrained Programs Introduction Time-Constrained Programs Modeling Time Constraints Modeling Timing Assumptions Time-Constrained Service Programs Implements and Compositionality Program Version of Implements Timing Assumptions for Implementation Programs Transforming Timing Constructs into Blocking Conditions Time-Constrained Implementation Program Concluding Remarks 203 Exercises 203 References Lock Using Peterson's Algorithm Introduction 207

6 Contents xv 9.2 Lock Program and Implements Conditions Proving the Implements Conditions Proving the Safety Condition: K Proving the Progress Condition: Y2-Y Concluding Remarks 212 Exercises 212 References Lock Using the Bakery Algorithm Introduction Simplified Bakery Lock Program and Implements Conditions Proving the Implements Conditions for Simplified Bakery Proving the Safety Condition: Y\ Proving the Progress Condition: Y2-Y Original Bakery Lock Program and Implements Conditions Proving the Implements Condition for Original Bakery Proving the Safety Condition: Y] Proving the Progress Condition: Y2-Y Concluding Remarks 222 Exercises 224 References Distributed Lock Service Introduction Service Program Service Inverse Concluding Remarks 227 Exercises 229 References Distributed Lock Using Timestamps Introduction Request Scheduling Problem and Solution Using Timestamps Distributed Lock Program: Algorithm Level Analysis Distributed Lock Program Proving the Implements Conditions Using Cyclic Timestamps Analysis Concluding Remarks 245 Exercises 246 References Channel with Termination Detection Service Introduction Service Program Concluding Remarks 250

7 xvj Contents Exercises 253 References Termination Detection for Diffusing Computations Introduction Conventions Distributed Program: Algorithm Level Analysis Distributed Program Proving the Implements Conditions Proof of C,-C Proof of C3-C Concluding Remarks 266 Exercises 266 References Object-Transfer Service Introduction Service Program Concluding Remarks 273 Exercises 273 References Object Transfer Using Path Reversal Introduction Conventions Distributed Path-Reversal Program Serial Evolutions with at Most One Hungry System at Any Time Serial Evolutions with Multiple Hungry Systems at a Time Non-serial Evolutions Algorithm Analysis: Safety Properties Digraph LR Digraph Pr Algorithm Analysis: Monotonic Progress Metric Algorithm Analysis: Serializability Distributed Program Implementing Object-Transfer Service Proving the Implements Conditions Assertions from Path Reversal Analysis Assertions Concerning objbuff and reqbuff Proof of Inv F,-F Proof of E3-E Concluding Remarks 296 Exercises 297 References 298

8 Contents xv" 17 Distributed Shared Memory Service Introduction Service Program Concluding Remarks 300 Exercises 302 References A Single-Copy Distributed Shared Memory Introduction Distributed Program Proving the Implements Conditions Proving Safety: A i Proving Progress: A2-A Concluding Remarks 311 Exercises 312 References A Multi-copy Distributed Shared Memory Introduction Distributed Program Concluding Remarks 316 Exercises 316 References Reliable Transport Service Introduction Service Overview Function j.connect(k) Function j.accepto Functions j.tx(k.msg) and j.rx(k) Function j.close(k) Service Program Concluding Remarks 328 Exercises 329 References Reliable Transport Protocol Introduction Graceful-Closing dtp Program Protocol Overview Handling Message Losses Handling Old Messages Overlapping Handshakes Buffering Incoming CCR Messages in Server Mode Program Tp with Unbounded Incarnation Numbers Establishing the Implements Condition Assertions to Be Proved 353

9 xviii Contents Proof of B1-B5 and C1-C Proof of fl6-b8 and C6-C Using Cyclic Incarnation Numbers Program Tp with Modulo-N Endpoint Numbers Conclusion 361 Exercises 362 References 362 A Conventions 371 A.l Predicates and Assertions 371 A.2 Referencing System Quantities 372 A.3 Types 372 A.4 Sids 372 A.5 Tids 373 A.6 Sets 373 A.7 Bags 374 A.8 Sequences 374 A.9 Maps 376 A. 10 Channels 376 A. 11 Graphs 377 A. 12 Miscellaneous 378 Index 379

Concurrent Programming: Algorithms, Principles, and Foundations

Concurrent Programming: Algorithms, Principles, and Foundations Algorithms, Principles, and Foundations Bearbeitet von Michel Raynal 1. Auflage 2012. Buch. xxxii, 516 S. Hardcover ISBN 978 3 642 32026