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. Consider a distributed system with two sites A and B. Consider whether site A can distinguish among the following:
a. B goes down.
b. The link between A and B goes down.
c. B is much overloaded and its response time is 100 times longer than normal.
What inference does your answer have for recovery in distributed systems?
Answer: One technique would be for B to at regular intervals send an I-am-up message to a indicating it is still alive. If A doesn't receive an I-am-up message it can assume either B-or the network link-is down.
Note that an I-am-up message doesn't permit A to distinguish between each type of failure. One technique that permits A better to determine if the network is down is to send an Are-you-up message to B using an exchange route. If it obtains a reply it can determine that indeed the network link is down and that B is up.
If we presume that A knows B is up and is reachable (via the I-am-up mechanism) in addition to that A has some value N that indicates a normal response time A could monitor the response time from B and compare values to N permitting A to determine if B is overloaded or not.
The inferences of both of these techniques are that A could choose another host-say C-in the system if B is either down or unreachable and or overloaded.
How is it different from the unbounded buffer algorithm ? Explain.
Ask question #Minimum 100 difference between bounded and unbounded buffer words accepted#
Q. How Program execute in operating system? Program execution- The operating system fills the contents (or sections) of a file into memory as well as begins its execution. A us
Page fault is a trap to the software gained by the hardware when a process accesses a page that is goes in the virtual address space, but not added in physical memory. In the har
What is dispatch latency? The time taken by the dispatcher to stop one process and begin another running is known as dispatch latency.
Advantages and disadvantages of time-sharing operating system
describe competing process
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
What is meant by file management systems? File Management systems are as well referred to as simply a file system .File system is the system that an OS operating system or prog
Let us consider the pining details of the 68HC11 as shown below. Each pin has a defined function, some easy, some complex. A microprocessor designer should understan
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