| Package | Description |
|---|---|
| alg | |
| alg.cost | |
| gui | |
| io | |
| util |
| Constructor | Description |
|---|---|
DFSAlgorithm(ScheduleGrph input,
CostFunction cost,
int numProcessors) |
Sets up the DFS algorithm without visualization
|
DFSAlgorithm(ScheduleGrph input,
CostFunction cost,
int numProcessors,
ScheduleListener listen) |
Sets up the DFS alg with visualization
|
DFSParallel(ScheduleGrph input,
CostFunction cost,
int numProcessors,
int numCores) |
Sets up the DFS algorithm without visualization
|
DFSParallel(ScheduleGrph input,
CostFunction cost,
int numProcessors,
int numCores,
ScheduleListener listen) |
Sets up the DFS alg with visualization
|
DFSTask(ScheduleGrph input,
PartialScheduleGrph current,
PartialScheduleGrph best,
CostFunction cost,
java.util.HashSet<java.lang.String> closed,
int numProcessors,
int lastAdded,
java.util.concurrent.atomic.AtomicLong lowerBound,
java.util.concurrent.atomic.AtomicLong iterations) |
Sets up the DFS task without visualization
|
DFSTask(ScheduleGrph input,
PartialScheduleGrph current,
PartialScheduleGrph best,
CostFunction cost,
java.util.HashSet<java.lang.String> closed,
int numProcessors,
int lastAdded,
java.util.concurrent.atomic.AtomicLong lowerBound,
java.util.concurrent.atomic.AtomicLong iterations,
ScheduleListener listen) |
Sets up the DFS task with visualization
|
| Constructor | Description |
|---|---|
AStarCostFunction(ScheduleGrph input) |
Constructor.
|
| Modifier and Type | Method | Description |
|---|---|---|
void |
Controller.viewGraph(ZoomableScrollPane display,
ScheduleGrph graph) |
This method deals with the visualization of the input graph on the GUI.
|
| Modifier and Type | Method | Description |
|---|---|---|
static ScheduleGrph |
Main.getIn() |
Get the input graph that was read in at the input step
|
static ScheduleGrph |
Input.readDotInput(java.lang.String path) |
The main method of this class, takes the filepath to the dot file, and
returns the parsed Grph Graph.
|
| Modifier and Type | Method | Description |
|---|---|---|
static void |
Output.export(ScheduleGrph outputGraph,
java.lang.String outputPath) |
The main method of this class, takes a graph and an output path and
exports it to the file defined in the path variable.
|
| Modifier and Type | Class | Description |
|---|---|---|
class |
PartialScheduleGrph |
The PartialScheduleGrph extends the Grph libraries graphing classes, and
provides an object that represents a Partial schedule in the scheduling
algorithm state space
|
| Modifier and Type | Method | Description |
|---|---|---|
ScheduleGrph |
ScheduleGrph.cloneSelf() |
Clone this ScheduleGrph
|
| Modifier and Type | Method | Description |
|---|---|---|
void |
PartialScheduleGrph.addFreeTask(ScheduleGrph init,
int task,
int pc) |
Add a free task to the earliest possible time on this schedule on the specified processor
|
boolean |
ScheduleGrph.dependenciesValid(ScheduleGrph input) |
Check if this ScheduleGraph is valid with regards to tasks only starting after their dependencies
and dependency transfer (if on diff processors) are finished.
|
boolean |
PartialScheduleGrph.equivalenceCheck(ScheduleGrph input,
int lastAdded,
int numProcessors) |
Checks whether or not a schedule has any equivalent schedules, and should
therefore not be expanded.
|
java.util.TreeSet<java.lang.Integer> |
PartialScheduleGrph.getFixedFree(ScheduleGrph inputSaved) |
Get the list of currently free tasks for this partial schedule using the Fixed Task Order
pruning strategy.
|
java.util.HashSet<java.lang.Integer> |
PartialScheduleGrph.getFree(ScheduleGrph inputSaved) |
Get the list of currently free tasks for this partial schedule
|
boolean |
PartialScheduleGrph.outgoingCommsOK(ScheduleGrph input,
java.util.HashMap<java.lang.Integer,java.lang.Integer> newStarts,
int numProcessors) |
Helper method for equivalenceCheck which checks that all outgoing
datatransfers of a set of tasks are unaffected by a change in
order/position
|