Write Full Code For All Algorithm Along With Output and Screen Shot

K. J.
Somaiya College of Engineering, Mumbai-77

(An Autonomous College Affiliated to University of Mumbai)
Batch: B4 Roll No.: 1913121

Experiment / assignment / tutorial No.7
Grade: AA / AB / BB / BC / CC / CD /DD
Signature of the Staff In-charge with date
TITLE: Process synchronization

AIM: Shell scripts programs on Process synchronisation
OUTCOME: Student can Compare different algorithms used for management and
scheduling of processes.
Implementation of Process synchronization algorithms using semaphore - producer consumer

problem / reader-writers problem.
Write full code for all algorithm along with output

and screen shot.
Producer Consumer Problem:
#include <stdlib.h>
#include <stdio.h>
#include <pthread.h>
#include <semaphore.h>
/*
This program provides a possible solution for producer-consumer problem
using mutex and semaphore.
I have used 5 producers and 5 consumers to demonstrate the solution. You
can always play with these values.
*/
#define MaxItems 5 // Maximum items a producer can produce or a consumer

can consume
#define BufferSize 5 // Size of the buffer
sem_t empty;
sem_t full;
int in = 0;
int out = 0;
int buffer[BufferSize];
pthread_mutex_t mutex;
Department of Electronics and Telecommunication Engineering
OS/Sem V/ Aug- Dec 20 Page No

K. J. Somaiya College of Engineering, Mumbai-77
void *producer(void *pno)

