Create a gantt chart to simulate the scaling processes of the operating system, using algorithms such as FIFO, SJB and priority. These algorithms order the processes and calculate the waiting time and the total time that each one obtained. Thus, it is possible to calculate the average waiting time that each process obtained and verify which algorithm obtained the best performance.
-
Write an application, to simulate process scheduling policies in Priority, FIFO and Shortest Job First algorithms.
-
Simulate a process queue where who is using the CPU is using until finishing the process (Single core).
| Process | Priority | Duration(ms) | Size(kb) |
|---|---|---|---|
| Process A | Priority 4 | 2 | 4 |
| Process B | Priority 2 | 4 | 2 |
| Process C | Priority 1 | 1 | 3 |
| Process D | Priority 3 | 2 | 5 |
| Process E | Priority 1 | 1 | 5 |
| Process F | Priority 5 | 4 | 6 |
| Process G | Priority 3 | 2 | 2 |
| Process H | Priority 1 | 3 | 1 |
- Python
- Matplotlib: for gantt chart.
- Pandas: for read and write csv files.
- Numpy: for arange data.
See also the list of contributors who participated in this project.
Please read CONTRIBUTING.md for details on our code of conduct, and the process for submitting pull requests to us.
This project is licensed under the MIT License - see the LICENSE.md file for details
Developed with ❤️ in Brazil 🇧🇷