Outline for May 30, 2008
, §8, 9
Greetings and felicitations!
What blocks are in use, where files are, etc.
Free list implementations, bit maps
File maps: linked list, pairs
Allocation of Disk Blocks to Files
Network File System (NFS)
How it works
Resource manager, request, release
What is deadlock
Difference between it and starvation
Liberal, conservative, and serialization approaches to resource allocation
How to Deal with Deadlock (Policies)
Detection and recovery
Prevention: mutual exclusion, no preemption, circular wait, hold and wait
Breaking circular wait
Break no preemption (i.e., allow preemption)
Hierarchical ordering (ordered resource) policy
Acquire all resources before running
Maximum claim techniques
You can also obtain a PDF version of this.
Version of May 30, 2008 at 7:03 AM