{
int item;
for(int i = 0; i < MaxItems; i++) {
item = rand(); // Produce an random item
sem_wait(&empty);
pthread_mutex_lock(&mutex);
buffer[in] = item;
printf("Producer %d: Insert Item %d at %d\n", *((int
*)pno),buffer[in],in);
in = (in+1)%BufferSize;
pthread_mutex_unlock(&mutex);
sem_post(&full);
}
}
void *consumer(void *cno)
{
for(int i = 0; i < MaxItems; i++) {
sem_wait(&full);
pthread_mutex_lock(&mutex);
int item = buffer[out];
printf("Consumer %d: Remove Item %d from %d\n",*((int
*)cno),item, out);
out = (out+1)%BufferSize;
pthread_mutex_unlock(&mutex);
sem_post(&empty);
}
}
int main()
{
pthread_t pro[5],con[5];
pthread_mutex_init(&mutex, NULL);
sem_init(&empty,0,BufferSize);
sem_init(&full,0,0);
int a[5] = {1,2,3,4,5}; //Just used for numbering the producer and
consumer
for(int i = 0; i < 5; i++) {

pthread_create(&pro[i], NULL, (void *)producer, (void *)&a[i]);
}
for(int i = 0; i < 5; i++) {
pthread_create(&con[i], NULL, (void *)consumer, (void *)&a[i]);

}
for(int i = 0; i < 5; i++) {

pthread_join(pro[i], NULL);
}
for(int i = 0; i < 5; i++) {
pthread_join(con[i], NULL);
}
pthread_mutex_destroy(&mutex);
sem_destroy(&empty);
sem_destroy(&full);
return 0;
OUTPUT:

Dining philosopher problem

CODE:
#include<stdio.h>
#define n 4
int compltedPhilo = 0,i;
struct fork{
int taken;
}ForkAvil[n];
struct philosp{
int left;
int right;
}Philostatus[n];
void goForDinner(int philID){ //same like threads concept here cases

implemented
if(Philostatus[philID].left==10 && Philostatus[philID].right==10)
printf("Philosopher %d completed his dinner\n",philID+1);
//if already completed dinner
else if(Philostatus[philID].left==1 && Philostatus[philID].right==1){
//if just taken two forks
printf("Philosopher %d completed his dinner\n",philID+1);
Philostatus[philID].left = Philostatus[philID].right = 10;

//remembering that he completed dinner by assigning value 10
int otherFork = philID-1;
if(otherFork== -1)
otherFork=(n-1);
ForkAvil[philID].taken = ForkAvil[otherFork].taken = 0;
//releasing forks
printf("Philosopher %d released fork %d and fork
%d\n",philID+1,philID+1,otherFork+1);
compltedPhilo++;
}
else if(Philostatus[philID].left==1 &&
Philostatus[philID].right==0){ //left already taken, trying for right
fork
if(philID==(n-1)){

if(ForkAvil[philID].taken==0){ //KEY POINT OF THIS
PROBLEM, THAT LAST PHILOSOPHER TRYING IN reverse DIRECTION
ForkAvil[philID].taken =
Philostatus[philID].right = 1;
printf("Fork %d taken by philosopher
%d\n",philID+1,philID+1);
}else{
printf("Philosopher %d is waiting for fork
}
}else{ //except last philosopher case
int dupphilID = philID;
philID-=1;
if(philID== -1)
philID=(n-1);
if(ForkAvil[philID].taken == 0){
Philostatus[dupphilID].right = 1;
printf("Fork %d taken by Philosopher
%d\n",philID+1,dupphilID+1);
}else{
printf("Philosopher %d is waiting for Fork
%d\n",dupphilID+1,philID+1);
}
}
}
else if(Philostatus[philID].left==0){ //nothing taken yet
if(philID==(n-1)){
if(ForkAvil[philID-1].taken==0){ //KEY POINT OF
THIS PROBLEM, THAT LAST PHILOSOPHER TRYING IN reverse DIRECTION
ForkAvil[philID-1].taken =
Philostatus[philID].left = 1;
printf("Fork %d taken by philosopher
%d\n",philID,philID+1);
}else{
printf("Philosopher %d is waiting for fork
%d\n",philID+1,philID);
}
}else{ //except last philosopher case
if(ForkAvil[philID].taken == 0){
Philostatus[philID].left = 1;
printf("Fork %d taken by Philosopher

}else{
printf("Philosopher %d is waiting for Fork
}
}
}else{}
}
int main(){
for(i=0;i<n;i++)
ForkAvil[i].taken=Philostatus[i].left=Philostatus[i].right=0;
while(compltedPhilo<n){
/* Observe here carefully, while loop will run until all philosophers
complete dinner
Actually problem of deadlock occur only thy try to take at same time
This for loop will say that they are trying at same time. And remaining
status will print by go for dinner function
*/
for(i=0;i<n;i++)
goForDinner(i);
printf("\nTill now num of philosophers completed dinner are
%d\n\n",compltedPhilo);
}
return 0;
}
Output:

Signature of faculty in-charge

Write Full Code For All Algorithm Along With Output and Screen Shot

Uploaded by

Copyright:

Available Formats

Write Full Code For All Algorithm Along With Output and Screen Shot

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Write Full Code For All Algorithm Along With Output and Screen Shot

Uploaded by

Copyright:

Available Formats

K. J.

Somaiya College of Engineering, Mumbai-77

Batch: B4 Roll No.: 1913121

Signature of the Staff In-charge with date

TITLE: Process synchronization

Implementation of Process synchronization algorithms using semaphore - producer consumer

Write full code for all algorithm along with output

#define MaxItems 5 // Maximum items a producer can produce or a consumer

Department of Electronics and Telecommunication Engineering

OS/Sem V/ Aug- Dec 20 Page No

void *producer(void *pno)

for(int i = 0; i < 5; i++) {

OS/Sem V/ Aug- Dec 20 Page No

for(int i = 0; i < 5; i++) {

Department of Electronics and Telecommunication Engineering

OS/Sem V/ Aug- Dec 20 Page No

Dining philosopher problem

int compltedPhilo = 0,i;

void goForDinner(int philID){ //same like threads concept here cases

Philostatus[philID].left = Philostatus[philID].right = 10;

Department of Electronics and Telecommunication Engineering

OS/Sem V/ Aug- Dec 20 Page No

OS/Sem V/ Aug- Dec 20 Page No

Department of Electronics and Telecommunication Engineering

OS/Sem V/ Aug- Dec 20 Page No

Signature of faculty in-charge

Department of Electronics and Telecommunication Engineering

OS/Sem V/ Aug- Dec 20 Page No

You might also like

void producer(void pno)