This project is part of the Operating Systems course, where we implement various process scheduling algorithms. The project involves reading a text file containing processes. Each line of the file represents a process, with information about its name, duration, and priority.
Once the processes are loaded, the program displays a console menu for the user to choose from the following scheduling algorithms:
- FCFS (First-Come, First-Served)
- SJF (Shortest Job First)
- Priority Scheduling
- Round Robin (with a quantum of 3)
The 5th option in the menu terminates the program's execution.
- Load and parse process data from a text file.
- Simulate process scheduling using multiple algorithms.
- Display scheduling results and process execution order.
To run this project, follow these steps:
- Clone the repository to your local machine.
- Compile the Java source code.
- Run the program and follow the on-screen instructions.
- Choose one of the scheduling algorithms from the menu.
- The program will execute the selected algorithm and display the results.
- You can continue to select different algorithms or exit the program.
This algorithm schedules processes in the order they arrive.
This algorithm schedules processes based on their execution time, selecting the shortest job first.
Processes are scheduled based on their priority levels.
Processes are scheduled in a circular manner, each receiving a fixed time slice (quantum) of 3 units.
This project is implemented in Java and does not have external dependencies beyond the Java Development Kit (JDK).
If you have any questions or need further assistance, feel free to contact the project maintainer:
Ismael Avila
- Email: ismaelg.avilag@gmail.com
- GitHub: Ismaelg-Avilag
- LinkedIn: Ismaelg-Avilag