1.) Part A (10): Develop a solution for the Dining Philosopher’s problem using AND-Synchronization (i.e., Parallel Semaphores SP and SV). Write the pseudocode for the philosopher processes. 2.) Part B (15): Consider the Readers-Writers Problem with Reader Priority. Suppose that the database is designed such that it can accommodate at most seven (7) concurrent readers active in the database. Develop a Monitor solution that solves the Readers-Writers Problem with the additional constraint of a maximum of 7 concurrent readers. You will have to write the monitor functions “start_read()”, “end_read()”, “start_write()”, and “end_write().” You must provide the pseudo-code for the Monitor procedures listed above, any condition or status variables used. Also include the pseudo-code of any additional helper procedures if your solution requires them. You must also write the pseudo-code for the Reader and Writer processes that use your monitor solution.
1.) Part A (10): Develop a solution for the Dining Philosopher’s problem using AND-Synchronization (i.e., Parallel Semaphores SP and SV). Write the pseudocode for the philosopher processes.
2.)
Part B (15): Consider the Readers-Writers Problem with Reader Priority. Suppose that the
You will have to write the monitor functions “start_read()”, “end_read()”, “start_write()”, and “end_write().”
You must provide the pseudo-code for the Monitor procedures listed above, any condition or status variables used. Also include the pseudo-code of any additional helper procedures if your solution requires them. You must also write the pseudo-code for the Reader and Writer processes that use your monitor solution.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
