private int coreNum;
private Vector<TaskDescriptor> tasks;
private Hashtable<FlagState, Queue<Integer>> targetCores;
- private Hashtable<FlagState, FlagState> targetFState;
+ private Hashtable<FlagState, FlagState> targetFState; // only affected by transimit edges
+ private Hashtable<FlagState, Vector<Integer>> allyCores;
+ private Hashtable<TaskDescriptor, Vector<FlagState>> td2fs;
public Schedule(int coreNum) {
super();
this.tasks = null;
this.targetCores = null;
this.targetFState = null;
+ this.allyCores = null;
+ this.td2fs = null;
}
public int getCoreNum() {
}
return targetFState.get(fstate);
}
+
+ public Hashtable<FlagState, Vector<Integer>> getAllyCoreTable() {
+ return this.allyCores;
+ }
+
+ public Vector<Integer> getAllyCores(FlagState fstate) {
+ if(this.allyCores == null) {
+ return null;
+ }
+ return this.allyCores.get(fstate);
+ }
+
+ public Hashtable<TaskDescriptor, Vector<FlagState>> getTd2FsTable() {
+ return this.td2fs;
+ }
+
+ public Vector<FlagState> getFStates4TD(TaskDescriptor td) {
+ if(this.td2fs == null) {
+ return null;
+ }
+ return this.td2fs.get(td);
+ }
- public void addTargetCore(FlagState fstate, Integer targetCore/*, Integer num*/) {
+ public void addTargetCore(FlagState fstate, Integer targetCore) {
if(this.targetCores == null) {
this.targetCores = new Hashtable<FlagState, Queue<Integer>>();
}
if(!this.targetCores.containsKey(fstate)) {
this.targetCores.put(fstate, new LinkedList<Integer>());
}
- //if(!this.targetCores.get(fstate).contains(targetCore)) {
- this.targetCores.get(fstate).add(targetCore); // there may have some duplicate items,
- // which reflects probabilities.
- //}
+ this.targetCores.get(fstate).add(targetCore); // there may have some duplicate items,
+ // which reflects probabilities.
}
public void addTargetCore(FlagState fstate, Integer targetCore, FlagState tfstate) {
if(!this.targetCores.containsKey(fstate)) {
this.targetCores.put(fstate, new LinkedList<Integer>());
}
- //if(!this.targetCores.get(fstate).contains(targetCore)) {
- this.targetCores.get(fstate).add(targetCore);
- //}
+ this.targetCores.get(fstate).add(targetCore);
if(this.targetFState == null) {
this.targetFState = new Hashtable<FlagState, FlagState>();
}
- //if(!this.targetFState.containsKey(fstate)) {
- this.targetFState.put(fstate, tfstate);
- //}
+ this.targetFState.put(fstate, tfstate);
+ }
+
+ public void addAllyCore(FlagState fstate, Integer targetCore) {
+ if(this.allyCores == null) {
+ this.allyCores = new Hashtable<FlagState, Vector<Integer>>();
+ }
+ if(!this.allyCores.containsKey(fstate)) {
+ this.allyCores.put(fstate, new Vector<Integer>());
+ }
+ if((this.coreNum != targetCore.intValue()) && (!this.allyCores.get(fstate).contains(targetCore))) {
+ this.allyCores.get(fstate).add(targetCore); // there may have some duplicate items,
+ // which reflects probabilities.
+ }
+ }
+
+ public void addFState4TD(TaskDescriptor td, FlagState fstate) {
+ if(this.td2fs == null) {
+ this.td2fs = new Hashtable<TaskDescriptor, Vector<FlagState>>();
+ }
+ if(!this.td2fs.containsKey(td)) {
+ this.td2fs.put(td, new Vector<FlagState>());
+ }
+ if(!this.td2fs.get(td).contains(fstate)) {
+ this.td2fs.get(td).add(fstate);
+ }
}
public Vector<TaskDescriptor> getTasks() {
if(!this.tasks.contains(task)) {
this.tasks.add(task);
}
- }
+ }
}
\ No newline at end of file