CS 1550 Lecture Notes - Lecture 4: Mutual Exclusion, Spooling, Two-Phase Locking

61 views3 pages
21 Feb 2017
School
Course

Document Summary

Definition: each process in the set is waiting for an event that only another process in the set can cause. Mutual exclusion: resource can only be held by one process at a time: ex: printer (can"t be shared simultaneous), critical region, cd drive. No preemption: resource cannot be forcibly taken away: referring to preempting a specific resource (property of the resources themselves) Ex: printer (can"t preempt a printer while its printing) Ignore: ostrich algorithm: pretend like it didn"t happen (stick our head in the sand) Need list of process and list of resources. Need to know when a process need/want. Know this through open system call and blocking. Use depth-first search with marking to determine if there"s a cycle. When to run algorithm: give the algorithm a low priority, then you don"t need a specific threshold of when to run it: recover. Not everything, you could end up with the same problem.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents