README: fix lists
This commit is contained in:
parent
74edb6eb7e
commit
7a1ccac676
66
README.md
66
README.md
@ -2,61 +2,61 @@
|
|||||||
|
|
||||||
## Overview
|
## Overview
|
||||||
Here are the things you need to know if you want to succeed this assignment:
|
Here are the things you need to know if you want to succeed this assignment:
|
||||||
•One or more philosophers sit at a round table.
|
- One or more philosophers sit at a round table.
|
||||||
There is a large bowl of spaghetti in the middle of the table.
|
There is a large bowl of spaghetti in the middle of the table.
|
||||||
•The philosophers alternatively eat, think, or sleep.
|
- The philosophers alternatively eat, think, or sleep.
|
||||||
While they are eating, they are not thinking nor sleeping;
|
While they are eating, they are not thinking nor sleeping;
|
||||||
while thinking, they are not eating nor sleeping;
|
while thinking, they are not eating nor sleeping;
|
||||||
and, of course, while sleeping, they are not eating nor thinking.
|
and, of course, while sleeping, they are not eating nor thinking.
|
||||||
•There are also forks on the table. There are as many forks as philosophers.
|
- There are also forks on the table. There are as many forks as philosophers.
|
||||||
•Because serving and eating spaghetti with only one fork is very inconvenient, a
|
- Because serving and eating spaghetti with only one fork is very inconvenient, a
|
||||||
philosopher takes their right and their left forks to eat, one in each hand.
|
philosopher takes their right and their left forks to eat, one in each hand.
|
||||||
•When a philosopher has finished eating, they put their forks back on the table and
|
- When a philosopher has finished eating, they put their forks back on the table and
|
||||||
start sleeping. Once awake, they start thinking again. The simulation stops when
|
start sleeping. Once awake, they start thinking again. The simulation stops when
|
||||||
a philosopher dies of starvation.
|
a philosopher dies of starvation.
|
||||||
•Every philosopher needs to eat and should never starve.
|
- Every philosopher needs to eat and should never starve.
|
||||||
•Philosophers don’t speak with each other.
|
- Philosophers don’t speak with each other.
|
||||||
•Philosophers don’t know if another philosopher is about to die.
|
- Philosophers don’t know if another philosopher is about to die.
|
||||||
•No need to say that philosophers should avoid dying!
|
- No need to say that philosophers should avoid dying!
|
||||||
|
|
||||||
## Global rules
|
## Global rules
|
||||||
You have to write a program for the mandatory part and another one for the bonus part
|
You have to write a program for the mandatory part and another one for the bonus part
|
||||||
(if you decide to do the bonus part). They both have to comply with the following rules:
|
(if you decide to do the bonus part). They both have to comply with the following rules:
|
||||||
•Global variables are forbidden!
|
- Global variables are forbidden!
|
||||||
•Your(s) program(s) should take the following arguments:
|
- Your(s) program(s) should take the following arguments:
|
||||||
number_of_philosophers time_to_die time_to_eat time_to_sleep
|
number_of_philosophers time_to_die time_to_eat time_to_sleep
|
||||||
[number_of_times_each_philosopher_must_eat]
|
[number_of_times_each_philosopher_must_eat]
|
||||||
◦number_of_philosophers: The number of philosophers and also the number
|
* number_of_philosophers: The number of philosophers and also the number
|
||||||
of forks.
|
of forks.
|
||||||
◦time_to_die (in milliseconds): If a philosopher didn’t start eating time_to_die
|
* time_to_die (in milliseconds): If a philosopher didn’t start eating time_to_die
|
||||||
milliseconds since the beginning of their last meal or the beginning of the sim-
|
milliseconds since the beginning of their last meal or the beginning of the sim-
|
||||||
ulation, they die.
|
ulation, they die.
|
||||||
◦time_to_eat (in milliseconds): The time it takes for a philosopher to eat.
|
* time_to_eat (in milliseconds): The time it takes for a philosopher to eat.
|
||||||
During that time, they will need to hold two forks.
|
During that time, they will need to hold two forks.
|
||||||
◦time_to_sleep (in milliseconds): The time a philosopher will spend sleeping.
|
* time_to_sleep (in milliseconds): The time a philosopher will spend sleeping.
|
||||||
◦number_of_times_each_philosopher_must_eat (optional argument): If all
|
* number_of_times_each_philosopher_must_eat (optional argument): If all
|
||||||
philosophers have eaten at least number_of_times_each_philosopher_must_eat
|
philosophers have eaten at least number_of_times_each_philosopher_must_eat
|
||||||
times, the simulation stops. If not specified, the simulation stops when a
|
times, the simulation stops. If not specified, the simulation stops when a
|
||||||
philosopher dies.
|
philosopher dies.
|
||||||
•Each philosopher has a number ranging from 1 to number_of_philosophers.
|
- Each philosopher has a number ranging from 1 to number_of_philosophers.
|
||||||
•Philosopher number 1 sits next to philosopher number number_of_philosophers.
|
- Philosopher number 1 sits next to philosopher number number_of_philosophers.
|
||||||
Any other philosopher number N sits between philosopher number N - 1 and philoso-
|
Any other philosopher number N sits between philosopher number N - 1 and philoso-
|
||||||
pher number N + 1.
|
pher number N + 1.
|
||||||
|
|
||||||
Philosophers I never thought philosophy would be so deadly
|
Philosophers I never thought philosophy would be so deadly
|
||||||
About the logs of your program:
|
About the logs of your program:
|
||||||
•Any state change of a philosopher must be formatted as follows:
|
- Any state change of a philosopher must be formatted as follows:
|
||||||
◦timestamp_in_ms X has taken a fork
|
* timestamp_in_ms X has taken a fork
|
||||||
◦timestamp_in_ms X is eating
|
* timestamp_in_ms X is eating
|
||||||
◦timestamp_in_ms X is sleeping
|
* timestamp_in_ms X is sleeping
|
||||||
◦timestamp_in_ms X is thinking
|
* timestamp_in_ms X is thinking
|
||||||
◦timestamp_in_ms X died
|
* timestamp_in_ms X died
|
||||||
Replace timestamp_in_ms with the current timestamp in milliseconds
|
Replace timestamp_in_ms with the current timestamp in milliseconds
|
||||||
and X with the philosopher number.
|
and X with the philosopher number.
|
||||||
•A displayed state message should not be mixed up with another message.
|
- A displayed state message should not be mixed up with another message.
|
||||||
•A message announcing a philosopher died should be displayed no more than 10 ms
|
- A message announcing a philosopher died should be displayed no more than 10 ms
|
||||||
after the actual death of the philosopher.
|
after the actual death of the philosopher.
|
||||||
•Again, philosophers should avoid dying!
|
- Again, philosophers should avoid dying!
|
||||||
Your program must not have any data races.
|
Your program must not have any data races.
|
||||||
|
|
||||||
|
|
||||||
@ -75,11 +75,11 @@ pthread_mutex_unlock
|
|||||||
Libft authorized No
|
Libft authorized No
|
||||||
Description Philosophers with threads and mutexes
|
Description Philosophers with threads and mutexes
|
||||||
The specific rules for the mandatory part are:
|
The specific rules for the mandatory part are:
|
||||||
•Each philosopher should be a thread.
|
- Each philosopher should be a thread.
|
||||||
•There is one fork between each pair of philosophers. Therefore, if there are several
|
- There is one fork between each pair of philosophers. Therefore, if there are several
|
||||||
philosophers, each philosopher has a fork on their left side and a fork on their right
|
philosophers, each philosopher has a fork on their left side and a fork on their right
|
||||||
side. If there is only one philosopher, there should be only one fork on the table.
|
side. If there is only one philosopher, there should be only one fork on the table.
|
||||||
•To prevent philosophers from duplicating forks, you should protect the forks state
|
- To prevent philosophers from duplicating forks, you should protect the forks state
|
||||||
with a mutex for each of them.
|
with a mutex for each of them.
|
||||||
|
|
||||||
## Bonus part
|
## Bonus part
|
||||||
@ -98,10 +98,10 @@ Description Philosophers with processes and semaphores
|
|||||||
The program of the bonus part takes the same arguments as the mandatory program.
|
The program of the bonus part takes the same arguments as the mandatory program.
|
||||||
It has to comply with the requirements of the Global rules chapter.
|
It has to comply with the requirements of the Global rules chapter.
|
||||||
The specific rules for the bonus part are:
|
The specific rules for the bonus part are:
|
||||||
•All the forks are put in the middle of the table.
|
- All the forks are put in the middle of the table.
|
||||||
•They have no states in memory but the number of available forks is represented by
|
- They have no states in memory but the number of available forks is represented by
|
||||||
a semaphore.
|
a semaphore.
|
||||||
•Each philosopher should be a process. But the main process should not be a
|
- Each philosopher should be a process. But the main process should not be a
|
||||||
philosopher.
|
philosopher.
|
||||||
The bonus part will only be assessed if the mandatory part is
|
The bonus part will only be assessed if the mandatory part is
|
||||||
PERFECT. Perfect means the mandatory part has been integrally done
|
PERFECT. Perfect means the mandatory part has been integrally done
|
||||||
|
|||||||
Loading…
Reference in New Issue
Block a user