4. Synchronization (2).pdf

More documents

Recommendations

Info

JGroups • JGroup’s protocol stack has a number of ordering possibilities – None – org.jgroups.protocols.CAUSAL – org.jgroups.protocols.TOTAL Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
JGroups: Alphabet Example • Stable process group • Send parts of alphabet in sequence – Initiator • Select address of random member in group • Multicasts {”A”, } – Receivers print ”A”, stores ”A” – Receiver with address • Select address of random member in group • Multicasts {”B”, } – And so on... • Which ordering do we want Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved. 0-13-239227-5
Page 1 and 2: DISTRIBUTED SYSTEMS Principles and
Page 3 and 4: JGroups • Java toolkit for reliab
Page 5: Jgroups Programming Basics • Proc
Page 9 and 10: JGroups: Alphabet Example Create ch
Page 11 and 12: Receive a massage Unpack letter and
Page 13 and 14: Plan • Clock synchronization in d
Page 15 and 16: Mutual Exclusion: A Centralized Alg
Page 17 and 18: Mutual Exclusion: A Decentralized A
Page 19 and 20: Mutual Exclusion: A Distributed Alg
Page 21 and 22: Mutual Exclusion: A Token Ring Algo
Page 23 and 24: A Comparison of the Four Algorithms
Page 25 and 26: Population Protocol • All agents
Page 27 and 28: The Bully Algorithm • Assume that
Page 29 and 30: The Bully Algorithm (2) • Figure
Page 31 and 32: Elections in Wireless Environments
Page 37 and 38: Elections in Large-Scale Systems (2

4. Synchronization (2).pdf

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?