Explain the sequence of messages in rpc mechanism, Operating System

Assignment Help:

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.


Related Discussions:- Explain the sequence of messages in rpc mechanism

Explain message passing among systems, Q. Explain Message passing among sys...

Q. Explain Message passing among systems? Communications- Message passing among systems requires messages to be turned into packets of information and sent to the network contr

Explain terminal symbols, Explain Terminal Symbols Terminal symbols are...

Explain Terminal Symbols Terminal symbols are literal strings that are forming the input of a formal grammar and cannot be broken down into smaller units with no losing their l

Explain banker''s algorithm, Banker's Algorithm In this analogy ...

Banker's Algorithm In this analogy Customers ≡ processes Units ≡ resources, say, tape drive Ba

Use of the computing hardware, Q. We have stressed the require for an oper...

Q. We have stressed the require for an operating system to make efficient use of the computing hardware. When is it suitable for the operating system to forsake this principle and

Explain busy waiting semaphores, Explain Busy Waiting Semaphores Weak, ...

Explain Busy Waiting Semaphores Weak, Busy-wait Semaphores a) The simplest way to implement semaphores. b) Useful while critical sections last for a short time, or we com

Major advantage of the layered approach to system design, Q. What is the ma...

Q. What is the major advantage of the layered approach to system design? What are the de-merits of using the layered approach? Answer: As in all cases of modular design as well

Major page fault, Major page fault: If the page is not loaded in memory a...

Major page fault: If the page is not loaded in memory at the time the fault is stated, then it is named major or hard page fault. The handler in the machine requires to search a

#title:cs604, Consider a scenario of post mailbox, there are two processes ...

Consider a scenario of post mailbox, there are two processes named sender S and receiver R. Both processes can communicate with each other by name along with message. You need to I

Implementation of locks, How could we implement locks? No matter how we cho...

How could we implement locks? No matter how we choose to implement them, we must have some hardware support. One possibility for implementing locks on a uniprocessor machine is is

Conversion of binary to hex, Take the binary number and divide it into grou...

Take the binary number and divide it into groups of 4 bits starting from the right hand side , if no group of 4 exists fill out leading 0's, then convert each group of 4 to a hex n

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd