https://github.com/coderatul/cpu-sheduling

cpu sheduling algorithm implemented in python
https://github.com/coderatul/cpu-sheduling

cpu-scheduling fcfs fcfs-scheduling first-come-first-serve round-robin-scheduling shortest-job-first

Last synced: about 1 month ago
JSON representation

cpu sheduling algorithm implemented in python

• Host: GitHub
• URL: https://github.com/coderatul/cpu-sheduling
• Owner: coderatul
• Created: 2024-02-11T12:27:06.000Z (11 months ago)
• Default Branch: main
• Last Pushed: 2024-02-14T06:10:54.000Z (10 months ago)
• Last Synced: 2024-10-14T04:08:37.342Z (2 months ago)
• Topics: cpu-scheduling, fcfs, fcfs-scheduling, first-come-first-serve, round-robin-scheduling, shortest-job-first
• Language: Python
• Homepage:
• Size: 8.79 KB
• Stars: 4
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# CPU Scheduling Algorithms

![image](https://github.com/coderatul/cpu-sheduling/assets/72141859/8efac342-4365-496c-b446-a1644fdc1f7a)

This GitHub repository contains Python implementations of various CPU scheduling algorithms. The current implementation includes the First Come First Serve (FCFS) algorithm.

## First Come First Serve (FCFS)

### Introduction

FCFS is a non-preemptive scheduling algorithm that schedules processes based on their arrival time. The process that arrives first is the first to be executed.

### Implementation

The `CpuScheduling` class is used to represent the CPU scheduling algorithms. The FCFS algorithm is implemented in the `fcfs` method.

*current implementaion can handle arrival time(s) with same value and can detect any halts*

### Usage

To use the FCFS algorithm with a specific set of processes, arrival times, and burst times, create an instance of the `CpuScheduling` class and call the `fcfs` method.

```python

prcs = ["P1", "P2", "P3", "P4", "P5"]  # process

at = [0, 1, 2, 3, 4]  # arrival time

bt = [8, 1, 3, 2, 6]  # burst time

schedule = CpuScheduling(prcs, at, bt)

schedule.fcfs()

```

### Output

![image](https://github.com/coderatul/cpu-sheduling/assets/72141859/4017f4a0-d374-42d4-8e10-6cf3ae622b56)

The FCFS algorithm will display the order of process execution, completion time, turn around time, and waiting time in a tabular format.

Feel free to explore other CPU scheduling algorithms by extending the `CpuScheduling` class and implementing additional methods for Shortest Job First (SJF), Shortest Remaining Time First (SRTF), and Round Robin (RR) algorithms.

Happy coding!