Implement the bankers algorithm for deadlock avoidance

Reference no: EM133440902

Banker's algorithm

Implement the Bankers algorithm for deadlock avoidance, with a given set of N processes (N<10, processes are P1, P2, ..., PN) and M resource types (M<10, resources are R1, R2, ..., RM). Use Java or C/C++ for the implementation, with a simple interface, where the user only supplies the name of the input file (text file, say "input.txt"). The program reads all the necessary input data from that file. You are free to choose the format of the input file, just make sure it contains all the necessary data. The input data and the result of the algorithm must be displayed on the screen.

The pseudo code for the Greedy version for the Banker's algorithm can be found in this module's Commentary. We know that this algorithm only finds ONE solution (safe sequence of processes) assuming there is one; otherwise reports there is no solution.

You must adjust this algorithm to find exactly TWO solutions instead of just one (assuming of course there are at least two solutions). If the algorithm only has one solution this must be reported as such and the single solution must be displayed.

To resume, there are only three possible scenarios, for a correct input file:

1. There is no solution (no safe sequence). The program must report there is no solution.

2. There is EXACTLY ONE solution (safe sequence). The program must report there is exactly one solution. The solution must be displayed on screen.

3. There are TWO OR MORE solutions (safe sequences). The program must find EXACTLY TWO solutions. The solutions must be displayed on screen. If there are more than two solutions, it doesn't matter which ones are found, as long as they are exactly two.

Note 1: the solution must be based on the Greedy version for the Banker's algorithm; in particular, using an approach for finding ALL solutions and then keeping and reporting just two of them is NOT allowed.

Note 2: The input file may be incorrect, for various reasons. This must be checked and reported by your program before any attempt of finding a solution.

Reference no: EM133440902

Questions Cloud

What code set represents inpatient procedures : We use the UB04 form for inpatient hospital facility coding, but which codes do we use to identify the procedures that were done? What code set represents

What is the dsm 5-tr diagnosis based on the information : Summarize the clinical case. What is the DSM 5-TR diagnosis based on the information provided in the case? Which pharmacological treatment would you prescribe

Describe what leadership and management theories align with : Describe what leadership and management theories align with your leadership style. Based on your leadership style, discuss the type of work environment

Discuss reasons for healthcare professional turnover : discuss reasons for healthcare professional turnover and costs of turnover and strategies for increasing retention and preventing turnover.

Implement the bankers algorithm for deadlock avoidance : CMSC 412 Operating Systems, Implement the Bankers algorithm for deadlock avoidance, with a given set of N processes (N

How will knowledge about health care providers allow : How will knowledge about health care providers allow you to properly bill and code common gastrointestinal diseases? Provide details and support your responses

Discuss three to five competencies that you feel : Discuss three to five competencies that you feel you still need to work on. How do you plan to integrate this knowledge into developing your comprehensive

Discuss each step with the goal of providing quality care : Discuss each step with the goal of providing quality care. Use critical thinking skills and be outcome focused.

Review the four recommendations in the iom report the future : Review the four recommendations in the IOM report The Future of Nursing: Leading Change, Advancing Health and find your state's (Texas)_ action coalition.

User Account

All Pages