Welcome to our CPU Process Scheduler
Hello! and Welcome to our CPU Process Scheduler
This scheduler has been implemented using HTML, CSS, and JavaScript.
Below are the functionalities implemented:
- First-Come, First-Served (FCFS)
- Shortest Job First (SJF)
- Shortest Remaining Time First (SRTF)
- RoundRobin(RR)
- Priority
This further prints Gantt Chart for each algorithm by default
First-Come, First-Served (FCFS)
First-Come, First-Served (FCFS) is a scheduling algorithm that executes processes in the order they arrive.
- Advantages: Simple, easy to implement, and no starvation.
- Disadvantages: Poor performance for short processes as they have to wait for long processes to complete.
Shortest Job First (SJF)
Shortest Job First (SJF) is a scheduling algorithm that executes processes with the shortest burst time first.
- Advantages: Provides the minimum average waiting time for a given set of processes.
- Disadvantages: Can cause starvation for processes with longer burst times.
Shortest Remaining Time First (SRTF)
Shortest Remaining Time First (SRTF) is a preemptive version of SJF that executes processes with the shortest remaining time first.
- Advantages: Provides the minimum average waiting time for a given set of processes.
- Disadvantages: Can cause overhead due to frequent context switching.
Round Robin (RR)
Round Robin (RR) is a scheduling algorithm where each process is assigned a fixed time slice in a cyclic order.
- Advantages: Fairness among processes, prevents starvation.
- Disadvantages: High waiting time for processes with long CPU burst times, high overhead due to context switching.
Priority Scheduling
Priority Scheduling is a scheduling algorithm where each process is assigned a priority. The process with the highest priority is executed first.
- Advantages: Ensures that high-priority tasks are executed quickly, suitable for real-time systems.
- Disadvantages: Starvation of low-priority processes, may lead to priority inversion.