Scheduling Algorithms Gantt Chart

This project is implemented using pure JavaScript, HTML, and CSS. It utilizes the Bootstrap and Chart.js libraries to create a Gantt Chart representation of scheduling algorithms. The two algorithms implemented in this project are Rate Monotonic (RM) and Earliest Deadline First (EDF).

Features

  • Gantt Chart visualization: The project provides an interactive Gantt Chart that visualizes the scheduling of tasks based on the selected algorithm.
  • Rate Monotonic (RM) Algorithm: The RM algorithm assigns fixed priority levels to tasks based on their periods. The Gantt Chart demonstrates how the tasks are scheduled using this algorithm.
  • Earliest Deadline First (EDF) Algorithm: The EDF algorithm assigns priorities to tasks based on their deadlines. The Gantt Chart illustrates how the tasks are scheduled using this algorithm.

Libraries Used

  • Bootstrap: A popular CSS framework that helps create responsive and visually appealing web pages.
  • Chart.js: A JavaScript library for creating interactive and customizable charts.

Usage

To use this project, follow these steps:

  1. Clone the repository: git clone https://github.com/your-username/Process-Scheduling-Simulation.
  2. Open the project folder: cd Process-Scheduling-Simulation
  3. Open the app.html file in your preferred web browser.

Contributing

Contributions to this project are welcome. If you encounter any issues or have suggestions for improvements, please create an issue on the GitHub repository.

License

This project is licensed under the MIT License.

Acknowledgements

The development of this project was inspired by the need to visualize scheduling algorithms and the following resources:

Contact

If you have any questions or suggestions regarding this project, please feel free to contact me at abdullahch433@gmail.com.