Quantum - A fixed time slice allotted to a process, Pre-emptive - When a process switches from running state to steady state or from waiting state to steady state., Low-level scheduler - Algorithm which decides which process (in the ready state) should get CPU time next (running state), interrupt handling - Transferring control to another routine when a service is required, Context-switching - Procedure by which, when the next process takes control of the CPU, its previous state is restored, Scheduling - Managing the processes running on the CPU, Non-preemptive - When a process terminates or switches from running state to waiting state, burst - Time when a process gets control of the CPU, Starvation - To continuously deprive a process of the necessary resources to process a task, Multi-tasking - Managing the execution of many programs that appear to run at the same time, Shortest job first - non-preemptive scheduling algorithm where processes are executed in ascending order if the amount of CPU time required, First come first served - each process request is queued as it is received and executed one by one, Round robin - Scheduling algorithm that uses time slices assigned to each process in a job queue,

Chapter 16 Review for Process management

Print
Embed

Leaderboard

Visual style

Options

Switch template

Continue editing: ?