This project utilises artificial intelligence(AI) and parallel processing to optimally schedule a set of tasks from a directed task graph onto a given amount of processors. This project uses the AStar algorithm to find an optimal schedule to the scheduling problem.
| Name | GitHub Username | UPI |
|---|---|---|
| David Xiao | David-Xia0 | dxia063 |
| Jennifer Lowe | parfei | jlow987 |
| Justin Teo | jteo97 | jteo158 |
| Raymond Chiu | raymondhonsumchiu | rchi385 |
| Tianren Shen | Tianrens | tshe695 |
- Clone this repository
git clone https://github.com/SoftEng306-2020/project-1-8-gr8-b8-m8.git - Import this project as a Gradle Project
Run the Gradle Task
./gradlew jar
The JAR will be generated in the build/libs directory.
NOTE: If you do not have sufficient permissions, run the following command.
chmod 777 ./gradlew
-
To run the JAR. Open a new terminal window and
cdto the directory with the JAR. -
Type the following command into the terminal window.
java -jar scheduler.jar INPUT.dot P [OPTION]INPUT.dot a task graph with integer weights in dot format P number of processors to schedule the INPUT graph on Optional: -p N use N cores for execution in parallel(default is sequential) -v visualise the search -o OUTPUT output file is named OUTPUT(default is INPUT-output.dot)

