0% found this document useful (0 votes)
16 viewsOS2
Operating System unit 2(AKTU series)
Uploaded by
ashishtrufCopyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
16 viewsOS2
Operating System unit 2(AKTU series)
Uploaded by
ashishtrufCopyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
/ 33
Concurrent Processes
CONTENTS
Part-1
Part-2
Part-3
Part-4
Part-5
Part-6
Part-7
Part-8
Part-9
Part-11
Part-10 :
?
Concurrent Processes >.
Process Concept
Principle of Concurrency ~
Producer Consumer Problem ...
Mutual Exclusion ..
Critical Section Problem....-—-—------ 2-7E to 2-9
Dekker’s Solution _--- 3-BE to 2-10C
Peterson Solution ....
_- 2-10€ te 2-126
Semaphores ..... a. 2-12C to 2-20C
Test and Set Problem
Classical Problem in .....
Concurrency— Dining
Philosopher Problem,
Sleeping Barber Problem
Interprocess Communicsliae oR to 2-31
2-1 C (MCA-Sem-2) Process contains four sections :
a Text
b. Data ————————— )=—S—i ia ir
Operating Systems
a
Que 2.2. ] Differentiate between the following:
Process and program
ii. Busy wait and blocking wait
Answer
i.
[S.No.
Process and program
Process
2-3 C (MCA-Sem-2)
Program |
1. | Process is an operation which
takes the given instruction and
performs the manipulations as
per the code called execution
‘Program is a set of instructions |
that perform a designated task.
2, | A process is entirely dependent
on program.
Programs are idependent.
3. Process is a module that executes
concurrently. They are
separable and loadable modules.
Program performs a task
directly relating to an operation.
4. | A process includes program | A program is just a set of]
counter, a stack, a data section, | instructions stored on disk
and a heap.
5. | Itis anactive entity. Itis a passive entity.
Busy wait and blocking wait
S.No.
Busy wait
Blocking wait |
Busy waitis a loop that reads
the status register over and
over until the busy bit
becomes clear.
Blocking is a situation where
processes wait indefinitely within a
semaphore.
inappropriate.
2 ha. gape rnen scheduling } It oceurs when process resources |
overhead is larger than | are needed f s |
expected wait time. ao |
5 oF. :
3. | Itisschedule based. In this, schedule based algorithm is |
Principle of Concurrency. ‘quezs | What is the a of. concurrency ?
_ Explain the principle of oe
a Concurrency is based on following Principles ;
a Relative speed of execution of Processes is not pre,
b. System interrupts are not predictable,
¢. Scheduling policies may vary.
Coneurenyi the tendency “oh atthesame time ing
dictable,
7 also refers to seins
4 Cnr nn
a it may benefit
mals ogra More usable,
is used alot on sin,
le processing units
5 Fort oN tasking operating System, this is
asynonym for tags
6 Ifwe can
Ble processing
with respect to
uments simultanéously in the tabs of our
Spen menus and perform more actions, thsi Operating
State and describe
25C (McA-Sem-2)
Systems
problem with its su table
the producer consumer
solution.
mer process consumes
Answer
i
i,
3.
4.
Solution to pr
roduce data item that consw
mer. Buffer size may be
tion of the application generates data
and the consumer reads data from the buffer-
its data if the buffer is full. Similarly, 2
the buffer is empty-
sit its data. The consumer
uuffer contains.
Producer process P’
later.
Buffer is used
fixed or variable. The p»
and stores it in a buffer,
ot deposit i
ny data il
ducer can depo!
data item if bi
between producer and cons
roducer po
he producer cann
consumer cannot retrieve a
If the buffer is not full, a pro
should be allowed to retrieve a
‘oducer consumer problem =
void main ()
{
count = 0;
J
int i;
binarysemphore s = 1;
int producer ();
q
While (true)
{
produce_data_item ();
_semwaitB(s);
append ();
count = count + 1;
if (count = = 1)
semSignalB(delay);
semSignalB(s);
)
}
int consumer ()
{
int p;
semWaitB(delay);
while (true) Formally, while one process exe
Processes desiring to do's0 at th
when that process ha
the processes waiting to do so should be allows
utes the shared variable, all other
© Same time should be kept waiting;
s finished executing the shared Variable, one of
ed to proceed,
Mutual exclusion needs to be enforced only
modifiable data when processes are perfo)
conflict with one ‘another, they should beall
Thus in mutual exclusion, a single process
Process from using a shared resource i
integrity.
When processes access shared
ming operations that do not
lowed to proceed. ‘concurrently.
temporarily excludes all other
in order to ensure the system
Four conditions of mutual exclusion are ;
a. No two processes may at the same moment be inside their critical
sections, sses OF
de about relative speeds of proce’
other processes:
ical sectio? shi
‘te eritical sectio™
ion-
uirements be
ly one PY
. that hav!
ocess at 2
Answe) ,
jnould meet the following rev
clusion must be enforced by allowing © :
al section, among ‘all processe: e critic:
e resource OT shared object.
that critical section MUSE do so without
2, A process
with other
interfering
requiring access to critical section
pe possible for a Proce’
‘indefinitely, 2° deadlock or starvation
inacritical section, any process that requests entry
thout delay-
a sat be permitted to enter
process speeds OF number of
3. It must not
to be delaye
4, Whenno processis
ritical section
toits ©
5, Noassumptions are made about relative
processors:
inside its critical section for a finite time only-
6. Aprocess remains
PART-5
Critical Section Problem.
Questions-Answers
Questions
Que 2.7.
.! | What do you understand by critical section problem ?
What are th i
e requirements of a solution to the critical sectio:
n
problem ?
OR
List the essenti i
tial requirements of critical section imple: it
mentation.
Critical section :
1. Ager
ical section ii
e is a code >
resource is accessed. segment in a process in which a shared Each Process has a segment of code called a Critical section, Cy,
Section used to avoid race conditions on data items, Bacal
3 In critical section the process may be changing common Variaby
updating a table, writing a file and so on. At any moment at aa S
Process can execute in critical section (CS), pre
‘When one process is executing in its critical section, no ot
to be allowed to execute in its critical section, The execut
section by the process is mutually exclusive in time.
Asolution to the critical secti
three requirements :
1. Mutual exclusion Ifprocess P, is executing in its critical Section, then
no other processes can be executing in their critical sections,
Progress : If no process is executing in its critical section and some
Processes wish to enter their critical sections, then only those processes
that are not executing in their remainder ‘Sections can participate jn
deciding which will enter its critical section hext, and this selection
cannot be postponed indefinitely,
3. Bounded waiting : There exists a bound, or limit, on the number of
times that other processes are allowed to enter their critical sections
after a process has made a request to enter its critical section and before
that request is granted.
Que 2.8. | What do you understand by critical section ? Discuss
Bakery algorithm. Also, show how it satisfies the requirements of
a mechanism to control access to critical section.
Answer
Critical seetion : Refer Q. 2.7, Page 2-7C, Unit-2,
Bakery algorithm :
1. Bakery algorithm is used in multiple process solution.
| 2. It solves the problem of critical section for n processes.
3. Each process requesting entry to critical section is given a numbered
| token such that the number on the token is larger than the maximum
| number issued earlier.
ther process ig
tion of critica)
ion problem must satisfy the followin,
2
H 4. This algorithm was developed for a distributed environment.
| 5. Thealgorithm permits processes to enter the critical section inthe order
| of thei bers.
that two processes do not
served first.
0 then
Get Sto S—1
Else a
Block the calling process Ge., Wat on S)
ys) or signal(S) +
igany PrOesee waitingon S
Start one of these processes
Else
Set S to s+l E
Algorithm : We apse! eat oe pool consists 7 puffers, each capable of
holding one item. The mutex semaphore provides mut exclusio2® fer
the buffer pool and is jnitialized to the value 52
accesses tO
do (
wait(ful)) ;
wait(mutex);
// remove ap item from puffer to nextc ?
signal(mutex);
signal(empty);
/i consume the item in nexte
} while(TRUE); -
Que 2.16. ] State the producer consumer problem. Give a solution
to the problem using semaphores
Answer |
Q. 2.4, Page 2-4, Unit-2.
Prod
tucer consumer problem : Refer
Solution :
c
ode for producer consumer problem
#idefine buffercapacity 200
typedef int semaphore;
semagheve nil 02 Semaphore
Semaphore
Void
{Producer (voigy
int item;
while (true)
{
item = produce
down (& empt
down (& mutex):
Msert_item (item).
up(& mutex),
up(& full);
item();
}
}
void consumer (void)
{
int item;
while (true)
{
down(& full):
down(& mutex);
item = Temove_item( ):
up(& mutex);
up(& empty
consume _item(item);
]
Que 2.17. | State the finite buffer producer consumer problem. Give
solution of the problem using semaphores.
Answer
Producers produce items to be stored in the buffer.
Consumers remove and consume items which have been stored.
Mutual exclusion must be enforced on the buffer itself,
Moreover, producers can store only when there is an empty slot, and
consumers can remove only when there is a full slot,
5. Three semaphores are used :
a. The binary semaphore mutex controls access to the buffer itself.
b. The counting semaphore empty keeps track of empty slots.
¢. The counting semaphore full keeps track of full slots.
wa IS
ee ea out, count
ype
shared int in,
producer: any!
repeat
{
/* produce something */
item = produce0s
/p* wait for an empty 5)
P(empty);
p= store the item a
P(mutex);
buffer[in] = items,
jn =in + 1 mod MAX;
count = count + 1;
Vamutex);
/* report the new full slot */
V(full);
pace */
J
until done;
Consumer anytype item;
repeat
(
/* wait for a stored item */
P(full);
/* remove the item */
P(mutex);
item = buffer[out];
out = out + 1 mod MAX;
count = count — 1;
Vimutex); 2-18 (MCA-Sem-2) Concurrent Processes
————————— eee
/* report the new empty slot */
Viempty);
F consume it
consume(item);
until done;
Que 2.18. | Discuss reader/writer problem,
Answer
L
It is a synchronization problem that is used to compare and contrast
synchronization mechanisms.
It isalso an eminently used practical problem.
Suppose that a database is to be shared among several concurrent
processes. Some of these processes may want only to read the database,
whereas others may want to update (that is, to read and write) the
database.
We distinguish between these two types of processes by referring to the
former as readers and to the latter as writers.
Obviously, if two readers access the shared data simultaneously, no
adverse effects will result.
However, ifa writer and some other process (either a reader or a writer)
access the database’ simultaneously, chaos may ensure,
To ensure that these difficulties do not arise, we require that the writers
‘have exclusive access to the shared database while writing to the database.
This_synchronization problem is referred to as the readers/writers
problem.
Que219.| Give a solution to reader/writer problem using
semaphores.
OR
Give the solution of readers/writers problem by using the concept
of semaphore.
aa
Reader/writer problem solution using semaphores :
as
2.
Readers/writers problem has several variations, all inyolving priorities.
‘The simplest one, referred to as the first readers/writers problem,
Tequires that no reader will be kept waiting unless a writer has already
obtained permission to use the shared object.
In the solution to the first readers/writers problem, the reader processes
share the following data structures : Operatin
10.
is
g Systems 2-19 C (MCA-Sem-2)
x, wrt ; int readcount
Semaphore mute:
.d wrt are initialize
‘The semaphores mutex an
to 0.
‘The semap
‘The mutex semaphore is used t
variable readcount is updated.
The readcount variable keeps track o
reading the object.
emaphore wrt functions as a mutual exclusion semaphore for the
.d to 1; readcount is initialized
ler and writer processes
hore wrt is common to both read:
tual exclusion when the
9 ensure mui
{how many processes are currently
The s
writers.
It is also used by the first or last reader that enters or (exits the critical
section.
hile other readers are in
It is not used by readers who enter or exit w
their critical sections.
do
{
wait(wrt);
signal (wrt);
Jwhile (TRUE);
The writer process :
do{
wait(mutex);
readcount ++ ;
if (readcount == 1)
wait(wrt);
signal(mutex); Treading is performed,
wait (mutex);
readcount—
if (readcount
signal(wrt);
signal(mutex);
jwhile (TRUE);
// writing is performed
Que 2.20, | State the readers/writers problem with readers having
priority. Give solution of the problem using semaphores.
Answer
Readers/writers problem : Refer Q. 2.18, Page 2-18C, Unit-2.
Readers/write: 3
cree writers problem, with readers: having ae eee
1
Hore Beority means, no reader should wait if the share is currently
opened for reading. Three variables are used : mutex, wrt, read
implement solution ; It exits the critic,
Reader Process ;
Reader requests tl
Ifaliowed :
a. i
he entry to critical section,
PART-9 itical section 2 What are
a by
boolean rv = target ;
target = true ;
return rv ;
}
on is used in implementing mutual exclusion.
8. Test and set instructi
PART-10
Classical Problem i
in Concurrency—Dini. 7 Hee
Sleeping oS ‘ 2-22 C (MCA-Sem-2) Concurrent Processes
$$$ ________*
Que 2,22. | Describe classical problem of concurrency.
Answer
Classical problem of concurrency are :
1, Bounded buffer producer consumer problem : Refer Q. 2.17,
Page 2-16C, Unit-2.
2 Readers/writers problem : Refer Q. 2.18, Page 2-18C, Unit-2,
3. Dining philosophers problem :
i The Dining philosophers problems is a classic synchronization
problem.
ii There is a dining room containing a circular table with five chairs,
At each chair is a plate, and between each plate is a single chopstick,
ii Inthe middle of the table is a bowl of spaghetti,
Spaghetti
Fig. 2.22.1,
iv._Near the room are five philosophers who spend most of their time
thinking, but who occasionally get hungry and need to eat so they
can think some more.
v. Inorder toeat, a philosopher must sit at the table, pick up the two
chopsticks to the left and right of a plate, then serve and eat the
spaghetti on the plate,
vi. Thus, each philosopher is represented by the following pseudocode :
process P[i]
while true do
( THINK,
PICKUP(CHOPSTICKIi), CHOPSTICKli+1 mod 5);
EAT;
PUTDOWN(CHOPSTICK{i], CHOPSTICKI{i+1 mod 5)); ———————"~S————“‘_i—S—
2-23 C (MCA-Sem-2)
g Systems
sopher who
Operatini
‘A philosopher may: THINK indefinitely. Every philo
BATs will eventually finish
Philosophers may PICKUP and PUTDOWN their chopsticks in
either order, or nondeterministically, but these are atomic actions,
and, of course, two philosophers cannot use 4 single CHOPSTICK
at the same time.
ix. The problemis to design 2 protocol to satisfy the livenes:
any philosopher who tries to EAT, eventually does.
4. Sleeping barber problem:
‘A barbershop is designed 0 that ther
the barber chair and an adjoining waiting t0
contains N chairs.
2, Ifthe barberis busy, the
customers sit in one of the availabl
3, Ifacustomer enters the shop and all chairs are occupied, the customer
Jeaves without a haircut. If there are 20 customers to be served, the
parber goes to sleep in the barber chair with the door to the waiting
room open
4, Ifthe barber is asleep, th
vil.
viii
.s condition:
e room that contains
eis a privat
hh asliding door that
ym wit]
door to the private rooms closed and arriving
le chairs.
e customer walkes the barber and bas 2 hair
ion that uses semaphores.
cut. Fig. 2.22.2 shows an implementati
Entrance (with Barber chair
sliding door)
Ss “| ar | text
Waiting room = En
JE age ers
Fig. 2.22.2. Barbershop.
Que 2.23, is dini i
aie 3] What is dining philosophers problem ? Discuss the
lution to dining philosophers problem using monitors.
Answer
Din F
‘ i ie philosophers problem : Refer Q. 2.22 Page 2-22C, Unit-2.
. Amonitor is a synchronization co: ‘ aul es
= struct that allo i
j a shared resources in a mutually exclusive pee a oo
. Inthis solution, we will
= ution, create a monitor that
‘ ne chopsticks, and each philosopher will be opens teers
a represented by a separate 1.
w
Solution
following
Concurrent Processes
The
to dining Philosophers Problem ;
way:
Solution works im
Create a mol
Monitor should have
PutDownChopsticks| 5
Each philosopher thread Should have @ unique
“xecute the following code
while true:
think()
nitor that Tepresents the table
and the cho,
two methods :
sticks, ‘Th;
pickU, i
8
PChopsticks() and
1D number and shoulg
monitor. pickUpChopsticks( 1D)
eat()
monitor.putDownChopsticks(ID)
The think() function Tepresents the Philosopher thinking before
attempting to eat, The eat() function Tepresents the Philosopher eating
atter successfully Acquiring two chopsticks,
The PickUpChopsticks(ID) methodof the monitor should be implementeq
as follows :
def pickUpChopsticks(ID):
left =ID
right = (ID +1) %5
while not (chopstick{left] and cho,
pstick (right);
wait()
chopstick(left] = chopsticklright] = False
This code attempts to acquire two chopsticks by checking if both
chopsticks are available,
Ifthey are not av:
of the monitor.
Ifhoth chopsticks are available, the philosopher sets the chopstick flags
to False to indicate that they are i
inuse,
The putDownChopstick:
implemented as follows:
def putDownChopsticks(ID) ;
left = ID
right = (ID +1) %5
chopstick{left] = chopstick{right] = True
ailable, the Philosopher waits using the wait() method
s(ID) method of the monitor should be 2-25C (MCA-Sem-2)
Jhopstick flags to
setting the ¢
tifyAl1O method
notifyAlO
g the no’
e releases
‘and wakes UP
opsticks by
the two cht i
philosophers usin
all waiting
shared chopsticks, we
4 chopstick at 2 time.
ing a monitor
ae er that only one philosopher can use
preventing deadlocks and starvation
aiting room with n chairs
Que 2.24. |A parber shop consists of aw
parber chair. If there are 20 customers
to sleep- If a customer enters the
to be Oe ene to sietld, then the customer leov Te
er is busy put chairs are available, then the
the sop. If 1, one of the free chairs: i the barber is asleep, the
ete fwrakesan Pama ee an/al puritan son tine ele
Synchronization problem using semaphores-
Answer
1. Weuse 3semaphores: Semaphore ‘e
semaphore ‘barbers’ is the number of idle parbers (0 or 1);
used for «mutual’ exclusion.
9, Ashared data variable ‘custome
scopy of ‘customers’ but we need it here because we ©
value of semaphores directly.
‘cutting’ which ensures that the barber would
ts hair before the previousicustomer leaves-
»ustomers’ counts waiting customer==
and mutex is
sl’ also counts waiting customers, Itis
annot access the
3, We also need semaphore
not cut another customer
// shared data
semaphore customers =
semaphore barbers = 0;
semaphore cutting = 0;
semaphore mutex = 1;
int customers1 = 0;
void barber() {
while(true) {
wait(customers);
// sleep when there are no waiting
customers
wait(mutex); ORR are yes gee a
2-26 C (MCA-Sem.2) Concurrent Progg,
Mmuti
for accessing customers]
customers] = customersi — 1,
signal(barbers),
signal mutex);
cut_hair();
}
)
Void customer() {
wait(mutex); / mutex for accessing customers]
if (customers
