KT24403: There are N philosophers and N forks, the philosophers represent processes and forks represent resources: Operating Systems Assignment, UMS, Malaysia
| University | University Malaysia Sabah (UMS) |
| Subject | KT24403: Operating Systems |
The Dining Philosophers
There are N philosophers and N forks, the philosophers represent processes and forks represent resources
The philosophers are competing for forks and in order to eat, a philosopher needs 2 forks, one on the left and one on the right.
We need to prevent deadlock situations in cases where all philosophers are holding a fork and waiting to acquire another fork in order to be able to eat.
One of the simple rules we can implement to prevent deadlocks is to stop philosophers from taking up a fork if the other fork has already been taken by another process.
For example, if Philosopher 3 is ready to eat, he/she must have forks 3 and 4, but if fork 4 has already been taken by Philosopher 4 then Philosopher 3 cannot take up fork 3 and must wait for fork 4 to be available before it can take up both forks and eat.
Create a program to show the synchronization in this situation.
1. There are N philosophers and N forks Philosophers have 4 states, Thinking (Waiting), Hungry (Ready) Eating (Executing), and Exit (Terminate).
2. A philosopher can be in different states and the diagram below shows the changes in states from start to end.
Stuck in Completing this Assignment and feeling stressed ? Take our Private Writing Services.
Get Help By Expert
If you’re struggling with your, our online homework helpers can support you to get an excellent mark in DSC721 Enterprise Data Analytics UiTM Assignment, ITS432 Database Design & Development UiTM Assignment, STA610 SAS Programming UiTM Assignment, DSC790 Data Science Project UITM Assignment, etc many more at an affordable price
Recent Solved Questions
- The organization that we have chosen for this assignment is Legoom Valley Solution & Consultancy: Information Security Assignment, UTM, Malaysia
- The traveling salesman problem (TSP) is an NP-hard problem that can be represented as a fully connected graph: Programming Laungauge Assignment, UCSI, Malaysia
- pipe branch system that is used to deliver water. The cross-sectional areas for pipes A and B are 0.00785 m2 and 0.00283 m2 respectively: Fluid Mechanics Assignment, UM, Malaysia
- You are asked to develop a program for Mobile Soft Inc. to calculate the year-end promotion price that should be paid by its customers: Programming Assignment, HU, Malaysia
- There will be activities administered throughout the semester at any time during lectures or tutorials: Psychology Assignment, MUM, Malaysia
- TMF1414: Your task is to develop a room reservation system for My Vacation Hotel The room tariff for this hotel is given in the table below: Programming Assignment, UNIMAS, Malaysia
- Naval Collaboration is very important to our country in facing various threats both internally and externally: Naval collabration Essay, MUM, Malaysia
- UECM1534: The file “Sports Sales.csv” contains data on the sales of products by sports companies around the world. Write a Python script that performs the following tasks in the given order: Programming Techniques for Data Processing Assignment, NUM, Malaysia
- TSE3173: Within the time allocated, your groups are required to design the following site elements and integrate them into a functional website: Web Application Coursework, KPTM, Malaysia
- Electrons or holes arc moved between two contacts by drift current in a Field Effect Transistor: Enginnering Assignment, UMP, Malaysia
