Professional Documents
Culture Documents
Platf Long Quiz
Platf Long Quiz
CPU Scheduling – determining which process will own CPU for execution while another is
on hold
PREEMPTIVE vs NON-PREEMPTIVE
Burst Time / Execution Time – time required to complete execution (running time)
Multiprogramming – programs which can be present in the memory at the same time
CPU/IO burst cycle – characterizes process execution; alternates between CPU and I/O
activity
CPU Utilization – the main task in which the OS makes sure the CPU remains busy as
possible
Throughput – the number of processes that finish their execution per unit of time
Waiting time – the amount of time a process needs to wait in the ready queue
Response time – amount of time the request was submitted until the first response
Turnaround time – amount of time to execute a specific process; Time taken to complete
after arrival
First Come First Serve – easiest and most simple CPU scheduling algorithm
Convoy effect – situation when short jobs have to wait for long jobs to finish
Completion time – time taken for execution to complete starting from arrival time
CALCULATION:
Shortest Job First – the process having the smallest time is chose for execution
Types:
1. Non-Preemptive SJF
2. Preemptive SJF