Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
I would like my program to have an output like at the bottom #include #include #include #include #define N 4 #define THINKING 2 #define HUNGRY 1 #define Eating 0 #define left_neighbor (phnum + 4) % N #define right_neighbor (phnum + 1) % N int state[N]; int phil[N] = { 0, 1, 2, 3 }; sem_t mutex; sem_t S[N]; void test(int phnum) { if (state[phnum] == HUNGRY && state[left_neighbor] != Eating && state[right_neighbor] != Eating) { // Philospher EATING state[phnum] = Eating; sleep(2); printf("PHIL %d EATING\n", phnum + 1); sem_post(&S[phnum]); } state[phnum] = HUNGRY; printf("PHIL %d HUNGRY\n", phnum + 1); // eat if neighbor are not eating_turn test(phnum); sem_post(&mutex); sem_wait(&S[phnum]); sleep(1); } { printf("PHIL %d is THINKING\n", phnum + 1); test(left_neighbor); test(right_neighbor); sem_post(&mutex); } void* philosphr(void* num) { while (1) { int* i = num; sleep(1); sleep(0); } } int main() { int i; pthread_t thread_id[N]; // initiate the semaphores sem_init(&mutex, 0, 1); for (i = 0; i < N; i++)   sem_init(&S[i], 0, 0); for (i = 0; i < N; i++) { pthread_create(&thread_id[i], NULL, philosphr, &phil[i]); printf("PHIL %d THINKING\n", i + 1); } for (i = 0; i < N; i++) pthread_join(thread_id[i], NULL); }

I would like my program to have an output like at the bottom #include #include #include #include #define N 4 #define THINKING 2 #define HUNGRY 1 #define Eating 0 #define left_neighbor (phnum + 4) % N #define right_neighbor (phnum + 1) % N int state[N]; int phil[N] = { 0, 1, 2, 3 }; sem_t mutex; sem_t S[N]; void test(int phnum) { if (state[phnum] == HUNGRY && state[left_neighbor] != Eating && state[right_neighbor] != Eating) { // Philospher EATING state[phnum] = Eating; sleep(2); printf("PHIL %d EATING\n", phnum + 1); sem_post(&S[phnum]); } state[phnum] = HUNGRY; printf("PHIL %d HUNGRY\n", phnum + 1); // eat if neighbor are not eating_turn test(phnum); sem_post(&mutex); sem_wait(&S[phnum]); sleep(1); } { printf("PHIL %d is THINKING\n", phnum + 1); test(left_neighbor); test(right_neighbor); sem_post(&mutex); } void* philosphr(void* num) { while (1) { int* i = num; sleep(1); sleep(0); } } int main() { int i; pthread_t thread_id[N]; // initiate the semaphores sem_init(&mutex, 0, 1); for (i = 0; i < N; i++)   sem_init(&S[i], 0, 0); for (i = 0; i < N; i++) { pthread_create(&thread_id[i], NULL, philosphr, &phil[i]); printf("PHIL %d THINKING\n", i + 1); } for (i = 0; i < N; i++) pthread_join(thread_id[i], NULL); }

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

I would like my program to have an output like at the bottom

#include <pthread.h>

#include <semaphore.h>

#include <stdio.h>

#include <unistd.h>

#define N 4

#define THINKING 2

#define HUNGRY 1

#define Eating 0

#define left_neighbor (phnum + 4) % N

#define right_neighbor (phnum + 1) % N

int state[N];

int phil[N] = { 0, 1, 2, 3 };

sem_t mutex;

sem_t S[N];

void test(int phnum)

{

if (state[phnum] == HUNGRY

&& state[left_neighbor] != Eating

&& state[right_neighbor] != Eating)

{

// Philospher EATING

state[phnum] = Eating;

sleep(2);

printf("PHIL %d EATING\n", phnum + 1);

sem_post(&S[phnum]);

}

state[phnum] = HUNGRY;

printf("PHIL %d HUNGRY\n", phnum + 1);

// eat if neighbor are not eating_turn

test(phnum);

sem_post(&mutex);

sem_wait(&S[phnum]);

sleep(1);

}

