In this project, you will learn the basics of threading a process and how to work on the same memory space. You will learn how to make threads. You will discover the mutex, semaphore and shared memory.
The Dining Philosopher Problem states that K philosophers seated around a circular table with one chopstick between each pair of philosophers. There is one chopstick between each philosopher. A philosopher may eat if he can pick up the two chopsticks adjacent to him. One chopstick may be picked up by any one of its adjacent followers but not both.
- https://computing.llnl.gov/tutorials/parallel_comp/
- https://computing.llnl.gov/tutorials/pthreads/
- https://timmurphy.org/2010/05/04/pthreads-in-c-a-minimal-working-example/
- https://franckh.developpez.com/tutoriels/posix/pthreads/
- http://greenteapress.com/thinkos/html/thinkos012.html
- http://jean-luc.massat.perso.luminy.univ-amu.fr/ens/docs/thread-sem.html
- https://timmurphy.org/2014/04/26/using-fork-in-cc-a-minimum-working-example/
- https://stackoverflow.com/questions/876605/multiple-child-process
- https://stackoverflow.com/questions/9537068/sem-close-vs-sem-unlink-when-process-terminates
- https://www.thegeekstuff.com/2012/05/c-mutex-examples/
- https://www.youtube.com/watch?v=GXXE42bkqQk&ab_channel=BrianFraser
- https://computing.llnl.gov/tutorials/pthreads/