Deadlocks All New April 2006

DEADLOCKS
Lecture Series By : Er. Kanwalvir Singh Dhindsa
Website :: www.dhindsa.info
http://groups.google.com/group/os-2007
E-Mail :: sys.operating@gmail.com
1
O.S. by Er. K.S.Dhindsa © 2007
DEADLOCK DETECTION & RECOVERY
Detection with One Resource of Each Type (1)
 IF graph contains one or more cycles
{any process part of cycle},a deadlock exists
 IF no cycle exists,system is not deadlocked
 Algorithm takes each node,as the root like of a tree
and does DFS on it
 If it ever comes back to a node it has already

encountered, it has found a cycle
 If it exhausts all the arcs from any given node,it
backtracks to the previous node
{then does not contain cycle}
 If this property holds for all nodes, entire graph is cycle
free & hence system not deadlocked
2
DEADLOCK DETECTION & RECOVERY
Detection with One Resource of Each Type (1)
• Process A holds R and wants S

• Process B holds nothing but
wants T
• Process C holds nothing but
wants S
• Process D holds U and wants S
&T
• Process E holds T & wants V
• Process F holds W and wants S D,E and G are deadlocked
• Process G holds V and wants U
L={R,A,S}
L={B,T,E,V,G,U,D,T}
3
Detection with Multiple Resource of Each Type (2)
Data structures needed by deadlock detection algorithm
4
Detection with Multiple Resource of Each Type (2)
An example for the deadlock detection algorithm
5
Deadlock Avoidance
Safe and Unsafe States (1)
A STATE IS said to be safe if it is not deadlocked and there

is some scheduling order in which every process can run
to completion even if all of them suddenly request their
maximum no. of resources immediately
(a) (b) (c) (d) (e)
Demonstration that the state in (a) is safe 6

Safe and Unsafe States (2)
(a) (b) (c) (d)
Demonstration that the state in b is not safe
7
Basic Facts
• If a system is in safe state ⇒ no
deadlocks
• If a system is in unsafe state ⇒

possibility of deadlock
• Avoidance ⇒ ensure that a system will

never enter an unsafe state
8
Safe, Unsafe , Deadlock State
9
Deadlock Avoidance
I. The Dijkstra(1965) Banker's Algorithm for a Single Resource
(a) (b) (c)
• Three resource allocation states

– safe
– safe
– unsafe
10
The Banker's Algorithm for a Single Resource
 Modeled on the way a small-town banker
might deal with a group of customers to whom
he has granted lines of credit
 Checks to see if granting the request leads to
an unsafe state
 If it does,request is denied
 If granting the request leads to a safe state,it is
carried out
 Diagram shows four customers( A,B,C,D) each
of them granted a no. of credit units
 Customers – processes, Units -- tape drives
& Banker – Operating system
11
II. Banker's Algorithm for Multiple Resources
Example of banker's algorithm with multiple resources

12
Deadlock Prevention
Restrain the ways request can be made
• Mutual Exclusion – not required for sharable resources;

must hold for nonsharable resources
• Hold and Wait – must guarantee that whenever a

process requests a resource, it does not hold any other
resources.
– Require process to request and be allocated all its
resources before it begins execution, or allow process
to request resources only when the process has none.
– Low resource utilization; starvation possible.
13
Deadlock Prevention (Cont.)
• No Preemption –
– If a process that is holding some resources requests
another resource that cannot be immediately
allocated to it, then all resources currently being held
are released.
– Preempted resources are added to the list of
resources for which the process is waiting.
– Process will be restarted only when it can regain its
old resources, as well as the new ones that it is
requesting.
• Circular Wait – impose a total ordering of all resource

types, and require that each process requests resources
in an increasing order of enumeration. 14
Recovery from Deadlock
I. PROCESS TERMINATION
• Abort all deadlocked processes
• Abort one process at a time until the deadlock cycle is

eliminated
In which order should we choose to abort?

– Priority of the process
– How long process has computed, and how much longer to
completion
– Resources the process has used
– Resources process needs to complete
– How many processes will need to be terminated
– Is process interactive or batch? 15
Recovery from Deadlock (contd)
II. Resource Preemption
• Selecting a victim – minimize cost

{Which resources & which processes are to be
preempted?}
• Rollback – return to some safe state, restart

process for that state
{Total Rollback also can be done }
• Starvation – same process may always be

picked as victim {process could be picked as
victim only for a finite no. of times}
16
Thrashing
• If a process does not have “enough” pages, the

page-fault rate is very high
• Leading to:
– low CPU utilization
– operating system thinks that it needs to increase
the degree of multiprogramming
– another process added to the system
• Thrashing ≡ a process is busy swapping pages in

and out (If it is spending more time paging than
executing)
17
Thrashing (Cont.)
18
Working-Set Model
• Works on the assumption of locality
∀ ∆ ≡ working-set window ≡ a fixed number of page
references
Example: 10,000 instruction
• WSSi (working set of Process Pi) =
total number of pages referenced in the most recent ∆
(varies in time)
– if ∆ too small will not encompass entire locality
– if ∆ too large will encompass several localities
– if ∆ = ∞ ⇒ will encompass entire program
• D = Σ WSSi ≡ total demand frames
• If D > m (no. of available frames) ⇒ Thrashing

• Policy if D > m, then suspend one of the processes
• Prevents thrashing while keeping degree of
multiprogramming as high as possible
• Optimizes CPU Utilization 19
Working-set model
20
DEADLOCKS
Lecture Series By : Er. Kanwalvir Singh Dhindsa
Website :: www.dhindsa.info
http://groups.google.com/group/os-2007
21

Deadlocks All New April 2006

Загружено:

Сведения о документе

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Deadlocks All New April 2006

Загружено:

Авторское право:

Доступные форматы

DEADLOCKS

Lecture Series By : Er. Kanwalvir Singh Dhindsa

 If it ever comes back to a node it has already

• Process A holds R and wants S

Data structures needed by deadlock detection algorithm

An example for the deadlock detection algorithm

A STATE IS said to be safe if it is not deadlocked and there

(a) (b) (c) (d) (e)

Demonstration that the state in (a) is safe 6

(a) (b) (c) (d)

Demonstration that the state in b is not safe

• If a system is in unsafe state ⇒

• Avoidance ⇒ ensure that a system will

(a) (b) (c)

• Three resource allocation states

Example of banker's algorithm with multiple resources

• Mutual Exclusion – not required for sharable resources;

• Hold and Wait – must guarantee that whenever a

• Circular Wait – impose a total ordering of all resource

• Abort all deadlocked processes

• Abort one process at a time until the deadlock cycle is

In which order should we choose to abort?

• Selecting a victim – minimize cost

• Rollback – return to some safe state, restart

• Starvation – same process may always be

• If a process does not have “enough” pages, the

• Thrashing ≡ a process is busy swapping pages in

• If D > m (no. of available frames) ⇒ Thrashing

Lecture Series By : Er. Kanwalvir Singh Dhindsa

Вам также может понравиться