EX NO:4
DATE DINING PHILOSOPHER PROBLEM USING SEMAPHORE
AIM:
Write a C program to simulate the concept of Dining-Philosophers problem.
ALGORITHM:
Step 1: Start
Step 2: Define the number of philosophers Step 3: Declare one thread per philosopher
Step 4: Declare one semaphore (represent chopsticks) per philosopher
Step 5: When a philosopher is hungry See if chopsticks on both sides are free Acquire both
chopsticks Eat Restore the chopstick If chopsticks aren‟t free
Step 6: Wait till they are available Step 7: Stop
PROGRAM
//Write the C Program to implement dining philosophy problem
#include<stdio.h>
#include<conio.h>
int tph, philname[20], status[20], howhung, hu[20], cho;
void main()
{
int i;
clrscr();
printf("\n\nDINING PHILOSOPHER PROBLEM");
printf("\nEnter the total no. of philosophers: ");
scanf("%d",&tph);
for(i=0;i<tph;i++)
{
philname[i] = (i+1); status[i]=1;
}
printf("How many are hungry : ");
scanf("%d", &howhung);
if(howhung==tph)
{
printf("\nAll are hungry..\nDead lock stage will occur");
printf("\nExiting..");
}
else
{
for(i=0;i<howhung;i++)
{
printf("Enter philosopher %d position: ",(i+1));
scanf("%d", &hu[i]);
status[hu[i]]=2;
}
do
{
printf("\n 1.One can eat at a time\n 2.Two can eat at atime\n 3.Exit \nEnter your choice:");
scanf("%d", &cho);
switch(cho)
{
case 1: one(); break;
case 2: two();
break;
case 3:
exit(0);
printf("\n No deadlock occur in this stage");
break;
default:
printf("\nInvalid option..");
break;
}
}while(1);
}
}
one()
{
int pos=0, x, i;
printf("\nAllow one philosopher to eat at any time\n");
for(i=0;i<howhung; i++, pos++)
{
printf("\nP %d is granted to eat", philname[hu[pos]]);
for(x=pos;x<howhung;x++)
printf("\nP %d is waiting", philname[hu[x]]);
}
}
two()
{
int i, j, s=0, t, r, x;
printf("\n Allow two philosophers to eat at same time\n");for(i=0;i<howhung;i++)
{
for(j=i+1;j<howhung;j++)
{
if(abs(hu[i]-hu[j])>=1&& abs(hu[i]-hu[j])!=4)
{
printf("\n\ncombination %d \n", (s+1));t=hu[i]; r=hu[j];
s++;
printf("\nP %d and P %d are granted to eat",philname[hu[i]],philname[hu[j]]);
for(x=0;x<howhung;x++)
{
if((hu[x]!=t)&&(hu[x]!=r))
printf("\nP %d is waiting", philname[hu[x]]);
}
}
}
}
getch();
}
OUTPUT
DINING PHILOSOPHER PROBLEM
Enter the total no. of
philosophers: 5How
many are hungry : 3
Enter philosopher 1 position: 2
Enter philosopher 2 position: 4
Enter philosopher 3 position: 5
1. One can eat at a time 2.Two can eat at
a time 3.Exit Enter your choice: 1
Allow one philosopher to eat at any time P 3 is granted
to eatP 3 is waiting P 5 is waiting P 0 is waiting
P 5 is granted to eat
P 5 is waiting P 0 is
waiting
P 0 is granted to eat P 0 is waiting
1.One can eat at a time 2.Two can eat at a time 3.Exit Enter your choice:
2 Allow two philosophers to eat at
same time
combination 1
P 3 and P 5 are granted to eat P 0
is w a i t i n g
combination 2
P 3 and P 0 are granted to eat P 5
is w a i t i n g c o m b i n a t i o n 3
P 5 and P 0 are granted to eat P 3
is waiting
1.One can eat at a time 2.Two can eat at
a time 3.Exit Enter your
choice: 3
RESULT:
Thus the program to implement the dining Philosopher was executed and verified.
