Suppose there are three processes A,B and C. All clock runs 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. Assuming that the system implements Lamport’s timestamps draw a diagram illustrating the timestamps.

Suppose there are three processes A,B and C. All clock runs 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. Assuming that the system implements Lamport’s timestamps draw a diagram illustrating the timestamps.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter6: System Integration And Performance

Section: Chapter Questions

Problem 12RQ

See similar textbooks

Similar questions

a single process, with execution time of BT time units, is detected by the system that uses Round Robin algorithm with time quantum of QT time units. Every time the time quantum elapses; a contect switch is always performed with CS time units. Assume that the process come at time equal to zero(0) If BT is 25, QT is 10 and CS is 2, what is the Cpu utilization of the system? If BT is 20, QT is 6 and CS is 1 what is the CPU utilization of the system? What is the CPU utilization if BT is equal QT and QT is equal to CS? What is the system's throughput if BT is less than QT? What is the system's turnaround time (TAT) if BT is less than QT?
(a) Explain Lamport's logical clocks, using an example of three processes with different counting rates. (b) Two machines are using the Network Time Protocol to synchronise their clocks. Briefly describe this algorithm. Demonstrate that A's clock is slow compared to B, by computing the relative offset between the two, given that: (i) A sent a request at T1 = 1 (ii) B received the request at T2 = 3 (iii) B sent a reply at T3 = 5 (iv) A received the reply at T4 = 6 (c) What is “Drift Rate” in relation to synchronization?
A system with 6 computer process, P1, P2, P3, P4, P5, P6. their current time stamp 7, 5, 8, 9, 5, 6. All have a common variable X. P2 , P3 and P5 wanted to access X. what wait time will require P2, P3 and P5 use X, assuming each will access X for 1s, and each message passing will require 1s and process time also 1s. use Ricart-Agarwal algorithm suppose P7 failed at 7s, What will be the total time to get the new leader in this ring
Suppose there are four processes (P1 - P4) with respective arrival times of 0, 10, 30, and 40, and burst times of 30, 20, 50, and 20 ms. These processes are scheduled from a ready queue on first come first served. The average waiting time is?
Consider a computer system with three users: Alice, Bob, and Cindy. Alice owns file X, and Bob and Cindy can read it. Bob owns file Y, and Cindy can read and write the file Y, but Alice can only read it. Cindy owns file Z, but neither Alice nor Bob can read or write it. If a user owns a file, he/she can also execute the file. Create the ACM (access control matrix) of the system Show the ACL and CL of the ACM Now Cindy allows Alice to read Z, Alice removes Bob's ability to read X, and Bob removes all the rights of Alice and Cindy to Y. Show the ACM after these changes.
In a multiprogramming and time-sharing environment, several users share the system simultaneously. This situation can result in various security problems. a. What are two such problems? b. Can we ensure the same degree of security in a time-shared machine as in a dedicated machine? Explain your answer.
Let consider a process iin which one state is Blocked and waiting for some input/output service. And when the service is completed then it goes to the ________.
The token bucket algorithm is a popular method for traffic shaping. A computer uses a token bucket with acapacity of 400 megabytes (MB) and a rate of 10 MB/sec. The computer continuously generates20 MB/sec for transmission from time 0. Assume the bucket’s water level is 200 MB at time 0.1a. How long will it take to send 1000 MB? Show the steps.1b. Draw a figure showing how the bucket’s water level evolves
Consider a distributed system where every node has its physical clock and all physical clocks are perfectly synchronized. Develop an algorithm to record global state assuming the communication network is reliable.
draw the diagram to establish a network for a computer labrotarory with 5 computers having internet facility using the following devices 1)switch2)router
Consider a program that performs the following steps repeatedly: Use the CPU for 4 milliseconds. By issuing an I/O, use the disk for 14 milliseconds. Use the CPU for 10 milliseconds. By issuing an I/O, use network for 18 milliseconds. Assume that each step depends on data obtained from the previous step (e.g., step 3 cannot start before step 2 is completed. Also assume that each resource (CPU or disk or network) can be used by one process at a time. Answer the following questions: (a) Draw 3 time-line diagrams (horizontal axis is the time line; one line for each resource. That is, 3 parallel rows in the resulted figure.) that illustrate the utilizations of the CPU, disk, and network over the execution of two iterations of the program above by a single process. (b) What are the average utilizations of the CPU, disk and network over these two iterations? (Please note that the “total time” should be the same across all resources, from the entire system starts until all work on any…
On a computer system with one processor (CPU), and N (N> 1) processes present in the system, what is the maximum number of processes that can be in the Running, and in the Blocked states at any given time? Assume 5-state model for process states.