Jacketing Studio Scheduler is a multi-platform, parallelized task scheduler with a feature-rich search visualization tool. The program takes an weighted directed acyclic graph as input via a .dot file and finds the optimal schedule for the tasks across the set number of processors. The aim is to help large data centers efficiently schedule any task graph on any number of their computers/processors.
- Single or Multi-threaded task scheduler
- Visualization of search with diagnostic graphs (RAM, CPU, Search Space, Best Schedules)
| Name | GitHub |
|---|---|
| James Coppard | nzbasic |
| Fraser McCallum | frasermcc9 |
| Fuki Babasaki | Fuki-UoA |
| Bruce Zeng | BruceZeng1 |
| Brendon Joe | BraveNewWord |
Must be run using Java 11 (OpenJDK is fine)
To run the program, type java -jar scheduler.jar <Input File.dot> <Number of Processors> [OPTIONS]
java -jar scheduler.jar INPUT.dot P [OPTIONS]
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).
Building locally requires Java 11
- Clone Repo
- In IntelliJ: Run com.jacketing.Entry (make sure to configure entry to use the correct args as above)