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.
With software algorithms for mutual exclusion, such as Dekker's algorithm, Peterson's algorithm, or Lamport's bakery algorithm, note that optimizing compilers and out-of-order exec
Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4
Here are the conditions necessary for a deadlock to occur; note that all of them are necessary, and none is suf?cient: 1. ?nite resources: the resources are held in a mutually-e
Question: In a deadlock, processes never finish executing and system resources are tied up, preventing other jobs from starting. Deadlocks can be characterised by a set of cond
How is process management done in multiprocessing systems ? There are two accost for the process management in multiprocessor systems. Master-slave configuration Sy
Process termination A process terminates when it finishes implementing its final statement and asks the operating system to delete it by using the exit system call. At that tim
Why is rotational latency usually not considered in disk scheduling? How would you modify SSTF, SCAN, and C-SCAN to include latency optimization? Most disks do not export their
Crumbles Bakery needs to decide how many and what types of cupcakes to make today. Currently, they make two types of cupcakes: chocolate cupcakes and carrot cake cupcakes. Chocolat
Enhanced second-chance algorithm. When we increase the second-chance algorithm by considering both the reference bit and the modify bit as an order pair. We have the following
how it is work.
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