Hello everyone, I need help to implement this question into a code: Question: Fo
ID: 3810307 • Letter: H
Question
Hello everyone, I need help to implement this question into a code:
Question: For the Dining-Philoshpers problem (N philosophers), suppose that a queue and a scheduler are implemented to guarantee that at most N-1 philoshpers can be runing the critical sectionm will there still be any deadlocks that could happen?
Answer: Yes, there will still be deadlocks that could happen, while there is still extra resources, there are not enough to satisfy the philosopher needs to have both a right and left fork, even with N-1 philosophers.
Code: ( I need help implementing this in a code based) Thank you so much for the assistances.
Explanation / Answer
// Layout of the table (P = philosopher, f = fork):
// P0
// f1 f0
// P1 P3
// f2 f3
// P2
# Number of philosophers at the table.
# There'll be the same number of forks.
include<stdio.h>
#include<semaphore.h>
#include<pthread.h>
#define N 5
#define THINKING 0
#define HUNGRY 1
#define EATING 2
#define LEFT (ph_num+4)%N
#define RIGHT (ph_num+1)%N
sem_t mutex;
sem_t S[N];
void * philospher(void *num);
void take_fork(int);
void put_fork(int);
void test(int);
int state[N];
int phil_num[N]={0,1,2,3,4};
int main()
{
int i;
pthread_t thread_id[N];
sem_init(&mutex,0,1);
for(i=0;i<N;i++)
sem_init(&S[i],0,0);
//Lists to hold the philosophers and the forks.
//Philosophers are threads while forks are locks.
for(i=0;i<N;i++)
{
pthread_create(&thread_id[i],NULL,philospher,&phil_num[i]);
printf("Philosopher %d is thinking ",i+1);
}
for(i=0;i<N;i++)
pthread_join(thread_id[i],NULL);
}
void *philospher(void *num)
{
while(1)
{
int *i = num;
sleep(1);
take_fork(*i);
sleep(0);
put_fork(*i);
}
}
void take_fork(int ph_num)
{
sem_wait(&mutex);
state[ph_num] = HUNGRY;
printf("Philosopher %d is Hungry ",ph_num+1);
test(ph_num);
sem_post(&mutex);
sem_wait(&S[ph_num]);
sleep(1);
}
void test(int ph_num)
{
if (state[ph_num] == HUNGRY && state[LEFT] != EATING && state[RIGHT] != EATING)
{
state[ph_num] = EATING;
sleep(2);
printf("Philosopher %d takes fork %d and %d ",ph_num+1,LEFT+1,ph_num+1);
printf("Philosopher %d is Eating ",ph_num+1);
sem_post(&S[ph_num]);
}
}
void put_fork(int ph_num)
{
sem_wait(&mutex);
state[ph_num] = THINKING;
printf("Philosopher %d putting fork %d and %d down ",ph_num+1,LEFT+1,ph_num+1);
printf("Philosopher %d is thinking ",ph_num+1);
test(LEFT);
test(RIGHT);
sem_post(&mutex);
}
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.