Semantics for execution of rpcs, Operating System

Q. Presume that a distributed system is susceptible to server failure. What mechanisms would be needed to guarantee the exactly once semantics for execution of RPCs?

Answer: The server must keep track in stable storage (such as a disk log) information regarding what RPC operations were received whether they were successfully performed in addition to the results associated with the operations. When a server crash occurs and a RPC message is received the server can check whether the RPC had been before performed and therefore guarantee exactly once semanctics for the execution of RPCs.

Posted Date: 7/27/2013 2:34:03 AM | Location : United States







Related Discussions:- Semantics for execution of rpcs, Assignment Help, Ask Question on Semantics for execution of rpcs, Get Answer, Expert's Help, Semantics for execution of rpcs Discussions

Write discussion on Semantics for execution of rpcs
Your posts are moderated
Related Questions
Define an assembly language  Assembly language stands for a Low level programming language

What is segmentation? In a segmented memory management scheme a programmer views a program to be collection of program components called as segments. Every segment is a logical

Q. Consider the two-dimensional array A: int A[][] = new int[100][100]; Whereas A [0][0] is at location 200 in a paged memory system with pages of size 200. A little process

Explain the BeginThread Function used in the NetWare example code BeginThread(MyThread Function, stack,size, arg) BeginThread creates a thread and places it on the NetWar

whats the use of using ipc

my Operating System is windows trust but when the windows start say its windows xp. help pleaes


Explain Deadlock Prevention-Resource allocation graph allocation Resource allocation graph algorithm :  Using this algorithm we are able to actually know if there exists in th


A UNIX file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contains 10 direct entries, and one single, double, and triple indirect entry