Scribd
Upload
21 views2 pages

Unit III 2 Marks With Answer

distributed system 2 mark Unit 3 full docment

Uploaded by

karuna karan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
21 views2 pages

Unit III 2 Marks With Answer

distributed system 2 mark Unit 3 full docment

Uploaded by

karuna karan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

1|Page

Department of Computer Science and Engineering

CS8603 Distributed Systems

UNIT-3

1. What are the three basic approaches for implementing distributed mutual exclusion?

1. Token-based approach.
2. Non-token-based approach.
3. Quorum-based approach.

2. Write the conditions for maekawa’s algorithm.

4. List the three types of messages for deadlock handling.


three strategies:deadlock prevention, deadlock avoidance, and deadlock detection

5. What is deadlock?
A deadlock can be defined as a condition where a set of processes request resources that are heldby other
processes in the set.

6. List the two design issues for suzuki–kasami’s.


How to distinguishing an outdated REQUEST message from a current REQUEST message
How to determine which site has an outstanding request for the CS

7. How ricart–agrawala algorithm achieves mutual exclusion?


If a process pi that is waiting to execute the critical section receives a REQUEST message from process pj , then if
the priority of pj’s request is lower, pi defers the REPLY to pj and sends a REPLY message to
pj only after executing the CS for its pending request. Otherwise, pi sends a REPLY message to pj immediately,
provided it is currently not executing the CS.

8. How maekawa’s algorithm achieves mutual exclusion?


Maekawa’s algorithm was the first quorum-based mutual exclusion algorithm. at least one common site between
the request sets of any two sites (condition M1), every pair of sites has a common site which mediates conflicts
between the pair. A site can have only one outstanding REPLY message at any time; that is, it grants permission to
an incoming request if it has not granted permission to some other site.
9. Express in diagram the wait for graph (WFG).

Prepared by Elavarasi D,
AP/CSE, MZCET
2|Page

10. What are the states in a process?


Ready state, Running State and Terminated State

11. What are the three strategies for handling deadlocks.


Deadlock prevention, deadlock avoidance, and deadlock detection

12. What is broadcast algorithm?


A message broadcast is the sending of a message to all members in the distributed system. The notion
of a system can be confined only to those sites/processes participating in the joint application. Broadcasting, there
is multicasting wherein a message is sent to a certain subset, identified as a group, of the processes in the system.

13. Give the conditions to satisfy deadlock detection algorithm.


A deadlock detection algorithm must satisfy the following two conditions:
Progress: The algorithm must detect all existing deadlocks in a finite time.
Safety: The algorithm should not report deadlocks hat do not exist.

14. What is deadlock resolution?


Deadlock resolution involves breaking existing wait-for dependencies between the processes to resolve the
deadlock.

15. What are the facts of global state detection-based deadlock detection?
Global state detection-based deadlock detection algorithms exploit the following facts:
(i) a consistent snapshot of a distributed system can be obtained without freezing the underlying
computation, and
(ii) (ii) a consistent snapshot may not represent the system state at any moment in time

16. Define the features of Mitchell and Merritt’s algorithm.


The algorithm has many good features, such as:
1. Only one process in a cycle detects the deadlock. This simplifies the deadlock resolution – this process can abort
itself to resolve the deadlock. This algorithm can be improvised by including priorities, and the lowest priority
process in a cycle detects deadlock and aborts.
2. In this algorithm, a process that is detected in deadlock is aborted spontaneously, even though under this
assumption phantom deadlocks cannot be excluded.

17. How maekawa’s algorithm handles deadlocks?


A site suspects a deadlock whenever a higher priority request arrives and waits at a site because the site has sent a
REPLY message to a lower priority request.
Deadlock handling requires the following three types of messages: FAILED, INQUIRE, YIELD

18. What is the advantage of edge-chasing algorithms?


The main advantage of edge-chasing algorithms is that probes are fixed size messages that are normally very short.

Prepared by Elavarasi D,
AP/CSE, MZCET

You might also like