edu.isi.pegasus.planner.provisioner
public class OccupationDiagram extends Object
| Modifier and Type | Class and Description |
|---|---|
private class |
OccupationDiagram.NodeComp
Comparator which compare the schedulable duration of two nodes
|
| Modifier and Type | Field and Description |
|---|---|
(package private) int |
max |
(package private) int |
maxIndex |
(package private) TreeSet |
nodes |
(package private) long |
RFT |
(package private) LinkedList[] |
timeMap |
| Constructor and Description |
|---|
OccupationDiagram(long rft)
Constructor
|
| Modifier and Type | Method and Description |
|---|---|
void |
add(Node node)
Add tasks into the occupation diagram.
|
int |
balance(int goal,
boolean print)
Run Task redistribution phase of BTS algorithm
|
private void |
printNodes() |
int |
stack(boolean print)
Run Task placement phase of BTS algorithm
|
TreeSet nodes
long RFT
LinkedList[] timeMap
int max
int maxIndex
public OccupationDiagram(long rft)
rft - Requested finish time(deadline) of algorithm.public void add(Node node)
node - Node to be addedprivate void printNodes()
public int stack(boolean print)
print - if true print debug message to stdoutpublic int balance(int goal,
boolean print)
goal - Redistribution loop is stop if maximum height of OD reach this goal value.print - if true print debug message to stdout