This repository is part of the "Operating Systems (Sistemas Operativos)" course at UNIR (Universidad Internacional de La Rioja).
This repository contains Python implementations of various process scheduling algorithms commonly used in operating systems. The included algorithms are:
- First-Come, First-Served (FCFS) Scheduling Algorithm
- Shortest Job First (SJF) Scheduling Algorithm
- Priority Scheduling Algorithm
Each implementation is designed to be educational and comprehensible, demonstrating how each algorithm functions in a simulated environment.
Each implementation is contained in its own Python file. You can run them directly to see how they work or integrate them into your own projects.
Run the FCFS Scheduling Algorithm
python scheduling/cfcs_schedule.py
Run the SFJ Scheduling Algorithm
python scheduling/sfj_schedule.py
Run the Priority Scheduling Algorithm
python scheduling/priority_schedule.py
Contributions are welcome! If you would like to improve an existing implementation or add a new process scheduling algorithm, feel free to open a pull request.
This project is licensed under the GPLv3 License. See the LICENSE file for more details.