Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
1.THE BANKER'S ALGORITHM FOR A SINGLE RESOURCE o It is modeled on the way a small-town banker might deal with a group of customers to whom he has granted lines of credit. What the algorithm does is check to see if granting the request leads to an unsafe state. If it does, the request is denied. If granting the request leads to a safe state, it is carried out. In Fig. (a) we see four customers. A, B, C and D, each of whom has been granted a certain number of credit units. The banker knows that not all customers will need their maximum credit immediately, so he has reserved only 10 units rather than 22 to service them. (In this analogy, customers are processes, units are, say, tape drives, and the banker is the operating system.) Has Max 0 6 05 0 4 0 7 Free: 10 Free: 2 (a) (b) cation states: (a) Safe. (b) Safe (c) Unsafe. A B C D Has Max A B 1 C 2 D 4 1 65 4 7 A30 B Has Max 6 5 4 4 7 <-1 2 C 2 D Free: 1 (c)

1.THE BANKER'S ALGORITHM FOR A SINGLE RESOURCE o It is modeled on the way a small-town banker might deal with a group of customers to whom he has granted lines of credit. What the algorithm does is check to see if granting the request leads to an unsafe state. If it does, the request is denied. If granting the request leads to a safe state, it is carried out. In Fig. (a) we see four customers. A, B, C and D, each of whom has been granted a certain number of credit units. The banker knows that not all customers will need their maximum credit immediately, so he has reserved only 10 units rather than 22 to service them. (In this analogy, customers are processes, units are, say, tape drives, and the banker is the operating system.) Has Max 0 6 05 0 4 0 7 Free: 10 Free: 2 (a) (b) cation states: (a) Safe. (b) Safe (c) Unsafe. A B C D Has Max A B 1 C 2 D 4 1 65 4 7 A30 B Has Max 6 5 4 4 7 <-1 2 C 2 D Free: 1 (c)

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
Operating systems How to calculate the safe and unsafe state of this figure a,b,c What step I should do first then and short cut calculation o?
1.THE BANKER'S ALGORITHM FOR A SINGLE RESOURCE o It is modeled on the way a small-town banker might deal with a group of customers to whom he has granted lines of credit. What the algorithm does is check to see if granting the request leads to an unsafe state. If it does, the request is denied. If granting the request leads to a safe state, it is carried out. In Fig. (a) we see four customers. A, B, C and D, each of whom has been granted a ceain number of credit units. The banker knows that not all customers will need their maximum credit immediately, so he has reserved only 10 units rather than 22 to service them. (In this analogy, customers are processes, units are, say, tape drives, and the banker is the operating system.) A B C D Has Max 0 6 0 5 0 4 0 7 A B C D Has Max 1 6 5 4 7 = 1 2 4 Free: 10 Free: 2 (a) (b) cation states: (a) Safe. (b) Safe (c) Unsafe. A BUD Has Max 1 6 2 5 2 4 4 7 Free: 1 Ⓒ 38
Transcribed Image Text:1.THE BANKER'S ALGORITHM FOR A SINGLE RESOURCE o It is modeled on the way a small-town banker might deal with a group of customers to whom he has granted lines of credit. What the algorithm does is check to see if granting the request leads to an unsafe state. If it does, the request is denied. If granting the request leads to a safe state, it is carried out. In Fig. (a) we see four customers. A, B, C and D, each of whom has been granted a ceain number of credit units. The banker knows that not all customers will need their maximum credit immediately, so he has reserved only 10 units rather than 22 to service them. (In this analogy, customers are processes, units are, say, tape drives, and the banker is the operating system.) A B C D Has Max 0 6 0 5 0 4 0 7 A B C D Has Max 1 6 5 4 7 = 1 2 4 Free: 10 Free: 2 (a) (b) cation states: (a) Safe. (b) Safe (c) Unsafe. A BUD Has Max 1 6 2 5 2 4 4 7 Free: 1 Ⓒ 38
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Maintenance
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS