Q1: A client's clock reads 3:20:00. The server's clock reads 3:10:00 when they synchronize using the Berkeley algorithm. Assume message delays are negligible. What is the time at the client after synchronization ? Q2: A coordinator plays an important role in different synchronization algorithms. Explain with a simple sketch (and mention the name) an algorithm for coordinator election.
Added by Holly W.
Close
Step 1
The algorithm assumes that each node in the system has its own clock. One of the nodes is elected as the master (or coordinator), and the rest are slaves. The master asks all the slaves for their clock times and then calculates the average time, ignoring any times Show more…
Show all steps
Your feedback will help us improve your experience
Samuel Goyette and 99 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Suppose in Exercise 21 you arrive to find two others in the system, one being served by server 1 and one by server 2 . What is the expected time you spend in the system? Recall that if server 1 finishes before server 2, then server 1's customer will remain with him (thus blocking your entrance). until server 2 becomes free.
Stanley E.
Suppose in Exercise 21 you arrive to find two others in the system, one being served by server 1 and one by server $2 .$ What is the expected time you spend in the system? Recall that if server 1 finishes before server 2, then server 1 's customer will remain with him (thus blocking your entrance) until server 2 becomes free.
Rashmi S.
Suppose there are three processes A, B, and C. All clocks run at the same rate, but initially A's clock reads 10, B's clock reads 0, and C's clock reads 5. At time 10 by A's clock, A sends a message to B. This message takes 4 units of time to reach B. B then waits one unit of time and then sends a message onto C, which takes 2 units of time to reach C. a. Assuming that the system implements Lamport's timestamps, draw a picture illustrating the timestamps for the messages and explain how the timestamps are obtained. b. What does it mean for two events to be concurrent, and what is the relation of the Lamport timestamps of the two events.
Akash M.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD