Write a short note on time-stamping
Write a short note on time-stamping?
Expert
It is a method proposed by Lamport, employed to order events in a distributed system without the employ of clocks. This scheme is intended to order events comprising of the transmission of messages. Each system “I” in the network maintains a counter Ci. Each and every time a system transmits a message; it increases its counter by 1 and attaches the time-stamp Ti to the message. Whenever a message is received, the receiving system 'j' sets up its counter Cj to 1 more than the maximum of its present value and the incoming time-stamp Ti. At each and every site, the ordering of messages is examined 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....(i) if Ti<Tj or (ii) if Ti=Tj and i<j.
Name various stages a processes go through before it is executed finally.
Write down the various states of the process that are available?
List some of the algorithms that are available for the Deadlock avoidance.
Define the term buffering.
Write down the various kinds of Kernel?
Write down the differentiation between the Custom and Upgrade installation options?
What do you mean by server? Describe with some examples.
What do you understand by the Hard Real time systems and soft real time system?
How you cope up from under pressure?
Describe in detail the Translation Look aside Buffer (TLB)?
18,76,764
1928382 Asked
3,689
Active Tutors
1440033
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!