A graph in DOT format that represents that the multiple task scheduling with communication costs input is required. The nodes and edges should have weights that represent, processing time and communication costs respectively. The scheduler will find the optimal schedule that can minimize the time used to do all the tasks.

Inputs: <INPUT.dot> <P> <[OPTION]>

Optional Flags:

    -p N    use N cores for execution in parallel (default is sequential)

    -v    visualize the search

    -o OUTPUT    output file is named OUTPUT (default is INPUT-output.dot)

    -verbose     show the debug messages

This program will output a dot file that represents the optimal schedule. The nodes will have properties "Start" and "Processor", which represent the start time and processor that the task has been scheduled on.

In an IDE with Maven installed, run the Maven clean and install goals. This will generate a .jar file in the target folder. This jar is ready to run.

Wiki (See side bar):

• Meeting Minutes
• Decisions
• Background Research
• Dependencies (External Libraries) used (or lack thereof)
• Development Workflow