chapter 06 os concurrency deadlock and starvation

7/31/2019 Chapter 06 OS Concurrency Deadlock and Starvation

1/52

Chapter 6

Concurrency: Deadlock andStarvation

Operating Systems:Internals and Design Principles, 6/E

William Stallings

Patricia Roy

Manatee Community College, Venice, FL

2008, Prentice Hall


2/52

Deadlock

Permanent blocking of a set of processes

that either compete for system resources

or communicate with each other

No efficient solution

Involve conflicting needs for resources by

two or more processes


3/52

Deadlock


4/52

Deadlock


5/52

Deadlock


6/52

Reusable Resources

Used by only one process at a time and

not depleted by that use

Processes obtain resources that they later

release for reuse by other processes


7/52

Reusable Resources

Processors, I/O channels, main and

secondary memory, devices, and data

structures such as files, databases, and

semaphores

Deadlock occurs if each process holds

one resource and requests the other


8/52

Reusable Resources


9/52

Reusable Resources

Space is available for allocation of

200Kbytes, and the following sequence of

events occur

Deadlock occurs if both processes

progress to their second request

P1

. . .

. . .Request 80 Kbytes;

Request 60 Kbytes;

P2

. . .

. . .Request 70 Kbytes;

Request 80 Kbytes;


10/52

Consumable Resources

Created (produced) and destroyed

(consumed)

Interrupts, signals, messages, and

information in I/O buffers

Deadlock may occur if a Receive message

is blocking

May take a rare combination of events to

cause deadlock


11/52

Example of Deadlock

Deadlock occurs if receives blocking

P1

. . .

. . .Receive(P2);

Send(P2, M1);

P2

. . .

. . .Receive(P1);

Send(P1, M2);


12/52

Resource Allocation Graphs

Directed graph that depicts a state of the

system of resources and processes


13/52


14/52

Conditions for Deadlock

No preemption

No resource can be forcibly removed form a

process holding it

Circular wait

A closed chain of processes exists, such that

each process holds at least one resource

needed by the next process in the chain


15/52



16/52



17/52

Possibility of Deadlock

Mutual Exclusion

No preemption

Hold and wait


18/52

Existence of Deadlock

Mutual Exclusion

No preemption

Hold and wait Circular wait


19/52

Deadlock Prevention

Mutual Exclusion

Must be supported by the OS

Hold and Wait

Require a process request all of its required

resources at one time


20/52

Deadlock Prevention

No Preemption

Process must release resource and request

again

OS may preempt a process to require it

releases its resources

Circular Wait

Define a linear ordering of resource types


21/52

Deadlock Avoidance

A decision is made dynamically whether

the current resource allocation request

will, if granted, potentially lead to a

deadlock

Requires knowledge of future process

requests


22/52

Two Approaches to

Deadlock Avoidance Do not start a process if its demands might

lead to deadlock

Do not grant an incremental resource

request to a process if this allocation might

lead to deadlock


23/52

Resource Allocation Denial

Referred to as the bankers algorithm

State of the system is the current

allocation of resources to process

Safe state is where there is at least one

sequence that does not result in deadlock

Unsafe state is a state that is not safe


24/52

Determination of a Safe State


25/52



26/52



27/52



28/52

Determination of an Unsafe

State


29/52

Deadlock Avoidance Logic


30/52

Deadlock Avoidance Logic


31/52

Deadlock Avoidance

Maximum resource requirement must be

stated in advance

Processes under consideration must be

independent; no synchronization

requirements

There must be a fixed number of

resources to allocate

No process may exit while holding

resources


32/52

Deadlock Detection


33/52

Strategies Once Deadlock

Detected Abort all deadlocked processes

Back up each deadlocked process to

some previously defined checkpoint, and

restart all process

Original deadlock may occur


34/52

Strategies Once Deadlock

Detected Successively abort deadlocked processes

until deadlock no longer exists

Successively preempt resources until

deadlock no longer exists


35/52

Advantages and Disadvantages


36/52

Dining Philosophers Problem


37/52



38/52



39/52



40/52



41/52

UNIX Concurrency Mechanisms

Pipes

Messages

Shared memory Semaphores

Signals


42/52

UNIX Signals

Li K l C


43/52

Linux Kernel Concurrency

Mechanism Includes all the mechanisms found in

UNIX

Atomic operations execute without

interruption and without interference


44/52

Linux Atomic Operations


45/52

Linux Atomic Operations


46/52

Linux Spinlocks


47/52

Linux Semaphores

Li M B i


48/52

Linux Memory Barrier

Operations

S l i Th d S h i ti


49/52

Solaris Thread Synchronization

Primitives Mutual exclusion (mutex) locks

Semaphores

Multiple readers, single writer

(readers/writer) locks

Condition variables

S l i S h i ti D t


50/52

Solaris Synchronization Data

Structures

Wi d S h i ti


51/52

Windows Synchronization

Objects


52/52

http://users.erols.com/ziring/diningAppletDemo.html

chapter 06 os concurrency deadlock and starvation

Documents