This repository contains the implementation of various CPU scheduling algorithms used in operating systems. CPU scheduling is a vital process that ensures efficient execution of processes by managing the order and time in which the CPU is assigned to them. This project demonstrates different scheduling techniques and provides a simulation of how each algorithm works.
Simplest scheduling algorithm that executes processes in the order they arrive.
Selects the process with the smallest execution time. Priority Scheduling: Executes processes based on priority, where higher priority processes are executed first.
Each process is assigned a fixed time in a cyclic order.
Shortest Remaining Time First (SRTF) is a preemptive scheduling algorithm that selects the process with the smallest amount of time remaining until completion. SRTF is essentially the preemptive version of the Shortest Job Next (SJN) algorithm.
To run the project, follow these steps:
Clone the repository :
git clone https://github.com/ajaysonwani/CPU_Scheduler.gitCompile the code:
g++ -o scheduler scheduler2.cppRun the executable:
./scheduler input.txt output.txtArrival: Sort processes by arrival time.
Execution: Execute processes in the order they arrive.
Completion: Calculate waiting time and turnaround time for each process.
Output: Output average waiting time and turnaround time.
Arrival: Sort processes by arrival time.
Execution: Select the process with the shortest burst time among the arrived processes.
Completion: Calculate waiting time and turnaround time for each process.
Output: Output average waiting time and turnaround time.
Arrival: Sort processes by arrival time.
Execution: Select the process with the shortest remaining time among the arrived processes.
Preemption: If a shorter job arrives, preempt the current job.
Completion: Calculate waiting time and turnaround time for each process.
Output: Output average waiting time and turnaround time.
Arrival: Maintain a ready queue.
Execution: Execute each process for a fixed time quantum.
Preemption: If the process's quantum expires, move it to the end of the queue.
Completion: Calculate waiting time and turnaround time for each process.
Output: Output average waiting time and turnaround time.
Understanding of different CPU scheduling algorithms and their implementation in C++.
Hands-on experience with process management and scheduling in an operating system.
Importance of algorithm choice in optimizing CPU utilization and response time.
Operating System Concepts by Abraham Silberschatz, Peter Baer Galvin, and Greg Gagne
GeeksforGeeks articles on CPU Scheduling Algorithms