Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / guest
It is a technique proposed by Lamport, used to order events
in a distributed system without the use of clocks. This
scheme is intended to order events consisting of the
transmission of messages.
Each system 'i' in the network maintains a counter Ci.
Every time a system transmits a message, it increments its
counter by 1 and attaches the time-stamp Ti to the message.
When a message is received, the receiving system 'j' sets
its counter Cj to 1 more than the maximum of its current
value and the incoming time-stamp Ti.
At each site, the ordering of messages is determined by
the following rules: For messages x from site i and y from
site j, x precedes y if one of the following conditions
holds....(a) if Ti<Tj or (b) if Ti=Tj and i.
| Is This Answer Correct ? | 12 Yes | 7 No |
Post New Answer View All Answers
Command Kill any user’s all processes.
What is normal operating system?
Is 64gb ram enough for gaming?
How do I turn off programs running in the background?
How much ram can you have on a 64 bit system?
Why do we use semaphore?
What are the three conditions that must be present for deadlock to be possible?
Differentiate between swapping and paging.
List the issues related to the handheld system.
What is asymmetric clustering?
What is gang scheduling in operating system (os)?
What factors determine whether a detection-algorithm must be utilized in a deadlock avoidance system?
What is starvation in operating system?
How does swapping result in better memory management?
Difference between short term, long term and medium term scheduler.
