What inference does recovery in distributed systems, Operating System

Assignment Help:

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.


Related Discussions:- What inference does recovery in distributed systems

Mention the various features that characteristics deadlock, Mention the var...

Mention the various features that characteristics the deadlock condition .  The four circumstances that give rise to deadlock condition are: 1) Mutual exclusion : As a minim

What are the disadvantages of linked allocation, What are the disadvantages...

What are the disadvantages of linked allocation? The drawbacks are a. Used only for sequential access of files. b. Direct access is not supported c. Memory space neede

Explain resource allocation graph, RESOURCE ALLOCATION GRAPH When a pro...

RESOURCE ALLOCATION GRAPH When a process Pi wishes an instance of resource type Rj, a request edge is inserted in the resource allocation graph. When this request is able to be

OS is a resource allocator and control program, why we say OS is a resource...

why we say OS is a resource allocator and control program

Direct communicatio., Consider a scenario of post mailbox, there are two pr...

Consider a scenario of post mailbox, there are two processes named sender S and receiver R. Both processes can communicate with each other by name along with message. You need to I

Comparison of disk scheduling algorithms, COMPARISON OF DISK SCHEDULING ALG...

COMPARISON OF DISK SCHEDULING ALGORITHMS Name      Description                  Remarks      (Selection according to requestor)   RSS        Random scheduling     fo

Most-recently used algorithm, Evicting the most-recently used (MRU) page do...

Evicting the most-recently used (MRU) page does very well on LRU's worst case. In general, however, MRU is a bad idea, since many programs exhibit temporal locality in their memory

What is a thread, What is a thread? A thread or else called a lightweig...

What is a thread? A thread or else called a lightweight process (LWP) is a basic unit of CPU utilization, it comprises of a thread id, a program counter, a register set and a s

What are the various available scheme in ipc, Several schemes available are...

Several schemes available are as follows: Pipes : One-way communication process through which different process can interact. The problem is that the two processes could have

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd