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.
What is an acyclic graph? A tree that has been corrupted by links to other branches, but does not have any cyclic paths in it.
Deadlock Prevention Prevention is the name given to method that guarantee that deadlocks can never happen for the reason that the way the system is structured. Since 4 conditio
Invalid page fault :If a page fault happens for a reference to an address that's not part of the virtual address space, so that there could not be a page in memory corresponding
Question: (a) Write down short notes on the different versions of Windows server 2003 mentioned below: 1. Windows Server 2003, Web Edition 2. Windows Server 2003, Stand
Explain segmentation hardware? We define an completion to map two-dimensional user-defined addresses into one-dimensional physical addresses. This mapping is affected by means
Many-to-One Model (Green Threads) Implementations of the many-to-one model a lot of user threads to one kernel thread permit the application to create any number of threads tha
What is banker's algorithm? Banker's algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple examples of each resource type
Write on short note DMA. Direct M emory Access (DMA) is a technique for transferring data from main to a device without passing it through the CPU. Computers that have
What is preemptive and nonpreemptive scheduling? Under nonpreemptive scheduling once the CPU has been allocated to a process, the process keeps the CPU unless it releases the C
Q. Why High level languages need Compiler? High level languages - illustrations are COBOL, FORTRAN, PL/I andALGOL - are processed by interpreters andcompilers. A compilers is a
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