Show:
CPU Scheduling
CPU Scheduling
CPU Scheduling
Deadlocks
Deadlocks
100
Processes completed per unit time
What is throughput?
100
Tendency for a process to be re-scheduled on a preferred processor
What is processor affinity?
100
One of the four criteria for a deadlock, which is the only which cannot be negotiated to avoid a deadlock
What is mutual exclusion?
100
Two types of edges in a RAG
What are assignment and request edges?
200
Total time it takes to execute process
What is turnaround time?
200
Formula for estimating best guess of next CPU burst
What is exponential average?
200
The task of ensuring the workload is even among processors
What is load balancing?
200
The sequence of events by which a process utilizes a resource
What is request -> use -> release?
200
Provides a set of methods to ensure at least one of the necessary conditions for deadlock does not hold
What is deadlock prevention?
300
How long a process spends in the ready queue
What is waiting time?
300
The phenomenon which prevents starvation in priority scheduling
What is aging?
300
Two general approaches to load balancing
What are push and pull migration?
300
Requires that the OS be given information in advance concerning resource needs of processes to determine which should wait
What is deadlock avoidance?
400
Three events which happen during dispatch latency
What is switching context, mode bit switch, and jumping to code location?
400
A type of scheduling in which multiple types of algorithms is supported
What is multilevel queue scheduling?
400
The temporal components of event latency (start to finish)
What are interrupt processing, dispatch latency, and real-time execution?
400
A type of graph for analyzing resource use
What is a system resource-allocation graph?
400
If whenever a process requests a resource, a protocol makes sure that process holds no other resources, it ensures that the _ condition does not hold
What is hold-and-wait?
500
The scheduler which minimizes waiting time
What is SJF?
500
The two types of contention scopes
What are process and system?
500
Schedules periodic tasks using a static priority policy with preemption
What is rate-monotonic?
500
Other than mutual exclusion, a criterion required for deadlock
What are hold and wait, no preemption, circular wait?
500
A sequence of processes whereby requests for resources can be satisfied without deadlock
What is a safe sequence?