Skip to content

The Process Scheduling Simulator is a web-based tool designed to simulate and analyze CPU scheduling algorithms, with a focus on the Shortest Remaining Time (SRT) algorithm. It allows users to customize input parameters, view detailed simulation results, and visualize process execution through a Gantt chart.

License

Notifications You must be signed in to change notification settings

swe-robertkibet/Process-Scheduling-Simulator

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Process-Scheduling-Simulator

Introduction

The Process Scheduling Simulator is a web-based tool designed to simulate and analyze various CPU scheduling algorithms. It provides a platform for understanding the behavior and performance of different scheduling algorithms in a simulated computing environment. This project focuses on implementing the Shortest Remaining Time (SRT) scheduling algorithm and providing insights into its efficiency in managing processes on a CPU.

Live Demo

You can access the live demo of the Process Scheduling Simulator here.

Features

  1. Input Customization: Users can customize input parameters such as the number of processes, arrival times, and burst times. This allows for flexibility in simulating different scenarios and analyzing the behavior of the scheduling algorithm under various conditions.

  2. Simulation Results: The simulator provides detailed simulation results, including completion times, turnaround times, and waiting times for each process. It also calculates the average turnaround time and average waiting time across all processes, providing insights into the overall performance of the scheduling algorithm.

  3. Gantt Chart Visualization: A Gantt chart visualization is generated to visually represent the execution of processes over time. This chart illustrates the timeline of process execution, highlighting the start and end times of each process along with their respective quantum usage.

How to Use

  1. Open the live demo link provided above.
  2. Customize input parameters such as the number of processes, arrival times, and burst times.
  3. Click the "Simulate" button to run the simulation.
  4. Explore the simulation results, including completion times, turnaround times, waiting times, average turnaround time, and average waiting time.
  5. Analyze the Gantt chart visualization to understand the timeline of process execution and quantum usage.

Technologies Used

  • HTML, CSS, JavaScript: Frontend development.
  • Shortest Remaining Time (SRT) Scheduling Algorithm: Backend logic for process scheduling simulation.
  • Chart.js: Library for generating Gantt chart visualizations.

Contributing

Contributions to the Process Scheduling Simulator project are welcome! If you have any suggestions, feature requests, or bug reports, please feel free to submit an issue or pull request on the GitHub repository.

License

This project is licensed under the MIT License. See the LICENSE file for more details.

Contact

For any inquiries or support regarding the Process Scheduling Simulator, please contact me.

Disclaimer

This project is for educational and demonstration purposes only. It is not intended for use in production environments.

About

The Process Scheduling Simulator is a web-based tool designed to simulate and analyze CPU scheduling algorithms, with a focus on the Shortest Remaining Time (SRT) algorithm. It allows users to customize input parameters, view detailed simulation results, and visualize process execution through a Gantt chart.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published