Understanding Operating Systems Chapter 5 Process

Management
Study online at quizlet.com/_713mbk

1. Avoidance: Avoid deadlock if it becomes probable. Avoid going 16. Seven Cases of Deadlock: 1. File Requests
into an unsafe state. Always be able to satisfy the maximum 2. Databases
request of at least on process. 3. Dedicated Device Allocation
2. Circular wait: Each process involved in deadlock waiting for 4. Multiple Device Allocation
each other to release requested resources. 5. Spooling
6. Network
3. Deadlock: When two or more processes request a resource that
7. Disk Sharing
is allocated to each other resulting in neither process being
able to complete. Occurs when nonshareable, 17. Spooling: When a device accepts output form multiple process
nonpreemptable are allocated. and stores it in a temporary area until it can be processed.
4. Detection: Detect deadlock when it occurs and recover from it. 18. Starvation: A job never finishes because it is always waiting for
Look for cycles resources which never become available.
5. Directed Graphs: Used to model deadlock. 19. Unsafe state: the result of conservative allocation of resources
Circles: Processes in which a single job is prevented from execution because it's
Squares: Resources kept waiting for resources that never become available.
Solid line: Resource held by process 20. Victim: an expendable job that is selected for removal from a
Dashed Line: Process is waiting for resource. deadlocked system to provide more resources to the waiting
Cycle indicates deadlock jobs and resolve the deadlock.
6. Livelock: The allocation and de-allocation of resources to
process resulting in neither being able to progress
7. Locking: A technique used to guarantee the integrity of the data
through which the user locks out all other users while working
with the database. Levels: database, subsection,record.
8. Mutual Exclusion: The act of allowing only one process to have
access to a dedicated resource.
9. No Preemption: The lack of temporary reallocation
10. Prevention: Prevent one of the four necessary conditions of
deadlock form occurring. A job requests all resource
necessary for completion. Save jobs and deallocate resources.
Number resources and force jobs to request them in ascending
order.
11. Process Synchronization: 1 the need for algorithms to resolve
conflicts between processors in a multiprocessing environment
2 the need to ensure that events occur in the proper order
even if they are carried out by several processes.
A lack of can result in deadlock and starvation.
12. Race: A synchronization problem between two process vying
for the same resource.
13. Recovery: terminate all jobs
terminate jobs involved in deadlock
Terminate jobs in deadlock one at a time until recovery.
Save jobs before termination.
De-allocate resources from non deadlock jobs.
Stop new jobs from entering the system.
14. Resource Holding: Claiming a resource without being willing
to release it.
15. Safe State: the situation in which the system has enough
available resources to guarantee the completion of at least
one job running on the system.