Package | Description |
---|---|
alg | |
alg.cost | |
gui | |
util |
Modifier and Type | Method | Description |
---|---|---|
PartialScheduleGrph |
Algorithm.runAlg() |
This function is used to run any algorithm.
|
PartialScheduleGrph |
DFSAlgorithm.runAlg() |
Entry point for the algoritm - initializes state space and starts
recursion
|
PartialScheduleGrph |
DFSParallel.runAlg() |
Constructor | Description |
---|---|
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
|
Modifier and Type | Method | Description |
---|---|---|
void |
AStarCostFunction.applyCost(PartialScheduleGrph g,
int addedVertex,
int numProcessors) |
|
void |
CostFunction.applyCost(PartialScheduleGrph g,
int vertex,
int numProcessors) |
Applies this cost function to the specified schedule graph, setting its score
|
void |
AStarCostFunction.applyCostParallel(PartialScheduleGrph g,
int addedVertex,
int numProcessors) |
Apply the cost function to a graph while running on multiple cores in parallel
|
int |
AStarCostFunction.getDRT(int addedVertex,
PartialScheduleGrph g,
int processor) |
Get the Data Ready Time of the graph
|
int |
AStarCostFunction.getIdleTimeFit(PartialScheduleGrph sched,
int numProcessors,
int addedVertex) |
Returns the FIT(s) function representing the idle time bound of a partial
schedule.
|
Modifier and Type | Method | Description |
---|---|---|
void |
Controller.updateGraph(ScheduleEvent event,
int iterations,
PartialScheduleGrph a) |
Update the listener for the current best schedule gantt chart display
|
void |
ScheduleListener.updateGraph(ScheduleEvent event,
int iterations,
PartialScheduleGrph a) |
Update the listener for the current best schedule gantt chart display
|
Modifier and Type | Method | Description |
---|---|---|
PartialScheduleGrph |
PartialScheduleGrph.copy() |
Create and return a copy of this schedule including data such as task starts, score,
processor starts etc
|
PartialScheduleGrph |
PartialScheduleGrph.getNormalizedCopy(int numProcessor) |
Returns a normalized copy of this schedule, where processors are in a specific fixed order,
to allow comparison between two schedules that are identical aside from processor names
|
PartialScheduleGrph |
MinimalScheduleGrph.toGraph() |
Generate a full PartialScheduleGrph from this minimal version
|
Modifier and Type | Method | Description |
---|---|---|
int |
PartialScheduleGrph.compareTo(PartialScheduleGrph g) |
The compareTo method for ranking partial schedules.
|
Constructor | Description |
---|---|
MinimalScheduleGrph(PartialScheduleGrph in) |
The constructor for generating a MinimalScheduleGrph based on a PartialScheduleGrph
|