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.
Write a note on the usage of semaphores. Semaphore is a synchronization tool and it is a variable having integer values. It is accessed only by two standard atomic operations w
Question: (a) Describe blocking and non-blocking types of inter-process communication. What is easier to implement and why? Discuss their relative advantages and disadvantage
What is independent process? A process is independent it cannot influence or be affected by the other processes implementing in the system. Any process does not share data with
Question: Introduction to Operating Systems a) Define the term ‘Operating System' and identify main functions of an operating system. b) What are the characteristics of a go
Explain the Novell NetWare NetWare doesn't really have the concept of processes in the architecture, as the most closely associated element in the NetWare environment to
What is internal fragmentation? Consider holes of 20k assume the process requests 18 bites. If we allocate accurately the request block, we are left with a hole of 2k. The over
What are the functions of virtual file system (VFS)? a. It separates file-system-generic operations from their execution defining a clean VFS interface. It permits transparent
Since each thread has its own processing space therefore communication between threads will need to be done through a common global variable. Since multiple threads can access the
Define the “Throughput” of a system Throughput is Number of programs processed by it per unit time
FIFO page replacement This is the easiest page replacement algorithm. At this juncture the 1 st page entering is the 1 st to leave that is the oldest page leaves. To execute
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: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd