Skip to content

This repository contain the implementation of CPU scheduling algorithm FCFS , SJF , PRIORITY , ROUND ROBIN in python

Notifications You must be signed in to change notification settings

arhamhashmi01/CPU-Scheduling-Algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 

Repository files navigation

CPU-Scheduling-Algorithm

Welcome to the CPU Scheduling Algorithms Implementation repository in Python! This repository hosts the implementation of popular CPU scheduling algorithms, including First-Come, First-Served (FCFS), Shortest Job First (SJF), Priority Scheduling, and Round Robin.

CPU scheduling is a fundamental aspect of operating systems where the scheduler decides which processes to run in what order. Understanding and implementing various scheduling algorithms are essential for computer science students and professionals alike.

In this repository, you will find clear and concise Python implementations of the following CPU scheduling algorithms:

First-Come, First-Served (FCFS): This is the simplest CPU scheduling algorithm where processes are executed in the order they arrive.

Shortest Job First (SJF): This algorithm selects the process with the shortest burst time next, aiming to minimize average waiting time.

Priority Scheduling: Processes are assigned priorities, and the scheduler selects the process with the highest priority for execution.

Round Robin: Each process is assigned a fixed time slice (quantum), and the scheduler rotates among the processes, executing each for a predetermined amount of time before moving to the next.

Each algorithm implementation is accompanied by clear documentation and examples to help you understand the logic behind the code and how to use it effectively.

How to Use:

Clone the Repository: git clone https://github.com/arhamhashmi01/cpu-scheduling-algorithms-python.git

Navigate to the Repository: cd cpu-scheduling-algorithms-python

Explore the Algorithms: Explore the different algorithm implementations in the repository. Each algorithm is contained within its own Python file and may have accompanying documentation and example usage.

Run the Examples: Execute the provided example scripts to see the algorithms in action and understand their behavior.

Contribute (Optional): If you find any issues or want to contribute improvements, feel free to fork the repository, make your changes, and submit a pull request.

Whether you're a student looking to grasp CPU scheduling concepts or a developer seeking ready-to-use implementations for your projects, this repository provides a valuable resource. Feel free to explore, experiment, and contribute to make CPU scheduling algorithms more accessible and understandable for everyone.

Get started with CPU scheduling algorithms in Python today! Fork the repository, clone it locally, and dive into the world of process scheduling. Happy coding!