SRTF Scheduling: Manual Trace (5 Jobs)
🧠 Algorithm Logic: SRTF (Preemptive SJN)
Key Principle:
SRTF is a preemptive scheduling algorithm. It always selects the process in the ready queue with the minimum remaining execution time.
Preemption Rule:
Preemption occurs at any time \( t \) when a newly arriving process has a shorter remaining burst time than the currently running process.
📋 Input Processes & Instructions
This simulation is designed for manual tracing and verification of the Shortest-Remaining-Time-First (SRTF) algorithm. We use 5 predefined processes where the Burst Time (BT) is fixed and the Arrival Time (AT) is variable.