forked from strivedi4u/hacktoberfest2024
-
Notifications
You must be signed in to change notification settings - Fork 0
/
DiningPhilospher.c
69 lines (53 loc) · 1.63 KB
/
DiningPhilospher.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include <stdio.h>
#include <pthread.h>
#include <semaphore.h>
#include <unistd.h>
#define N 5 // Number of philosophers
sem_t forks[N];
void *philosopher(void *arg) {
int id = *(int *)arg;
int left_fork = id;
int right_fork = (id + 1) % N;
while (1) {
// Think
printf("Philosopher %d is thinking.\n", id);
// Pick up left fork
sem_wait(&forks[left_fork]);
printf("Philosopher %d picked up left fork %d.\n", id, left_fork);
// Pick up right fork
sem_wait(&forks[right_fork]);
printf("Philosopher %d picked up right fork %d.\n", id, right_fork);
// Eat
printf("Philosopher %d is eating.\n", id);
// Put down right fork
sem_post(&forks[right_fork]);
printf("Philosopher %d put down right fork %d.\n", id, right_fork);
// Put down left fork
sem_post(&forks[left_fork]);
printf("Philosopher %d put down left fork %d.\n", id, left_fork);
// Repeat the cycle
sleep(1);
}
}
int main() {
pthread_t philosophers[N];
int ids[N];
// Initialize semaphores for each fork
for (int i = 0; i < N; ++i) {
sem_init(&forks[i], 0, 1);
}
// Create philosopher threads
for (int i = 0; i < N; ++i) {
ids[i] = i;
pthread_create(&philosophers[i], NULL, philosopher, &ids[i]);
}
// Join philosopher threads (this will never be reached in this simple example)
for (int i = 0; i < N; ++i) {
pthread_join(philosophers[i], NULL);
}
// Destroy semaphores
for (int i = 0; i < N; ++i) {
sem_destroy(&forks[i]);
}
return 0;
}