Explain the sequence of messages in rpc mechanism, Operating System

Q. Once more considering the RPC mechanism consider the exactly once semantic. Does the algorithm for implementing this semantic implement correctly even if the ACK message back to the client is lost due to a network problem? Explain the sequence of messages and whether exactly once is still preserved.

Answer: The exactly once semantics make sure that a more procedure will be executed exactly once and only once. The universal algorithm for ensuring this combines an acknowledgment (ACK) scheme combined with timestamps (or some other incremental counter that allows the server to distinguish between duplicate messages).

The universal strategy is for the client to send the RPC to the server along with a timestamp. The client will as well start a timeout clock. The client will after that wait for one of two occurrences: (1) it will receive an ACK as of the server indicating that the remote procedure was performed or (2) it will time out If the client times out it presume the server was unable to perform the remote procedure so the client invokes the RPC a second time sending a later timestamp. The client mayn't receive the ACK for one of two reasons (1) the original RPC was never received by the server or (2) the RPC was correctly received-and performed-by the server however the ACK was lost. In situation (1) the use of ACKs permits the server ultimately to receive and perform the RPC. In situation (2) the server will obtain a duplicate RPC and it will use the timestamp to identify it as a duplicate so as not to perform the RPC a second time. It is significant to note that the server must send a second ACK back to the client to inform the client the RPC has been performed.

Posted Date: 7/27/2013 2:32:47 AM | Location : United States







Related Discussions:- Explain the sequence of messages in rpc mechanism, Assignment Help, Ask Question on Explain the sequence of messages in rpc mechanism, Get Answer, Expert's Help, Explain the sequence of messages in rpc mechanism Discussions

Write discussion on Explain the sequence of messages in rpc mechanism
Your posts are moderated
Related Questions
what is the use of valid invalid bits in paging

Q. In a ring-protection system the level 0 has the greatest access to objects and level n (greater than zero) has fewer access rights. The access rights of a program at a partic

What are the features of Operation Research approach?

#include #include #include #include #include int main(void) { int pchan[2], pid, rval, cvar; char buf[20]; if (pipe(pchan) == -1){

Q. Can a system detect that some of its processes are starving? If you answer "yes," explain how it can. If you answer "no," explain how the system can deal with the starvation pro

What is scheduler? A process migrates among the various scheduling queues throughout its life time. The OS must choose processes from these queues in some fashion. This selecti

Performance of demand paging Demand paging can have an important effect on the performance of a computer system. As long as there are no page faults, the effective access time

Define Server Processing with Queues The efficient server processing of client request is essential for optimized client- server applications. This process is greatly enhanced

People arrive at a barber shop at the rate of one every 4.5 minutes. If the shop is full (it can hold five people altogether), 30% of the potential customers leave and come back i

Invalid page fault :If a page fault happens for a reference to an address that's not part of the virtual address space, so that there could not be a page in memory corresponding