{

printf("PHIL %d is THINKING\n", phnum + 1);

test(left_neighbor);

test(right_neighbor);

sem_post(&mutex);

}

void* philosphr(void* num)

{

while (1)

{

int* i = num;

sleep(1);

sleep(0);

}

}

int main()

{

int i;

pthread_t thread_id[N];

// initiate the semaphores

sem_init(&mutex, 0, 1);

for (i = 0; i < N; i++)

 

sem_init(&S[i], 0, 0);

for (i = 0; i < N; i++) {

pthread_create(&thread_id[i], NULL,

philosphr, &phil[i]);

printf("PHIL %d THINKING\n", i + 1);

}

for (i = 0; i < N; i++)

pthread_join(thread_id[i], NULL);

}

 

PHIL 0 PHIL 1 PHIL 2 PHIL 3 PHIL 4 THINKING THINKING THINKING THINKING THINKING THINKING THINKING THINKING THINKING HUNGRY THINKING THINKING THINKING THINKING EATING THINKING THINKING THINKING HUNGRY ΕAΤING HUNGRY THINKING THINKING HUNGRY ΕAΤING HUNGRY THINKING THINKING HUNGRY THINKING ΕATIG THINKING THINKING HUNGRY THINKING ΕATING THINKING THINKING EATING ΤHINKING EATING THINKING THINKING EATING HUNGRY THINKING THINKING THINKING EATING HUNGRY THINKING THINKING THINKING THINKING HUNGRY THINKING THINKING THINKING THINKING EATING THINKING THINKING HUNGRY THINKING EATING THINKING THINKING EATING THINKING EATING THINKING HUNGRY ΕAΤING THINKING EATING THINKING HUNGRY EAΤING THINKING THINKING HUNGRY HUNGRY EATING THINKING THINKING ΕATIG HUNGRY EAΤING THINKING THINKING EATING HUNGRY EAΤING HUNGRY THINKING ΕAΤING HUNGRY THINKING HUNGRY ΤHINKING ΕAΤING HUNGRY THINKING EATING THINKING THINKING HUNGRY THINKING EATING ΤHINKING THINKING EATING THINKING ΕAΤING THINKING THINKING ΕAΤING HUNGRY EATING ΤHINKING THINKING EATING HUNGRY THINKING THINKING THINKING THINKING HUNGRY THINKING THINKING THINKINΝG THINKING EATING THINKING THINKING THINKING HUNGRY ΕAΤING THINKING THINKING
Transcribed Image Text:PHIL 0 PHIL 1 PHIL 2 PHIL 3 PHIL 4 THINKING THINKING THINKING THINKING THINKING THINKING THINKING THINKING THINKING HUNGRY THINKING THINKING THINKING THINKING EATING THINKING THINKING THINKING HUNGRY ΕAΤING HUNGRY THINKING THINKING HUNGRY ΕAΤING HUNGRY THINKING THINKING HUNGRY THINKING ΕATIG THINKING THINKING HUNGRY THINKING ΕATING THINKING THINKING EATING ΤHINKING EATING THINKING THINKING EATING HUNGRY THINKING THINKING THINKING EATING HUNGRY THINKING THINKING THINKING THINKING HUNGRY THINKING THINKING THINKING THINKING EATING THINKING THINKING HUNGRY THINKING EATING THINKING THINKING EATING THINKING EATING THINKING HUNGRY ΕAΤING THINKING EATING THINKING HUNGRY EAΤING THINKING THINKING HUNGRY HUNGRY EATING THINKING THINKING ΕATIG HUNGRY EAΤING THINKING THINKING EATING HUNGRY EAΤING HUNGRY THINKING ΕAΤING HUNGRY THINKING HUNGRY ΤHINKING ΕAΤING HUNGRY THINKING EATING THINKING THINKING HUNGRY THINKING EATING ΤHINKING THINKING EATING THINKING ΕAΤING THINKING THINKING ΕAΤING HUNGRY EATING ΤHINKING THINKING EATING HUNGRY THINKING THINKING THINKING THINKING HUNGRY THINKING THINKING THINKINΝG THINKING EATING THINKING THINKING THINKING HUNGRY ΕAΤING THINKING THINKING
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS