Tr0iBo1abLe / Digraph-Scheduler

Finds the optimal schedule for a DAG (NP-Hard problem) using an A* search. Features pruning and bound techniques along side an interactive GUI and parallel processing. SOFTENG306

SE306

Build status

A GPU Scheduling program

How to run:

Download the latest Scheduler.jar from the release page here

Run via. java -jar Scheduler.jar INPUT.dot P [-p N] [-v] [-o [OUTPUT]] [-h]

positional arguments:
  INPUT                  Dot file representing a DAG to process
  P                      Processors available to the schedule

optional arguments:
  -h, --help             Show this help message and exit
  -v                     Choose whether to use GUI (default: false)
  -p N, --parallel N     Use parallel processing on N logical cores (default: [1])
  -o [OUTPUT]            Output file name, write to STDOUT if non-specified

How the scheduler was created:

View the wiki

Current bugs:

View the issues tab

Authors:

bche722 - Baiwei Chen UPI: bche722 ID:896127611
qhua948 - Dovahkiin Huang UPI: qhua948 ID: 819845441
zkon584 - Ziyin Kong UPI: zkon584 ID: 154002158
wilmol - Will Molloy UPI: wmol664 ID: 528412822
tshi206 - Mason Shi  UPI: tshi206 ID: 313368828