This is Team 13's repository.
Note
When running the scheduler.jar
file, ensure that you specify both the input file location and the number of processors.
- Clone the repository:
git clone https://github.com/SoftEng306-2024/project-2-13-gallon-and-friends
- Use the following command to run the project:
java -jar scheduler.jar INPUT.dot P [OPTION]
INPUT.dot
: A task graph in DOT format.P
: The number of processors to schedule the input graph on.
Optional Parameters:
-p N
: Use N cores for execution in parallel (default is sequential).-v
: Visualise the search.-o
OUTPUT: The output file is named OUTPUT (default is INPUT-output.dot).
When the visualise option is chosen, a JavaFX based application launches displaying metrics on the schedule, and provides a Gantt chart of said schedule that updates live.
Below is the Schedule Visualiser.
Below is the Input Graph Visualiser. This contains information on the input graph as well as an interactable graph model.
- The A* algorithm has been developed in the
AStarScheduler.java
file, and is our current algorithm of choice. - Meanwhile, the
DFSScheduler.java
file contains a working algorithm that produces valid and optimal task schedules. This is not in use as it is considerably slower.
- Gallon Zhou - [email protected] - DuckyShine004
- Benjamin Qian - [email protected] - bqia247
- Nicolas Lianto - [email protected] - nlia656
- Stephen Fang - [email protected] - shinramenisbae
- Zion Suh - [email protected] - zsuh022