This project is an extension of the original Process Scheduling Algorithms project, which now includes a Graphical User Interface (GUI) implemented with Java Swing for enhanced user interaction. In addition to loading processes from a file, users can now add new processes and choose whether to place them at the beginning or the end of the process queue.
- Load and parse process data from a text file.
- Simulate process scheduling using multiple algorithms.
- Display scheduling results and process execution order.
- Interactive Graphical User Interface (GUI) for easier use.
- Add new processes to the queue and specify their placement (beginning or end).
To run this project, follow these steps:
- Clone the repository to your local machine.
- Compile the Java source code.
- Run the program and interact with the GUI.
- Choose one of the scheduling algorithms from the menu.
- The program will execute the selected algorithm and display the results in the GUI.
- You can add new processes by providing their name, duration, and priority, and choose to place them at the beginning or end of the queue.
- Continue to interact with the GUI to simulate different scenarios.
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 with Java Swing for the GUI and does not have external dependencies beyond the Java Development Kit (JDK).
This project is licensed under the MIT License - see the LICENSE.md file for details.
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