scheduling lecture Flashcards
1
Q
a CPU bound process spends almost all of its time in a
A
ready or running state
2
Q
an I/O bounds process spends almost all of its time in a
A
sleep / waiting state
3
Q
when will a CPU make scheduling decisions when a process:
A
- switches from running to waiting
- switches from running to ready state (pre-emptive)
- switches from waiting to ready (pre-emptive)
- terminates
4
Q
A non pre-emptive algorithm makes a scheduling decision when a process:
A
- terminates
- requests an unavailable source
5
Q
function of a dispatcher module
A
gives control of the CPU to the process selected by the short-term scheduler
- switching context, switching to user mode, jumping to the proper location in the user program to continue executing that program
6
Q
Waiting time is defined as
A
the time a process spends in ready state
7
Q
turnaround time is defined as
A
how long it takes to finish a given process
8
Q
response time is defined as
A
how quickly the process begins producing output
9
Q
FIFO / FCFS
A
- non preemptive, process holds until it blocks, yields or terminates
10
Q
SJF
A
- minimizes the average waiting time of a process
- predicts the length of the processes’ next CPU burst using historical data
