The Expansion Thought of the Experiment Course of the Philosopher's Dining Problem

Analysing the current situation of the experimental course of the operating system project.Through detailed analysis of the philosophers' dining problems,this paper analyzes and studies an algorithm proposed by K.Mani Chandy and J.Misra to solve large-scale concurrency problems.Given the philosophers' scheme to achieve this algorithm using mutexes,an example of interaction between three philosophers is presented to demonstrate algorithmic rules.Finally discussed the causes of deadlock,and analyzed and implemented a solution to reducing deadlock probability.Practice shows that the idea of this experimental course is expanded to help students understand the synchronization and deadlock problems of operating systems from various perspectives and to exercise their abilities to develop experimental thinking and project solutions.