Lec11 semaphores

Lecture 11: Synchronization
(Chapter 6, cont)

Operating System Concepts – 8 th Edition,

Silberschatz, Galvin and Gagne

Semaphores (by Dijkstra 1930 – 2002)
Born in Rotterdam, The Netherlands
1972 recipient of the ACM Turing Award
Responsible for
The idea of building operating systems as explicitly
synchronized sequential processes
The formal development of computer programs
Best known for
His efficient shortest path algorithm
Having designed and coded the first Algol 60 compiler.
Famous campaign for the abolition of the GOTO statement
Also known for his hand-written communications with friends
and colleagues. For example:
http://www.cs.utexas.edu/users/EWD/ewd12xx/EWD1205.PDF
Operating System Concepts – 8 th Edition

6.2


Semaphores
Synchronization tool that does not require busy waiting
Semaphore S – integer variable
Two standard operations modify S: wait() and signal()
Originally called P() and V()
Also called down() and up()
The value of S can only be accessed through wait()
and signal()
wait (S) {

signal (S) {

while S <= 0

S++;

; // no-op

}

S--;
}

6.3


Semaphore Implementation with no Busy waiting

With each semaphore there is an associated waiting
queue.
typedef struct{
tnt value;
struct process *list;
} semaphore;
Two operations on processes:
block – place the process invoking the operation on
the appropriate waiting queue.
wakeup – remove one of processes in the waiting
queue and place it in the ready queue.


6.4


Semaphore Implementation with no Busy waiting (Cont.)
Implementation of wait:
wait(semaphore *S) {
S->value--;
if (S->value < 0) {
add this process to S->list;
block();
}
}
Implementation of signal:
signal(semaphore *S) {
S->value++;
if (S->value <= 0) {
remove a process P from S->list;
wakeup(P);
}
6.5
Operating System Concepts – 8 Edition
}
th

Semaphore as General Synchronization Tool
Counting semaphore – integer value can range over an unrestricted domain
Binary semaphore – integer value can range only between 0
and 1; can be simpler to implement
Also known as mutex locks
Can implement a counting semaphore S as a binary semaphore
Provides mutual exclusion
Semaphore mutex;

// initialized to 1

do {
wait (mutex);
// Critical Section
signal (mutex);
// remainder section
} while (TRUE);


6.6


Group Work (1): Signaling
One thread sends a signal to another
thread to indicate that something has
happened


6.7


Group Work (2): rendezvous
Generalize the signal pattern so that it works
both ways: Thread A has to wait for
Thread B and vice versa.

Thread A
a1
a2

Thread B
b1
b2

we want to guarantee that a1 happens before b2
and b1 happens before a2


6.8


Deadlock and Starvation
Deadlock – two or more processes are waiting indefinitely for an
event that can be caused by only one of the waiting processes
Let S and Q be two semaphores initialized to 1
P0
P1
wait (S);

wait (Q);

wait (Q);

wait (S);

.

.

.

.

.

.

signal (S);

signal (Q);

signal (Q);

signal (S);

Starvation – indefinite blocking. A process may never be removed
from the semaphore queue in which it is suspended
Priority Inversion - Scheduling problem when lower-priority process
holds a lock needed by higher-priority process

6.9


Classical Problems of Synchronization
Bounded-Buffer Problem
Readers and Writers Problem
Dining-Philosophers Problem


6.10


Bounded-Buffer Problem
N buffers, each can hold one item
Semaphore mutex initialized to 1
Semaphore full initialized to 0
Semaphore empty initialized to N.


6.11


Bounded Buffer Solution
Producer:

Consumer:

do {

do {
// produce an item in nextp

wait (full);
wait (mutex);

wait (empty);
wait (mutex);

// remove an item from buffer to nextc

// add the item to the buffer

signal (mutex);
signal (empty);

signal (mutex);
signal (full);

// consume the item in nextc

} while (TRUE);
} while (TRUE);

6.12


Readers-Writers Problem
A data set is shared among a number of concurrent
processes
Readers – only read; they do not perform any updates
Writers – can both read and write

Problem:
Allow multiple readers to read at the same time.
Only one writer can access the shared data at the same time

Shared Data
Data set
Semaphore mutex initialized to 1
Semaphore wrt initialized to 1
Integer readcount initialized to 0

6.13


Readers-Writers Solution
Reader:

Writer:

do {

do {

wait (mutex) ;
readcount ++ ;
if (readcount == 1)
wait (wrt) ;
signal (mutex)

wait (wrt) ;
//

writing is performed
signal (wrt) ;

// reading is performed

} while (TRUE);
wait (mutex) ;
readcount - - ;
if (readcount == 0)
signal (wrt) ;
signal (mutex) ;
} while (TRUE);

6.14


Same Solution in Different Format


6.15


Version 2 (part 1)


6.16


Version 2 (part 2)


6.17


Dining Philosophers Problem


6.18


The Problem
Devise a ritual (algorithm) that will allow
the philosophers to eat.
No two philosophers can use the same fork at
the same time (mutual exclusion)
No philosopher must starve to death (avoid
deadlock and starvation … literally!)


6.19


What's Wrong?


6.20


Avoiding deadlock (only 4 philosophers)


6.21


Dining Philosophers: Solution


6.22



6.23


Lec11 semaphores

More Related Content

What's hot (20)

Viewers also liked (20)

Similar to Lec11 semaphores (20)

Recently uploaded (20)

Lec11 semaphores

Editor's Notes