Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
Explain Wait for Graph a. Use a resource allocation graph to derive a wait-for graph. b. Wait-for graph acquired by making an edge from p 1 to p 2 iff p 1 is waiting for
Q. What are the three main activities of an operating system in regard to secondary-storage management? Answer: 1) Free-space management 2) Storage allocation 3) Disk
Some CPUs provide for more than two modes of operation. What are two possible uses of these multiple modes?
What is busy waiting? When strict alteration is done there may take place situation like two processes setting their flag as true. Therefore both of the processes have equal pr
Describe paging technique used in UNIX systems. When a process begin in UNIX, not every its memory pages are read in from the disk at once. In its place, the kernel loads into
explain about design issues of network operating system
The hardware to support demand paging is as follows Page table: This table has the skill to mark an entry invalid though a valid-invalid bit or particular value of protectio
You have a system with two primary workloads. One performs sequential access to a set of large files, the other performs small, independent, random reads to a separate set of large
EXPLAIN EMBEDDED SYSTEM
Explain with an example the need of Shift Alteration in critical section problem? Consider processes P i and P j and consider the algorithm for P i and P j .
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd