Suche senden
Hochladen
ch7.ppt
•
Als PPT, PDF herunterladen
•
0 gefällt mir
•
7 views
K
KamranAli649587
Folgen
OS lecture
Weniger lesen
Mehr lesen
Business
Melden
Teilen
Melden
Teilen
1 von 48
Jetzt herunterladen
Empfohlen
Deadlock in OS
Deadlock in OS
KioRox
deadlock.pptx
deadlock.pptx
VishnuDubey14
ch7- Deadlock.ppt
ch7- Deadlock.ppt
Hiteshchauhan84
ch7.ppt
ch7.ppt
DrMajidMumtaz
Galvin Operating Systems of deadlock.ppt
Galvin Operating Systems of deadlock.ppt
ranjithasr8
ch7.ppt
ch7.ppt
Sami Mughal
MPMC chapter
MPMC chapter
subhamsriramka
ch7Deadlock.ppt
ch7Deadlock.ppt
FamilyAdmin
Empfohlen
Deadlock in OS
Deadlock in OS
KioRox
deadlock.pptx
deadlock.pptx
VishnuDubey14
ch7- Deadlock.ppt
ch7- Deadlock.ppt
Hiteshchauhan84
ch7.ppt
ch7.ppt
DrMajidMumtaz
Galvin Operating Systems of deadlock.ppt
Galvin Operating Systems of deadlock.ppt
ranjithasr8
ch7.ppt
ch7.ppt
Sami Mughal
MPMC chapter
MPMC chapter
subhamsriramka
ch7Deadlock.ppt
ch7Deadlock.ppt
FamilyAdmin
Deadlock : operating system ( BTECH CSE )
Deadlock : operating system ( BTECH CSE )
HimanshuSharma1389
Deadlocks
Deadlocks
ssuser351f7b
Deadlocks
Deadlocks
SyedTalhaBukhari2
Ch8
Ch8
Bilal Arshad
Chapter 7
Chapter 7
Amin Omi
Lecture # 10-11 for deadlock operating system.ppt
Lecture # 10-11 for deadlock operating system.ppt
RiaanSadiq
7.Dead Locks
7.Dead Locks
Senthil Kanth
An brief introduction to Deadlocks in OS
An brief introduction to Deadlocks in OS
RaviKiranVarma4
Galvin-operating System(Ch8)
Galvin-operating System(Ch8)
dsuyal1
Ch7
Ch7
YoungGun Na
Ch7
Ch7
YoungGun Na
Chapter 8 Operating Systems silberschatz : deadlocks
Chapter 8 Operating Systems silberschatz : deadlocks
GiulianoRanauro
ch07.pdf
ch07.pdf
sharada3
Ch8: Deadlocks
Ch8: Deadlocks
Ahmar Hashmi
Chapter 6
Chapter 6
Ahmad Alarbeed
Mca ii os u-3 dead lock & io systems
Mca ii os u-3 dead lock & io systems
Rai University
05-Process-Synchronization.pdf
05-Process-Synchronization.pdf
milisjojo
Process Synchronisation Operating System
Process Synchronisation Operating System
DRAnithaSofiaLizCSES
ch8.pptx
ch8.pptx
AnkitaVerma776806
5 process synchronization
5 process synchronization
BaliThorat1
UNIT-2-liang-barsky-clipping-algorithm-KM.pdf
UNIT-2-liang-barsky-clipping-algorithm-KM.pdf
KamranAli649587
Data design and analysis of computing tools
Data design and analysis of computing tools
KamranAli649587
Weitere ähnliche Inhalte
Ähnlich wie ch7.ppt
Deadlock : operating system ( BTECH CSE )
Deadlock : operating system ( BTECH CSE )
HimanshuSharma1389
Deadlocks
Deadlocks
ssuser351f7b
Deadlocks
Deadlocks
SyedTalhaBukhari2
Ch8
Ch8
Bilal Arshad
Chapter 7
Chapter 7
Amin Omi
Lecture # 10-11 for deadlock operating system.ppt
Lecture # 10-11 for deadlock operating system.ppt
RiaanSadiq
7.Dead Locks
7.Dead Locks
Senthil Kanth
An brief introduction to Deadlocks in OS
An brief introduction to Deadlocks in OS
RaviKiranVarma4
Galvin-operating System(Ch8)
Galvin-operating System(Ch8)
dsuyal1
Ch7
Ch7
YoungGun Na
Ch7
Ch7
YoungGun Na
Chapter 8 Operating Systems silberschatz : deadlocks
Chapter 8 Operating Systems silberschatz : deadlocks
GiulianoRanauro
ch07.pdf
ch07.pdf
sharada3
Ch8: Deadlocks
Ch8: Deadlocks
Ahmar Hashmi
Chapter 6
Chapter 6
Ahmad Alarbeed
Mca ii os u-3 dead lock & io systems
Mca ii os u-3 dead lock & io systems
Rai University
05-Process-Synchronization.pdf
05-Process-Synchronization.pdf
milisjojo
Process Synchronisation Operating System
Process Synchronisation Operating System
DRAnithaSofiaLizCSES
ch8.pptx
ch8.pptx
AnkitaVerma776806
5 process synchronization
5 process synchronization
BaliThorat1
Ähnlich wie ch7.ppt
(20)
Deadlock : operating system ( BTECH CSE )
Deadlock : operating system ( BTECH CSE )
Deadlocks
Deadlocks
Deadlocks
Deadlocks
Ch8
Ch8
Chapter 7
Chapter 7
Lecture # 10-11 for deadlock operating system.ppt
Lecture # 10-11 for deadlock operating system.ppt
7.Dead Locks
7.Dead Locks
An brief introduction to Deadlocks in OS
An brief introduction to Deadlocks in OS
Galvin-operating System(Ch8)
Galvin-operating System(Ch8)
Ch7
Ch7
Ch7
Ch7
Chapter 8 Operating Systems silberschatz : deadlocks
Chapter 8 Operating Systems silberschatz : deadlocks
ch07.pdf
ch07.pdf
Ch8: Deadlocks
Ch8: Deadlocks
Chapter 6
Chapter 6
Mca ii os u-3 dead lock & io systems
Mca ii os u-3 dead lock & io systems
05-Process-Synchronization.pdf
05-Process-Synchronization.pdf
Process Synchronisation Operating System
Process Synchronisation Operating System
ch8.pptx
ch8.pptx
5 process synchronization
5 process synchronization
Mehr von KamranAli649587
UNIT-2-liang-barsky-clipping-algorithm-KM.pdf
UNIT-2-liang-barsky-clipping-algorithm-KM.pdf
KamranAli649587
Data design and analysis of computing tools
Data design and analysis of computing tools
KamranAli649587
graphs data structure and algorithm link list
graphs data structure and algorithm link list
KamranAli649587
lecture10 date structure types of graph and terminology
lecture10 date structure types of graph and terminology
KamranAli649587
Encoder-and-decoder.pptx
Encoder-and-decoder.pptx
KamranAli649587
Radio propagation model...pptx
Radio propagation model...pptx
KamranAli649587
Loops_and_FunctionsWeek4_0.ppt
Loops_and_FunctionsWeek4_0.ppt
KamranAli649587
Lecture+06-TypesVars.ppt
Lecture+06-TypesVars.ppt
KamranAli649587
C++InputOutput.PPT
C++InputOutput.PPT
KamranAli649587
radiopropagation-140328202308-phpapp01.pdf
radiopropagation-140328202308-phpapp01.pdf
KamranAli649587
cluster.pptx
cluster.pptx
KamranAli649587
Week11-EvaluationMethods.ppt
Week11-EvaluationMethods.ppt
KamranAli649587
Week6-Sectionsofapaper.ppt
Week6-Sectionsofapaper.ppt
KamranAli649587
null-13.pdf
null-13.pdf
KamranAli649587
Reaches
Reaches
KamranAli649587
null-6.pdf
null-6.pdf
KamranAli649587
null-1.pptx
null-1.pptx
KamranAli649587
Lect-01.ppt
Lect-01.ppt
KamranAli649587
Db_05.ppt
Db_05.ppt
KamranAli649587
lect09.ppt
lect09.ppt
KamranAli649587
Mehr von KamranAli649587
(20)
UNIT-2-liang-barsky-clipping-algorithm-KM.pdf
UNIT-2-liang-barsky-clipping-algorithm-KM.pdf
Data design and analysis of computing tools
Data design and analysis of computing tools
graphs data structure and algorithm link list
graphs data structure and algorithm link list
lecture10 date structure types of graph and terminology
lecture10 date structure types of graph and terminology
Encoder-and-decoder.pptx
Encoder-and-decoder.pptx
Radio propagation model...pptx
Radio propagation model...pptx
Loops_and_FunctionsWeek4_0.ppt
Loops_and_FunctionsWeek4_0.ppt
Lecture+06-TypesVars.ppt
Lecture+06-TypesVars.ppt
C++InputOutput.PPT
C++InputOutput.PPT
radiopropagation-140328202308-phpapp01.pdf
radiopropagation-140328202308-phpapp01.pdf
cluster.pptx
cluster.pptx
Week11-EvaluationMethods.ppt
Week11-EvaluationMethods.ppt
Week6-Sectionsofapaper.ppt
Week6-Sectionsofapaper.ppt
null-13.pdf
null-13.pdf
Reaches
Reaches
null-6.pdf
null-6.pdf
null-1.pptx
null-1.pptx
Lect-01.ppt
Lect-01.ppt
Db_05.ppt
Db_05.ppt
lect09.ppt
lect09.ppt
Kürzlich hochgeladen
Organizational Transformation Lead with Culture
Organizational Transformation Lead with Culture
Seta Wicaksana
VVVIP Call Girls In Greater Kailash ➡️ Delhi ➡️ 9999965857 🚀 No Advance 24HRS...
VVVIP Call Girls In Greater Kailash ➡️ Delhi ➡️ 9999965857 🚀 No Advance 24HRS...
Call Girls In Delhi Whatsup 9873940964 Enjoy Unlimited Pleasure
Value Proposition canvas- Customer needs and pains
Value Proposition canvas- Customer needs and pains
P&CO
Russian Call Girls In Gurgaon ❤️8448577510 ⊹Best Escorts Service In 24/7 Delh...
Russian Call Girls In Gurgaon ❤️8448577510 ⊹Best Escorts Service In 24/7 Delh...
lizamodels9
FULL ENJOY Call Girls In Majnu Ka Tilla, Delhi Contact Us 8377877756
FULL ENJOY Call Girls In Majnu Ka Tilla, Delhi Contact Us 8377877756
dollysharma2066
The Coffee Bean & Tea Leaf(CBTL), Business strategy case study
The Coffee Bean & Tea Leaf(CBTL), Business strategy case study
Ethan lee
Enhancing and Restoring Safety & Quality Cultures - Dave Litwiller - May 2024...
Enhancing and Restoring Safety & Quality Cultures - Dave Litwiller - May 2024...
Dave Litwiller
Insurers' journeys to build a mastery in the IoT usage
Insurers' journeys to build a mastery in the IoT usage
Matteo Carbone
Best VIP Call Girls Noida Sector 40 Call Me: 8448380779
Best VIP Call Girls Noida Sector 40 Call Me: 8448380779
Delhi Call girls
Call Girls Jp Nagar Just Call 👗 7737669865 👗 Top Class Call Girl Service Bang...
Call Girls Jp Nagar Just Call 👗 7737669865 👗 Top Class Call Girl Service Bang...
amitlee9823
Dr. Admir Softic_ presentation_Green Club_ENG.pdf
Dr. Admir Softic_ presentation_Green Club_ENG.pdf
Admir Softic
KYC-Verified Accounts: Helping Companies Handle Challenging Regulatory Enviro...
KYC-Verified Accounts: Helping Companies Handle Challenging Regulatory Enviro...
Any kyc Account
It will be International Nurses' Day on 12 May
It will be International Nurses' Day on 12 May
NZSG
How to Get Started in Social Media for Art League City
How to Get Started in Social Media for Art League City
Eric T. Tung
Grateful 7 speech thanking everyone that has helped.pdf
Grateful 7 speech thanking everyone that has helped.pdf
Paul Menig
Call Girls Electronic City Just Call 👗 7737669865 👗 Top Class Call Girl Servi...
Call Girls Electronic City Just Call 👗 7737669865 👗 Top Class Call Girl Servi...
amitlee9823
John Halpern sued for sexual assault.pdf
John Halpern sued for sexual assault.pdf
AmzadHosen3
Yaroslav Rozhankivskyy: Три складові і три передумови максимальної продуктивн...
Yaroslav Rozhankivskyy: Три складові і три передумови максимальної продуктивн...
Lviv Startup Club
B.COM Unit – 4 ( CORPORATE SOCIAL RESPONSIBILITY ( CSR ).pptx
B.COM Unit – 4 ( CORPORATE SOCIAL RESPONSIBILITY ( CSR ).pptx
priyanshujha201
Regression analysis: Simple Linear Regression Multiple Linear Regression
Regression analysis: Simple Linear Regression Multiple Linear Regression
Ravindra Nath Shukla
Kürzlich hochgeladen
(20)
Organizational Transformation Lead with Culture
Organizational Transformation Lead with Culture
VVVIP Call Girls In Greater Kailash ➡️ Delhi ➡️ 9999965857 🚀 No Advance 24HRS...
VVVIP Call Girls In Greater Kailash ➡️ Delhi ➡️ 9999965857 🚀 No Advance 24HRS...
Value Proposition canvas- Customer needs and pains
Value Proposition canvas- Customer needs and pains
Russian Call Girls In Gurgaon ❤️8448577510 ⊹Best Escorts Service In 24/7 Delh...
Russian Call Girls In Gurgaon ❤️8448577510 ⊹Best Escorts Service In 24/7 Delh...
FULL ENJOY Call Girls In Majnu Ka Tilla, Delhi Contact Us 8377877756
FULL ENJOY Call Girls In Majnu Ka Tilla, Delhi Contact Us 8377877756
The Coffee Bean & Tea Leaf(CBTL), Business strategy case study
The Coffee Bean & Tea Leaf(CBTL), Business strategy case study
Enhancing and Restoring Safety & Quality Cultures - Dave Litwiller - May 2024...
Enhancing and Restoring Safety & Quality Cultures - Dave Litwiller - May 2024...
Insurers' journeys to build a mastery in the IoT usage
Insurers' journeys to build a mastery in the IoT usage
Best VIP Call Girls Noida Sector 40 Call Me: 8448380779
Best VIP Call Girls Noida Sector 40 Call Me: 8448380779
Call Girls Jp Nagar Just Call 👗 7737669865 👗 Top Class Call Girl Service Bang...
Call Girls Jp Nagar Just Call 👗 7737669865 👗 Top Class Call Girl Service Bang...
Dr. Admir Softic_ presentation_Green Club_ENG.pdf
Dr. Admir Softic_ presentation_Green Club_ENG.pdf
KYC-Verified Accounts: Helping Companies Handle Challenging Regulatory Enviro...
KYC-Verified Accounts: Helping Companies Handle Challenging Regulatory Enviro...
It will be International Nurses' Day on 12 May
It will be International Nurses' Day on 12 May
How to Get Started in Social Media for Art League City
How to Get Started in Social Media for Art League City
Grateful 7 speech thanking everyone that has helped.pdf
Grateful 7 speech thanking everyone that has helped.pdf
Call Girls Electronic City Just Call 👗 7737669865 👗 Top Class Call Girl Servi...
Call Girls Electronic City Just Call 👗 7737669865 👗 Top Class Call Girl Servi...
John Halpern sued for sexual assault.pdf
John Halpern sued for sexual assault.pdf
Yaroslav Rozhankivskyy: Три складові і три передумови максимальної продуктивн...
Yaroslav Rozhankivskyy: Три складові і три передумови максимальної продуктивн...
B.COM Unit – 4 ( CORPORATE SOCIAL RESPONSIBILITY ( CSR ).pptx
B.COM Unit – 4 ( CORPORATE SOCIAL RESPONSIBILITY ( CSR ).pptx
Regression analysis: Simple Linear Regression Multiple Linear Regression
Regression analysis: Simple Linear Regression Multiple Linear Regression
ch7.ppt
1.
7.1 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Chapter 7: Deadlocks
2.
7.2 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Chapter 7: Deadlocks The Deadlock Problem System Model Deadlock Characterization Methods for Handling Deadlocks Deadlock Prevention Deadlock Avoidance Deadlock Detection Recovery from Deadlock
3.
7.3 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Chapter Objectives To develop a description of deadlocks, which prevent sets of concurrent processes from completing their tasks To present a number of different methods for preventing or avoiding deadlocks in a computer system
4.
7.4 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition The Deadlock Problem A set of blocked processes each holding a resource and waiting to acquire a resource held by another process in the set Example System has 2 disk drives P1 and P2 each hold one disk drive and each needs another one Example semaphores A and B, initialized to 1 P0 P1 wait (A); wait(B)wait (B); wait(A)
5.
7.5 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Bridge Crossing Example Traffic only in one direction Each section of a bridge can be viewed as a resource If a deadlock occurs, it can be resolved if one car backs up (preempt resources and rollback) Several cars may have to be backed up if a deadlock occurs Starvation is possible Note – Most OSes do not prevent or deal with deadlocks
6.
7.6 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition System Model Resource types R1, R2, . . ., Rm CPU cycles, memory space, I/O devices Each resource type Ri has Wi instances Each process utilizes a resource as follows: request use release
7.
7.7 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Deadlock Characterization Mutual exclusion: only one process at a time can use a resource Hold and wait: a process holding at least one resource is waiting to acquire additional resources held by other processes No preemption: a resource can be released only voluntarily by the process holding it, after that process has completed its task Circular wait: there exists a set {P0, P1, …, Pn} of waiting processes such that P0 is waiting for a resource that is held by P1, P1 is waiting for a resource that is held by P2, …, Pn–1 is waiting for a resource that is held by Pn, and Pn is waiting for a resource that is held by P0 Deadlock can arise if four conditions hold simultaneously.
8.
7.8 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Resource-Allocation Graph V is partitioned into two types: P = {P1, P2, …, Pn}, the set consisting of all the processes in the system R = {R1, R2, …, Rm}, the set consisting of all resource types in the system request edge – directed edge Pi Rj assignment edge – directed edge Rj Pi A set of vertices V and a set of edges E
9.
7.9 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Resource-Allocation Graph (Cont.) Process Resource Type with 4 instances Pi requests instance of Rj Pi is holding an instance of Rj Pi Pi Rj Rj
10.
7.10 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Example of a Resource Allocation Graph
11.
7.11 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Resource Allocation Graph With A Deadlock
12.
7.12 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Graph With A Cycle But No Deadlock
13.
7.13 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Basic Facts If graph contains no cycles no deadlock If graph contains a cycle if only one instance per resource type, then deadlock if several instances per resource type, possibility of deadlock
14.
7.14 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Java Deadlock Example Thread A Thread B
15.
7.15 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Java Deadlock Example Deadlock is possible if: threadA -> lockY -> threadB -> lockX -> threadA
16.
7.16 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Handling Deadlocks in Java
17.
7.17 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Handling Deadlocks in Java
18.
7.18 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Methods for Handling Deadlocks Ensure that the system will never enter a deadlock state Allow the system to enter a deadlock state and then recover Ignore the problem and pretend that deadlocks never occur in the system; used by most operating systems, including UNIX
19.
7.19 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Deadlock Prevention Mutual Exclusion – not required for sharable resources; must hold for nonsharable resources Hold and Wait – must guarantee that whenever a process requests a resource, it does not hold any other resources Require process to request and be allocated all its resources before it begins execution, or allow process to request resources only when the process has none Low resource utilization; starvation possible Restrain the ways request can be made
20.
7.20 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Deadlock Prevention (Cont.) No Preemption – If a process that is holding some resources requests another resource that cannot be immediately allocated to it, then all resources currently being held are released Preempted resources are added to the list of resources for which the process is waiting Process will be restarted only when it can regain its old resources, as well as the new ones that it is requesting Circular Wait – impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration
21.
7.21 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Deadlock Avoidance Simplest and most useful model requires that each process declare the maximum number of resources of each type that it may need. The deadlock-avoidance algorithm dynamically examines the resource-allocation state to ensure that there can never be a circular-wait condition. Resource-allocation state is defined by the number of available and allocated resources, and the maximum demands of the processes. Requires that the system has some additional a priori information available.
22.
7.22 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Safe State When a process requests an available resource, system must decide if immediate allocation leaves the system in a safe state. System is in safe state if there exists a sequence <P1, P2, …, Pn> of ALL the processes is the systems such that for each Pi, the resources that Pi can still request can be satisfied by currently available resources + resources held by all the Pj, with j < I That is: If Pi resource needs are not immediately available, then Pi can wait until all Pj have finished. When Pj is finished, Pi can obtain needed resources, execute, return allocated resources, and terminate. When Pi terminates, Pi +1 can obtain its needed resources, and so on.
23.
7.23 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Basic Facts If a system is in safe state no deadlocks If a system is in unsafe state possibility of deadlock Avoidance ensure that a system will never enter an unsafe state.
24.
7.24 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Safe, Unsafe , Deadlock State
25.
7.25 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Avoidance algorithms Single instance of a resource type Use a resource-allocation graph Multiple instances of a resource type Use the banker’s algorithm
26.
7.26 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Resource-Allocation Graph Scheme Claim edge Pi Rj indicated that process Pj may request resource Rj; represented by a dashed line Claim edge converts to request edge when a process requests a resource Request edge converted to an assignment edge when the resource is allocated to the process When a resource is released by a process, assignment edge reconverts to a claim edge Resources must be claimed a priori in the system
27.
7.27 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Resource-Allocation Graph
28.
7.28 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Unsafe State In Resource-Allocation Graph
29.
7.29 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Resource-Allocation Graph Algorithm Suppose that process Pi requests a resource Rj The request can be granted only if converting the request edge to an assignment edge does not result in the formation of a cycle in the resource allocation graph
30.
7.30 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Banker’s Algorithm Multiple instances Each process must a priori claim maximum use When a process requests a resource it may have to wait When a process gets all its resources it must return them in a finite amount of time
31.
7.31 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Data Structures for the Banker’s Algorithm Available: Vector of length m. If available [j] = k, there are k instances of resource type Rj available Max: n x m matrix. If Max [i,j] = k, then process Pi may request at most k instances of resource type Rj Allocation: n x m matrix. If Allocation[i,j] = k then Pi is currently allocated k instances of Rj Need: n x m matrix. If Need[i,j] = k, then Pi may need k more instances of Rj to complete its task Need [i,j] = Max[i,j] – Allocation [i,j] Let n = number of processes, and m = number of resources types.
32.
7.32 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Safety Algorithm 1. Let Work and Finish be vectors of length m and n, respectively. Initialize: Work = Available Finish [i] = false for i = 0, 1, …, n- 1 2. Find and i such that both: (a) Finish [i] = false (b) Needi Work If no such i exists, go to step 4 3. Work = Work + Allocationi Finish[i] = true go to step 2 4. If Finish [i] == true for all i, then the system is in a safe state
33.
7.33 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Resource-Request Algorithm for Process Pi Request = request vector for process Pi. If Requesti [j] = k then process Pi wants k instances of resource type Rj 1. If Requesti Needi go to step 2. Otherwise, raise error condition, since process has exceeded its maximum claim 2. If Requesti Available, go to step 3. Otherwise Pi must wait, since resources are not available 3. Pretend to allocate requested resources to Pi by modifying the state as follows: Available = Available – Request; Allocationi = Allocationi + Requesti; Needi = Needi – Requesti; If safe the resources are allocated to Pi If unsafe Pi must wait, and the old resource-allocation state is restored
34.
7.34 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Example of Banker’s Algorithm 5 processes P0 through P4; 3 resource types: A (10 instances), B (5instances), and C (7 instances) Snapshot at time T0: Allocation Max Available A B C A B C A B C P0 0 1 0 7 5 3 3 3 2 P1 2 0 0 3 2 2 P2 3 0 2 9 0 2 P3 2 1 1 2 2 2 P4 0 0 2 4 3 3
35.
7.35 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Example (Cont.) The content of the matrix Need is defined to be Max – Allocation Need A B C P0 7 4 3 P1 1 2 2 P2 6 0 0 P3 0 1 1 P4 4 3 1 The system is in a safe state since the sequence < P1, P3, P4, P2, P0> satisfies safety criteria
36.
7.36 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Example: P1 Request (1,0,2) Check that Request Available (that is, (1,0,2) (3,3,2) true Allocation Need Available A B C A B C A B C P0 0 1 0 7 4 3 2 3 0 P1 3 0 2 0 2 0 P2 3 0 1 6 0 0 P3 2 1 1 0 1 1 P4 0 0 2 4 3 1 Executing safety algorithm shows that sequence < P1, P3, P4, P0, P2> satisfies safety requirement Can request for (3,3,0) by P4 be granted? Can request for (0,2,0) by P0 be granted?
37.
7.37 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Deadlock Detection Allow system to enter deadlock state Detection algorithm Recovery scheme
38.
7.38 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Single Instance of Each Resource Type Maintain wait-for graph Nodes are processes Pi Pj if Pi is waiting for Pj Periodically invoke an algorithm that searches for a cycle in the graph. If there is a cycle, there exists a deadlock An algorithm to detect a cycle in a graph requires an order of n2 operations, where n is the number of vertices in the graph
39.
7.39 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Resource-Allocation Graph and Wait-for Graph Resource-Allocation Graph Corresponding wait-for graph
40.
7.40 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Several Instances of a Resource Type Available: A vector of length m indicates the number of available resources of each type. Allocation: An n x m matrix defines the number of resources of each type currently allocated to each process. Request: An n x m matrix indicates the current request of each process. If Request [ij] = k, then process Pi is requesting k more instances of resource type. Rj.
41.
7.41 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Detection Algorithm 1. Let Work and Finish be vectors of length m and n, respectively Initialize: (a) Work = Available (b) For i = 1,2, …, n, if Allocationi 0, then Finish[i] = false;otherwise, Finish[i] = true 2. Find an index i such that both: (a) Finish[i] == false (b) Requesti Work If no such i exists, go to step 4
42.
7.42 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Detection Algorithm (Cont.) 3. Work = Work + Allocationi Finish[i] = true go to step 2 4. If Finish[i] == false, for some i, 1 i n, then the system is in deadlock state. Moreover, if Finish[i] == false, then Pi is deadlocked Algorithm requires an order of O(m x n2) operations to detect whether the system is in deadlocked state
43.
7.43 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Example of Detection Algorithm Five processes P0 through P4; three resource types A (7 instances), B (2 instances), and C (6 instances) Snapshot at time T0: Allocation Request Available A B C A B C A B C P0 0 1 0 0 0 0 0 0 0 P1 2 0 0 2 0 2 P2 3 0 3 0 0 0 P3 2 1 1 1 0 0 P4 0 0 2 0 0 2 Sequence <P0, P2, P3, P1, P4> will result in Finish[i] = true for all i
44.
7.44 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Example (Cont.) P2 requests an additional instance of type C Request A B C P0 0 0 0 P1 2 0 1 P2 0 0 1 P3 1 0 0 P4 0 0 2 State of system? Can reclaim resources held by process P0, but insufficient resources to fulfill other processes; requests Deadlock exists, consisting of processes P1, P2, P3, and P4
45.
7.45 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Detection-Algorithm Usage When, and how often, to invoke depends on: How often a deadlock is likely to occur? How many processes will need to be rolled back? one for each disjoint cycle If detection algorithm is invoked arbitrarily, there may be many cycles in the resource graph and so we would not be able to tell which of the many deadlocked processes “caused” the deadlock.
46.
7.46 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Recovery from Deadlock: Process Termination Abort all deadlocked processes Abort one process at a time until the deadlock cycle is eliminated In which order should we choose to abort? Priority of the process How long process has computed, and how much longer to completion Resources the process has used Resources process needs to complete How many processes will need to be terminated Is process interactive or batch?
47.
7.47 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition Recovery from Deadlock: Resource Preemption Selecting a victim – minimize cost Rollback – return to some safe state, restart process for that state Starvation – same process may always be picked as victim, include number of rollback in cost factor
48.
7.48 Silberschatz, Galvin
and Gagne ©2009 Operating System Concepts with Java – 8th Edition End of Chapter 7
Jetzt herunterladen