Concept
Time-Sharing
Time sharing is a CPU scheduling technique where the processor time is divided into small time intervals and allocated to multiple processes in rotation
Context Switch
Example
Ready Queue
Ready queue stores the instruction that wants to be executed by the CPU. The instruction must first store all required data in the memory before entering the queue
CPU
When the CPU is empty, it’ll select an instruction from the ready queue and start executing.
The execution will end in two conditions:
- The time slice ends
- The instruction needs to grab data from hard disk
Event Queue
We store the request for hard disk data in this queue
Event
Hard disk reading and copying data to memory
