Process Synchronization

Consider the classical synchronization problem of dining philosophers in which, n philosophers sit at a round table with one chop stick between each philosopher (chop stick on the right hand belong to each philosopher). Philosophers do one work at a time i.e. either are thinking or eating. To eat, they need to have two chop sticks such that the chopsticks to their left and their right.

a) Provide an algorithm using Test-and-Set logic (disabling interrupts) to solves the dining philosopher problem. [01 Marks]

b) Show the steps of the solution validating: [03 Marks]

• Mutual exclusion,
• Progress,
• Must be viable for any number of philosophers and ensure that none of them starves to death.