Robust/src/Analysis/Scheduling/ScheduleAnalysis.java

   1 package Analysis.Scheduling;
   2
   3 import Analysis.TaskStateAnalysis.*;
   4 import IR.*;
   5 import Util.GraphNode;
   6 import Util.GraphNode.SCC;
   7
   8 import java.io.FileInputStream;
   9 import java.util.*;
  10
  11 /** This class holds flag transition diagram(s) can be put on one core.
  12  */
  13 public class ScheduleAnalysis {
  14
  15   State state;
  16   TaskAnalysis taskanalysis;
  17
  18   Vector<ScheduleNode> scheduleNodes;
  19   Vector<ClassNode> classNodes;
  20   Vector<ScheduleEdge> scheduleEdges;
  21   Hashtable<ClassDescriptor, ClassNode> cd2ClassNode;
  22   boolean sorted = false;
  23
  24   int transThreshold;
  25
  26   int scheduleThreshold;
  27   int coreNum;
  28   Vector<Vector<ScheduleNode>> scheduleGraphs;
  29
  30   // Main CD table for multi-param tasks
  31   Hashtable<TaskDescriptor, ClassDescriptor> td2maincd;
  32
  33   public ScheduleAnalysis(State state,
  34                           TaskAnalysis taskanalysis) {
  35     this.state = state;
  36     this.taskanalysis = taskanalysis;
  37     this.scheduleNodes = new Vector<ScheduleNode>();
  38     this.classNodes = new Vector<ClassNode>();
  39     this.scheduleEdges = new Vector<ScheduleEdge>();
  40     this.cd2ClassNode = new Hashtable<ClassDescriptor, ClassNode>();
  41     this.transThreshold = 45; // defaultly 45
  42     this.scheduleThreshold = 1000; // defaultly 1000
  43     this.coreNum = -1;
  44     this.scheduleGraphs = null;
  45     this.td2maincd = null;
  46   }
  47
  48   public void setTransThreshold(int tt) {
  49     this.transThreshold = tt;
  50   }
  51
  52   public void setScheduleThreshold(int stt) {
  53     this.scheduleThreshold = stt;
  54   }
  55
  56   public int getCoreNum() {
  57     return coreNum;
  58   }
  59
  60   public void setCoreNum(int coreNum) {
  61     this.coreNum = coreNum;
  62   }
  63
  64   public Vector<Vector<ScheduleNode>> getScheduleGraphs() {
  65     return this.scheduleGraphs;
  66   }
  67
  68   // for test
  69   public Vector<ScheduleEdge> getSEdges4Test() {
  70     return scheduleEdges;
  71   }
  72
  73   public Hashtable<TaskDescriptor, ClassDescriptor> getTd2maincd() {
  74     // TODO, for test
  75     /*Iterator<TaskDescriptor> key = td2maincd.keySet().iterator();
  76     while(key.hasNext()) {
  77       TaskDescriptor td = key.next();
  78       System.err.println(td.getSymbol() + ", maincd: "
  79           + this.td2maincd.get(td).getSymbol());
  80     }*/
  81
  82     return td2maincd;
  83   }
  84
  85   public boolean schedule(int generateThreshold,
  86                           int skipThreshold,
  87                           Vector<TaskDescriptor> multiparamtds) {
  88     boolean tooptimize = true;
  89     try {
  90       Vector<ScheduleEdge> toBreakDown = new Vector<ScheduleEdge>();
  91       ScheduleNode startupNode = null;
  92
  93       if((multiparamtds != null) || (multiparamtds.size() > 0)) {
  94         this.td2maincd = new Hashtable<TaskDescriptor, ClassDescriptor>();
  95       }
  96
  97       // necessary preparation such as read profile info etc.
  98       preSchedule();
  99       // build the CFSTG
 100       startupNode = buildCFSTG(toBreakDown, multiparamtds);
 101       // do Tree transform
 102       treeTransform(toBreakDown, startupNode);
 103       // do CFSTG transform to explore the potential parallelism as much
 104       // as possible
 105       CFSTGTransform();
 106       // mappint to real multi-core processor
 107       tooptimize = coreMapping(generateThreshold, skipThreshold);
 108       toBreakDown = null;
 109     } catch (Exception e) {
 110       e.printStackTrace();
 111       System.exit(-1);
 112     }
 113     return tooptimize;
 114   }
 115
 116   private void preSchedule() {
 117     this.checkBackEdge();
 118
 119     // set up profiling data
 120     if(state.USEPROFILE) {
 121       java.util.Hashtable<String, TaskInfo> taskinfos =
 122         new java.util.Hashtable<String, TaskInfo>();
 123       this.readProfileInfo(taskinfos);
 124
 125       long tint = 0;
 126       Iterator it_classes = state.getClassSymbolTable().getDescriptorsIterator();
 127       while(it_classes.hasNext()) {
 128         ClassDescriptor cd = (ClassDescriptor) it_classes.next();
 129         if(cd.hasFlags()) {
 130           Vector rootnodes = this.taskanalysis.getRootNodes(cd);
 131           if(rootnodes!=null) {
 132             Iterator it_rootnodes = rootnodes.iterator();
 133             while(it_rootnodes.hasNext()) {
 134               FlagState root = (FlagState)it_rootnodes.next();
 135               Vector allocatingTasks = root.getAllocatingTasks();
 136               if(allocatingTasks != null) {
 137                 for(int k = 0; k < allocatingTasks.size(); k++) {
 138                   TaskDescriptor td =
 139                     (TaskDescriptor)allocatingTasks.elementAt(k);
 140                   Vector<FEdge> fev = this.taskanalysis.getFEdgesFromTD(td);
 141                   int numEdges = fev.size();
 142                   for(int j = 0; j < numEdges; j++) {
 143                     FEdge pfe = fev.elementAt(j);
 144                     TaskInfo taskinfo = taskinfos.get(td.getSymbol());
 145                     tint = taskinfo.m_exetime[pfe.getTaskExitIndex()];
 146                     pfe.setExeTime(tint);
 147                     double idouble =
 148                       taskinfo.m_probability[pfe.getTaskExitIndex()];
 149                     pfe.setProbability(idouble);
 150                     int newRate = 0;
 151                     int tindex = pfe.getTaskExitIndex();
 152                     if((taskinfo.m_newobjinfo.elementAt(tindex) != null)
 153                         && (taskinfo.m_newobjinfo.elementAt(tindex).containsKey(
 154                             cd.getSymbol()))) {
 155                       newRate = taskinfo.m_newobjinfo.elementAt(tindex).get(
 156                           cd.getSymbol());
 157                     }
 158                     pfe.addNewObjInfo(cd, newRate, idouble);
 159                     if(taskinfo.m_byObj != -1) {
 160                       ((FlagState)pfe.getSource()).setByObj(taskinfo.m_byObj);
 161                     }
 162                     // TODO for test
 163                     /*System.err.println("task " + td.getSymbol() + " exit# " +
 164                         pfe.getTaskExitIndex() + " exetime: " + pfe.getExeTime()
 165                         + " prob: " + pfe.getProbability() + "% newobj: "
 166                          + pfe.getNewObjInfoHashtable().size());*/
 167                   }
 168                   fev = null;
 169                 }
 170               }
 171             }
 172             it_rootnodes = null;
 173           }
 174           Iterator it_flags = this.taskanalysis.getFlagStates(cd).iterator();
 175           while(it_flags.hasNext()) {
 176             FlagState fs = (FlagState)it_flags.next();
 177             Iterator it_edges = fs.edges();
 178             while(it_edges.hasNext()) {
 179               FEdge edge = (FEdge)it_edges.next();
 180               TaskInfo taskinfo = taskinfos.get(edge.getTask().getSymbol());
 181               double idouble = 0.0;
 182               if(edge.getTaskExitIndex() >= taskinfo.m_exetime.length) {
 183                 tint = 0;
 184               } else {
 185                 tint = taskinfo.m_exetime[edge.getTaskExitIndex()];
 186                 idouble = taskinfo.m_probability[edge.getTaskExitIndex()];
 187               }
 188               edge.setExeTime(tint);
 189               edge.setProbability(idouble);
 190               if(taskinfo.m_byObj != -1) {
 191                 ((FlagState)edge.getSource()).setByObj(taskinfo.m_byObj);
 192               }
 193               // TODO for test
 194               /*System.err.println("task " + edge.getTask().getSymbol() + " exit# " +
 195                   edge.getTaskExitIndex() + " exetime: " + edge.getExeTime()
 196                   + " prob: " + edge.getProbability());*/
 197             }
 198             it_edges = null;
 199           }
 200           it_flags = null;
 201         }
 202       }
 203       taskinfos = null;
 204       it_classes = null;
 205     } else {
 206       randomProfileSetting();
 207     }
 208   }
 209
 210   private void checkBackEdge() {
 211     // Indentify backedges
 212     Iterator it_classes=state.getClassSymbolTable().getDescriptorsIterator();
 213     while(it_classes.hasNext()) {
 214       ClassDescriptor cd=(ClassDescriptor) it_classes.next();
 215       if(cd.hasFlags()) {
 216         Set<FlagState> fss = this.taskanalysis.getFlagStates(cd);
 217         SCC scc=GraphNode.DFS.computeSCC(fss);
 218         if (scc.hasCycles()) {
 219           for(int i=0; i<scc.numSCC(); i++) {
 220             if (scc.hasCycle(i)) {
 221               Set cycleset = scc.getSCC(i);
 222               Iterator it_fs = cycleset.iterator();
 223               while(it_fs.hasNext()) {
 224                 FlagState fs = (FlagState)it_fs.next();
 225                 Iterator it_edges = fs.edges();
 226                 while(it_edges.hasNext()) {
 227                   FEdge edge = (FEdge)it_edges.next();
 228                   if(cycleset.contains(edge.getTarget())) {
 229                     // a backedge
 230                     edge.setisbackedge(true);
 231                   }
 232                 }
 233                 it_edges = null;
 234               }
 235               it_fs = null;
 236             }
 237           }
 238         }
 239         fss = null;
 240       }
 241     }
 242     it_classes = null;
 243   }
 244
 245   private void readProfileInfo(java.util.Hashtable<String, TaskInfo> taskinfos){
 246     try {
 247       // read in profile data and set
 248       //FileInputStream inStream = new FileInputStream("/scratch/profile.rst");
 249       FileInputStream inStream =
 250         new FileInputStream(/*"/scratch/" + */this.state.profilename);
 251       byte[] b = new byte[1024 * 100];
 252       int length = inStream.read(b);
 253       if(length < 0) {
 254         System.out.print("No content in input file: /scratch/"
 255             + this.state.profilename + "\n");
 256         System.exit(-1);
 257       }
 258       String profiledata = new String(b, 0, length);
 259
 260       // profile data format:
 261       //   taskname, numoftaskexits(; exetime, probability, numofnewobjtypes(,
 262       //   newobj type, num of objs)+)+
 263       int inindex = profiledata.indexOf('\n');
 264       while((inindex != -1) ) {
 265         String inline = profiledata.substring(0, inindex);
 266         profiledata = profiledata.substring(inindex + 1);
 267         //System.printString(inline + "\n");
 268         int tmpinindex = inline.indexOf(',');
 269         if(tmpinindex == -1) {
 270           break;
 271         }
 272         String inname = inline.substring(0, tmpinindex);
 273         String inint = inline.substring(tmpinindex + 1);
 274         while(inint.startsWith(" ")) {
 275           inint = inint.substring(1);
 276         }
 277         tmpinindex = inint.indexOf(',');
 278         if(tmpinindex == -1) {
 279           break;
 280         }
 281         int numofexits = Integer.parseInt(inint.substring(0, tmpinindex));
 282         TaskInfo tinfo = new TaskInfo(numofexits);
 283         inint = inint.substring(tmpinindex + 1);
 284         while(inint.startsWith(" ")) {
 285           inint = inint.substring(1);
 286         }
 287         tmpinindex = inint.indexOf(';');
 288         int byObj = Integer.parseInt(inint.substring(0, tmpinindex));
 289         if(byObj != -1) {
 290           tinfo.m_byObj = byObj;
 291         }
 292         inint = inint.substring(tmpinindex + 1);
 293         while(inint.startsWith(" ")) {
 294           inint = inint.substring(1);
 295         }
 296         for(int i = 0; i < numofexits; i++) {
 297           String tmpinfo = null;
 298           if(i < numofexits - 1) {
 299             tmpinindex = inint.indexOf(';');
 300             tmpinfo = inint.substring(0, tmpinindex);
 301             inint = inint.substring(tmpinindex + 1);
 302             while(inint.startsWith(" ")) {
 303               inint = inint.substring(1);
 304             }
 305           } else {
 306             tmpinfo = inint;
 307           }
 308
 309           tmpinindex = tmpinfo.indexOf(',');
 310           tinfo.m_exetime[i] = Long.parseLong(tmpinfo.substring(0, tmpinindex));
 311           tmpinfo = tmpinfo.substring(tmpinindex + 1);
 312           while(tmpinfo.startsWith(" ")) {
 313             tmpinfo = tmpinfo.substring(1);
 314           }
 315           tmpinindex = tmpinfo.indexOf(',');
 316           tinfo.m_probability[i] = Double.parseDouble(
 317               tmpinfo.substring(0,tmpinindex));
 318           tmpinfo = tmpinfo.substring(tmpinindex + 1);
 319           while(tmpinfo.startsWith(" ")) {
 320             tmpinfo = tmpinfo.substring(1);
 321           }
 322           tmpinindex = tmpinfo.indexOf(',');
 323           int numofnobjs = 0;
 324           if(tmpinindex == -1) {
 325             numofnobjs = Integer.parseInt(tmpinfo);
 326             if(numofnobjs != 0) {
 327               System.err.println("Error profile data format!");
 328               System.exit(-1);
 329             }
 330           } else {
 331             tinfo.m_newobjinfo.setElementAt(new Hashtable<String,Integer>(), i);
 332             numofnobjs = Integer.parseInt(tmpinfo.substring(0, tmpinindex));
 333             tmpinfo = tmpinfo.substring(tmpinindex + 1);
 334             while(tmpinfo.startsWith(" ")) {
 335               tmpinfo = tmpinfo.substring(1);
 336             }
 337             for(int j = 0; j < numofnobjs; j++) {
 338               tmpinindex = tmpinfo.indexOf(',');
 339               String nobjtype = tmpinfo.substring(0, tmpinindex);
 340               tmpinfo = tmpinfo.substring(tmpinindex + 1);
 341               while(tmpinfo.startsWith(" ")) {
 342                 tmpinfo = tmpinfo.substring(1);
 343               }
 344               int objnum = 0;
 345               if(j < numofnobjs - 1) {
 346                 tmpinindex = tmpinfo.indexOf(',');
 347                 objnum  = Integer.parseInt(tmpinfo.substring(0, tmpinindex));
 348                 tmpinfo = tmpinfo.substring(tmpinindex + 1);
 349                 while(tmpinfo.startsWith(" ")) {
 350                   tmpinfo = tmpinfo.substring(1);
 351                 }
 352               } else {
 353                 objnum = Integer.parseInt(tmpinfo);
 354               }
 355               tinfo.m_newobjinfo.elementAt(i).put(nobjtype, objnum);
 356             }
 357           }
 358         }
 359         taskinfos.put(inname, tinfo);
 360         inindex = profiledata.indexOf('\n');
 361       }
 362       inStream.close();
 363       inStream = null;
 364       b = null;
 365     } catch(Exception e) {
 366       e.printStackTrace();
 367     }
 368   }
 369
 370   // for test
 371   private void randomProfileSetting() {
 372     // Randomly set the newRate and probability of FEdges
 373     java.util.Random r=new java.util.Random();
 374     int tint = 0;
 375     Iterator it_classes=state.getClassSymbolTable().getDescriptorsIterator();
 376     for(; it_classes.hasNext();) {
 377       ClassDescriptor cd=(ClassDescriptor) it_classes.next();
 378       if(cd.hasFlags()) {
 379         Vector rootnodes=this.taskanalysis.getRootNodes(cd);
 380         if(rootnodes!=null) {
 381           Iterator it_rootnodes=rootnodes.iterator();
 382           for(; it_rootnodes.hasNext();) {
 383             FlagState root=(FlagState)it_rootnodes.next();
 384             Vector allocatingTasks = root.getAllocatingTasks();
 385             if(allocatingTasks != null) {
 386               for(int k = 0; k < allocatingTasks.size(); k++) {
 387                 TaskDescriptor td = (TaskDescriptor)allocatingTasks.elementAt(k);
 388                 Vector<FEdge> fev =
 389                   (Vector<FEdge>)this.taskanalysis.getFEdgesFromTD(td);
 390                 int numEdges = fev.size();
 391                 int total = 100;
 392                 for(int j = 0; j < numEdges; j++) {
 393                   FEdge pfe = fev.elementAt(j);
 394                   if(numEdges - j == 1) {
 395                     pfe.setProbability(total);
 396                   } else {
 397                     if((total != 0) && (total != 1)) {
 398                       do {
 399                         tint = r.nextInt()%total;
 400                       } while(tint <= 0);
 401                     }
 402                     pfe.setProbability(tint);
 403                     total -= tint;
 404                   }
 405                   //do {
 406                   //   tint = r.nextInt()%10;
 407                   //  } while(tint <= 0);
 408                   //int newRate = tint;
 409                   //int newRate = (j+1)%2+1;
 410                   int newRate = 1;
 411                   String cdname = cd.getSymbol();
 412                   if((cdname.equals("SeriesRunner")) ||
 413                       (cdname.equals("MDRunner")) ||
 414                       (cdname.equals("Stage")) ||
 415                       (cdname.equals("AppDemoRunner")) ||
 416                       (cdname.equals("FilterBankAtom")) ||
 417                       (cdname.equals("Grid")) ||
 418                       (cdname.equals("Fractal")) ||
 419                       (cdname.equals("KMeans")) ||
 420                       (cdname.equals("ZTransform")) ||
 421                       (cdname.equals("TestRunner")) ||
 422                                           (cdname.equals("TestRunner2")) ||
 423                       (cdname.equals("LinkList")) ||
 424                       (cdname.equals("BHRunner"))) {
 425                     newRate = this.coreNum;
 426                   } else if(cdname.equals("SentenceParser")) {
 427                     newRate = 4;
 428                   } else if(cdname.equals("BlurPiece")){
 429                     newRate = 4;
 430                   } else if(cdname.equals("ImageX")){
 431                     newRate = 2 * 2;
 432                   } else if(cdname.equals("ImageY")){
 433                     newRate = 1 * 4;
 434                   }
 435                   //do {
 436                   //    tint = r.nextInt()%100;
 437                   //   } while(tint <= 0);
 438                   //   int probability = tint;
 439                   int probability = 100;
 440                   pfe.addNewObjInfo(cd, newRate, probability);
 441                 }
 442                 fev = null;
 443               }
 444             }
 445           }
 446           it_rootnodes = null;
 447         }
 448
 449         Iterator it_flags = this.taskanalysis.getFlagStates(cd).iterator();
 450         while(it_flags.hasNext()) {
 451           FlagState fs = (FlagState)it_flags.next();
 452           Iterator it_edges = fs.edges();
 453           int total = 100;
 454           while(it_edges.hasNext()) {
 455             //do {
 456             //    tint = r.nextInt()%10;
 457             //   } while(tint <= 0);
 458             tint = 3;
 459             FEdge edge = (FEdge)it_edges.next();
 460             edge.setExeTime(tint);
 461             if((fs.getClassDescriptor().getSymbol().equals("MD"))
 462                 && (edge.getTask().getSymbol().equals("t6"))) {
 463               if(edge.isbackedge()) {
 464                 if(edge.getTarget().equals(edge.getSource())) {
 465                   edge.setProbability(93.75);
 466                 } else {
 467                   edge.setProbability(3.125);
 468                 }
 469               } else {
 470                 edge.setProbability(3.125);
 471               }
 472               continue;
 473             }
 474             if(!it_edges.hasNext()) {
 475               edge.setProbability(total);
 476             } else {
 477               if((total != 0) && (total != 1)) {
 478                 do {
 479                   tint = r.nextInt()%total;
 480                 } while(tint <= 0);
 481               }
 482               edge.setProbability(tint);
 483               total -= tint;
 484             }
 485           }
 486           it_edges = null;
 487         }
 488         it_flags = null;
 489       }
 490     }
 491     it_classes = null;
 492   }
 493
 494   private ScheduleNode buildCFSTG(Vector<ScheduleEdge> toBreakDown,
 495                                   Vector<TaskDescriptor> multiparamtds) {
 496     Hashtable<ClassDescriptor, ClassNode> cdToCNodes =
 497       new Hashtable<ClassDescriptor, ClassNode>();
 498     // Build the combined flag transition diagram
 499     // First, for each class create a ClassNode
 500     Iterator it_classes = state.getClassSymbolTable().getDescriptorsIterator();
 501     while(it_classes.hasNext()) {
 502       ClassDescriptor cd = (ClassDescriptor) it_classes.next();
 503       Set<FlagState> fStates = taskanalysis.getFlagStates(cd);
 504
 505       //Sort flagState nodes inside this ClassNode
 506       Vector<FlagState> sFStates = FlagState.DFS.topology(fStates, null);
 507
 508       Vector rootnodes  = taskanalysis.getRootNodes(cd);
 509       if(((rootnodes != null) && (rootnodes.size() > 0))
 510           || (cd.getSymbol().equals(TypeUtil.StartupClass))) {
 511         ClassNode cNode = new ClassNode(cd, sFStates);
 512         cNode.setSorted(true);
 513         classNodes.add(cNode);
 514         cd2ClassNode.put(cd, cNode);
 515         cdToCNodes.put(cd, cNode);
 516         cNode.calExeTime();
 517       }
 518       rootnodes = null;
 519       fStates = null;
 520       sFStates = null;
 521     }
 522     it_classes = null;
 523
 524     ScheduleNode startupNode = null;
 525     // For each ClassNode create a ScheduleNode containing it
 526     int i = 0;
 527     for(i = 0; i < classNodes.size(); i++) {
 528       ClassNode cn = classNodes.elementAt(i);
 529       ScheduleNode sn = new ScheduleNode(cn, 0);
 530       if(cn.getClassDescriptor().getSymbol().equals(TypeUtil.StartupClass)) {
 531         startupNode = sn;
 532       }
 533       cn.setScheduleNode(sn);
 534       scheduleNodes.add(sn);
 535       try {
 536         sn.calExeTime();
 537       } catch (Exception e) {
 538         e.printStackTrace();
 539       }
 540     }
 541
 542     // Create 'new' edges between the ScheduleNodes.
 543     for(i = 0; i < classNodes.size(); i++) {
 544       ClassNode cNode = classNodes.elementAt(i);
 545       ClassDescriptor cd = cNode.getClassDescriptor();
 546       Vector rootnodes  = taskanalysis.getRootNodes(cd);
 547       if(rootnodes != null) {
 548         for(int h = 0; h < rootnodes.size(); h++) {
 549           FlagState root=(FlagState)rootnodes.elementAt(h);
 550           Vector allocatingTasks = root.getAllocatingTasks();
 551           if(allocatingTasks != null) {
 552             for(int k = 0; k < allocatingTasks.size(); k++) {
 553               TaskDescriptor td = (TaskDescriptor)allocatingTasks.elementAt(k);
 554               Vector<FEdge> fev =
 555                 (Vector<FEdge>)taskanalysis.getFEdgesFromTD(td);
 556               int numEdges = fev.size();
 557               ScheduleNode sNode = cNode.getScheduleNode();
 558               for(int j = 0; j < numEdges; j++) {
 559                 FEdge pfe = fev.elementAt(j);
 560                 FEdge.NewObjInfo noi = pfe.getNewObjInfo(cd);
 561                 if ((noi == null) || (noi.getNewRate() == 0)
 562                     || (noi.getProbability() == 0)) {
 563                   // fake creating edge, do not need to create corresponding
 564                   // 'new' edge
 565                   continue;
 566                 }
 567                 if(noi.getRoot() == null) {
 568                   // set root FlagState
 569                   noi.setRoot(root);
 570                 }
 571                 FlagState pfs = (FlagState)pfe.getTarget();
 572                 ClassDescriptor pcd = pfs.getClassDescriptor();
 573                 ClassNode pcNode = cdToCNodes.get(pcd);
 574
 575                 ScheduleEdge sEdge = new ScheduleEdge(sNode,
 576                                                       "new",
 577                                                       root,
 578                                                       ScheduleEdge.NEWEDGE,
 579                                                       0);
 580                 sEdge.setFEdge(pfe);
 581                 sEdge.setSourceCNode(pcNode);
 582                 sEdge.setTargetCNode(cNode);
 583                 sEdge.setTargetFState(root);
 584                 sEdge.setNewRate(noi.getNewRate());
 585                 sEdge.setProbability(noi.getProbability());
 586                 pcNode.getScheduleNode().addEdge(sEdge);
 587                 scheduleEdges.add(sEdge);
 588                 if((j !=0 ) || (k != 0) || (h != 0)) {
 589                   toBreakDown.add(sEdge);
 590                 }
 591               }
 592               fev = null;
 593             }
 594             allocatingTasks = null;
 595           }
 596         }
 597         rootnodes = null;
 598       }
 599     }
 600     cdToCNodes = null;
 601
 602     for(i = 0; i < multiparamtds.size(); i++) {
 603       TaskDescriptor td = multiparamtds.elementAt(i);
 604       ClassDescriptor cd = td.getParamType(0).getClassDesc();
 605       // set the first parameter as main cd
 606       // NOTE: programmer should write in such a style that
 607       //       for all multi-param tasks, the main class should be
 608       //       the first parameter
 609       // TODO: may have bug when cd has multiple new flag states
 610       this.td2maincd.put(td, cd);
 611     }
 612
 613     return startupNode;
 614   }
 615
 616   private void treeTransform(Vector<ScheduleEdge> toBreakDown,
 617                              ScheduleNode startupNode) {
 618     int i = 0;
 619
 620     // Break down the 'cycle's
 621     try {
 622       for(i = 0; i < toBreakDown.size(); i++ ) {
 623         cloneSNodeList(toBreakDown.elementAt(i), false);
 624       }
 625     } catch (Exception e) {
 626       e.printStackTrace();
 627       System.exit(-1);
 628     }
 629
 630     // Remove fake 'new' edges
 631     for(i = 0; i < scheduleEdges.size(); i++) {
 632       ScheduleEdge se = (ScheduleEdge)scheduleEdges.elementAt(i);
 633       if((0 == se.getNewRate()) || (0 == se.getProbability())) {
 634         scheduleEdges.removeElement(se);
 635         scheduleNodes.removeElement(se.getTarget());
 636       }
 637     }
 638
 639     // Do topology sort of the ClassNodes and ScheduleEdges.
 640     Vector<ScheduleEdge> ssev = new Vector<ScheduleEdge>();
 641     Vector<ScheduleNode> tempSNodes =
 642       ClassNode.DFS.topology(scheduleNodes, ssev);
 643     scheduleNodes.removeAllElements();
 644     scheduleNodes = tempSNodes;
 645     tempSNodes = null;
 646     scheduleEdges.removeAllElements();
 647     scheduleEdges = ssev;
 648     ssev = null;
 649     sorted = true;
 650
 651     // Set the cid of these ScheduleNode
 652     Queue<ScheduleNode> toVisit = new LinkedList<ScheduleNode>();
 653     toVisit.add(startupNode);
 654     while(!toVisit.isEmpty()) {
 655       ScheduleNode sn = toVisit.poll();
 656       if(sn.getCid() == -1) {
 657         // not visited before
 658         sn.setCid(ScheduleNode.colorID++);
 659         Iterator it_edge = sn.edges();
 660         while(it_edge.hasNext()) {
 661           toVisit.add((ScheduleNode)((ScheduleEdge)it_edge.next()).getTarget());
 662         }
 663         it_edge = null;
 664       }
 665     }
 666     toVisit = null;
 667
 668     if(this.state.PRINTSCHEDULING) {
 669       SchedulingUtil.printScheduleGraph(
 670           this.state.outputdir + "scheduling_ori.dot", this.scheduleNodes);
 671     }
 672   }
 673
 674   private void handleDescenSEs(Vector<ScheduleEdge> ses,
 675                                boolean isflag) {
 676     if(isflag) {
 677       ScheduleEdge tempse = ses.elementAt(0);
 678       long temptime = tempse.getListExeTime();
 679       // find out the ScheduleEdge with least exeTime
 680       for(int k = 1; k < ses.size(); k++) {
 681         long ttemp = ses.elementAt(k).getListExeTime();
 682         if(ttemp < temptime) {
 683           tempse = ses.elementAt(k);
 684           temptime = ttemp;
 685         } // if(ttemp < temptime)
 686       } // for(int k = 1; k < ses.size(); k++)
 687       // handle the tempse
 688       handleScheduleEdge(tempse, true);
 689       ses.removeElement(tempse);
 690     }
 691     // handle other ScheduleEdges
 692     for(int k = 0; k < ses.size(); k++) {
 693       handleScheduleEdge(ses.elementAt(k), false);
 694     } // for(int k = 0; k < ses.size(); k++)
 695   }
 696
 697   private void CFSTGTransform() {
 698     // First iteration
 699     int i = 0;
 700
 701     // table of all schedule edges associated to one fedge
 702     Hashtable<FEdge, Vector<ScheduleEdge>> fe2ses =
 703       new Hashtable<FEdge, Vector<ScheduleEdge>>();
 704     // table of all fedges associated to one schedule node
 705     Hashtable<ScheduleNode, Vector<FEdge>> sn2fes =
 706       new Hashtable<ScheduleNode, Vector<FEdge>>();
 707     ScheduleNode preSNode = null;
 708     // Access the ScheduleEdges in reverse topology order
 709     for(i = scheduleEdges.size(); i > 0; i--) {
 710       ScheduleEdge se = (ScheduleEdge)scheduleEdges.elementAt(i-1);
 711       if(ScheduleEdge.NEWEDGE == se.getType()) {
 712         if(preSNode == null) {
 713           preSNode = (ScheduleNode)se.getSource();
 714         }
 715
 716         boolean split = false;
 717         FEdge fe = se.getFEdge();
 718         if(fe.getSource() == fe.getTarget()) {
 719           // the associated start fe is a back edge
 720           try {
 721             // check the number of newly created objs
 722             int repeat = (int)Math.ceil(se.getNewRate()*se.getProbability()/100);
 723             int rate = 0;
 724             /*if(repeat > 1) {
 725               // more than one new objs, expand the new edge
 726               for(int j = 1; j< repeat; j++ ) {
 727                 cloneSNodeList(se, true);
 728               } // for(int j = 1; j< repeat; j++ )
 729               se.setNewRate(1);
 730               se.setProbability(100);
 731             } // if(repeat > 1)*/
 732             try {
 733               // match the rates of obj creation and new obj consumption
 734               rate = (int)Math.ceil(
 735                   se.getListExeTime()/calInExeTime(se.getSourceFState()));
 736             } catch (Exception e) {
 737               e.printStackTrace();
 738             } // try-catch {}
 739             repeat = (rate > repeat)? rate : repeat;
 740             // expand the new edge
 741             for(int j = 1; j< repeat; j++ ) {
 742               cloneSNodeList(se, true);
 743             } // for(int j = 1; j< repeat; j++ )
 744             se.setNewRate(1);
 745             se.setProbability(100);
 746             /*for(int j = rate - 1; j > 0; j--) {
 747               for(int k = repeat; k > 0; k--) {
 748                 cloneSNodeList(se, true);
 749               } // for(int k = repeat; k > 0; k--)
 750             } // for(int j = rate - 1; j > 0; j--)*/
 751           } catch (Exception e) {
 752             e.printStackTrace();
 753             System.exit(-1);
 754           } // try-catch{}
 755         } else { // if(fe.getSource() == fe.getTarget())
 756           // the associated start fe is not a back edge
 757           // Note: if preSNode is not the same as se's source ScheduleNode
 758           // handle any ScheduleEdges previously put into fe2ses whose source
 759           // ScheduleNode is preSNode
 760           boolean same = (preSNode == se.getSource());
 761           if(!same) {
 762             // check the topology sort, only process those after se.getSource()
 763             if(preSNode.getFinishingTime() < se.getSource().getFinishingTime()){
 764               if(sn2fes.containsKey(preSNode)) {
 765                 Vector<FEdge> fes = sn2fes.remove(preSNode);
 766                 for(int j = 0; j < fes.size(); j++) {
 767                   FEdge tempfe = fes.elementAt(j);
 768                   Vector<ScheduleEdge> ses = fe2ses.get(tempfe);
 769                   boolean isflag = !(preSNode.edges().hasNext());
 770                   this.handleDescenSEs(ses, isflag);
 771                   ses = null;
 772                   fe2ses.remove(tempfe);
 773                 } // for(int j = 0; j < fes.size(); j++)
 774                 fes = null;
 775               }
 776             }
 777             preSNode = (ScheduleNode)se.getSource();
 778           } // if(!same)
 779
 780           if(fe.getTarget().edges().hasNext()) {
 781             // not associated with the last task, check if to split the snode
 782             if((!(se.getTransTime() < this.transThreshold))
 783                 && (se.getSourceCNode().getTransTime() < se.getTransTime())) {
 784               // it's better to transfer the other obj with preSnode
 785               split = true;
 786               splitSNode(se, true);
 787             }
 788           } // if(!fe.getTarget().edges().hasNext())
 789
 790           if(!split) {
 791             // delay the expanding and merging until we find all such 'new'
 792             // edges associated with a last task inside this ClassNode
 793             if(fe2ses.get(fe) == null) {
 794               fe2ses.put(fe, new Vector<ScheduleEdge>());
 795             }
 796             if(sn2fes.get((ScheduleNode)se.getSource()) == null) {
 797               sn2fes.put((ScheduleNode)se.getSource(), new Vector<FEdge>());
 798             }
 799             if(!fe2ses.get(fe).contains(se)) {
 800               fe2ses.get(fe).add(se);
 801             }
 802             if(!sn2fes.get((ScheduleNode)se.getSource()).contains(fe)) {
 803               sn2fes.get((ScheduleNode)se.getSource()).add(fe);
 804             }
 805           } // if(!split)
 806         } // if(fe.getSource() == fe.getTarget())
 807       } // if(ScheduleEdge.NEWEDGE == se.getType())
 808     } // for(i = scheduleEdges.size(); i > 0; i--)
 809     if(!fe2ses.isEmpty()) {
 810       Set<FEdge> keys = fe2ses.keySet();
 811       Iterator it_keys = keys.iterator();
 812       while(it_keys.hasNext()) {
 813         FEdge tempfe = (FEdge)it_keys.next();
 814         Vector<ScheduleEdge> ses = fe2ses.get(tempfe);
 815         boolean isflag = !(tempfe.getTarget().edges().hasNext());
 816         this.handleDescenSEs(ses, isflag);
 817         ses = null;
 818       }
 819       keys = null;
 820       it_keys = null;
 821     }
 822     fe2ses.clear();
 823     sn2fes.clear();
 824     fe2ses = null;
 825     sn2fes = null;
 826
 827     if(this.state.PRINTSCHEDULING) {
 828       SchedulingUtil.printScheduleGraph(
 829           this.state.outputdir + "scheduling_extend.dot", this.scheduleNodes);
 830     }
 831   }
 832
 833   private void handleScheduleEdge(ScheduleEdge se,
 834                                   boolean merge) {
 835     try {
 836       int rate = 0;
 837       int repeat = (int)Math.ceil(se.getNewRate() * se.getProbability() / 100);
 838       if(merge) {
 839         try {
 840           if(se.getListExeTime() == 0) {
 841             rate = repeat;
 842           } else {
 843             rate = (int)Math.ceil(
 844                 (se.getTransTime()-calInExeTime(se.getSourceFState()))
 845                 /se.getListExeTime());
 846           }
 847           if(rate < 0 ) {
 848             rate = 0;
 849           }
 850         } catch (Exception e) {
 851           e.printStackTrace();
 852         }
 853         if(0 == rate) {
 854           // clone the whole ScheduleNode lists starting with se's target
 855           for(int j = 1; j < repeat; j++ ) {
 856             cloneSNodeList(se, true);
 857           }
 858           se.setNewRate(1);
 859           se.setProbability(100);
 860         } else {
 861           repeat -= rate;
 862           if(repeat > 0) {
 863             // clone the whole ScheduleNode lists starting with se's target
 864             for(int j = 0; j < repeat; j++ ) {
 865               cloneSNodeList(se, true);
 866             }
 867             se.setNewRate(rate);
 868             se.setProbability(100);
 869           }
 870         }
 871         // merge the original ScheduleNode to the source ScheduleNode
 872         ((ScheduleNode)se.getSource()).mergeSEdge(se);
 873         scheduleNodes.remove(se.getTarget());
 874         scheduleEdges.remove(se);
 875         // As se has been changed into an internal edge inside a ScheduleNode,
 876         // change the source and target of se from original ScheduleNodes
 877         // into ClassNodes.
 878         if(se.getType() == ScheduleEdge.NEWEDGE) {
 879           se.setTarget(se.getTargetCNode());
 880           //se.setSource(se.getSourceCNode());
 881           //se.getTargetCNode().addEdge(se);
 882           se.getSourceCNode().addEdge(se);
 883         }
 884       } else {
 885         // clone the whole ScheduleNode lists starting with se's target
 886         for(int j = 1; j < repeat; j++ ) {
 887           cloneSNodeList(se, true);
 888         }
 889         se.setNewRate(1);
 890         se.setProbability(100);
 891       }
 892     } catch (Exception e) {
 893       e.printStackTrace();
 894       System.exit(-1);
 895     }
 896   }
 897
 898   private void cloneSNodeList(ScheduleEdge sEdge,
 899       boolean copyIE) throws Exception {
 900     Hashtable<ClassNode, ClassNode> cn2cn =
 901       new Hashtable<ClassNode, ClassNode>(); // hashtable from classnode in
 902                                              // orignal se's targe to cloned one
 903     ScheduleNode csNode =
 904       (ScheduleNode)((ScheduleNode)sEdge.getTarget()).clone(cn2cn, 0);
 905     scheduleNodes.add(csNode);
 906
 907     // Clone all the external in ScheduleEdges
 908     int i;
 909     if(copyIE) {
 910       Vector inedges = sEdge.getTarget().getInedgeVector();
 911       for(i = 0; i < inedges.size(); i++) {
 912         ScheduleEdge tse = (ScheduleEdge)inedges.elementAt(i);
 913         ScheduleEdge se;
 914         switch(tse.getType()) {
 915         case ScheduleEdge.NEWEDGE: {
 916           se = new ScheduleEdge(csNode,"new",tse.getFstate(),tse.getType(),0);
 917           se.setProbability(100);
 918           se.setNewRate(1);
 919           break;
 920         }
 921
 922         case ScheduleEdge.TRANSEDGE: {
 923           se = new ScheduleEdge(csNode,"transmit",tse.getFstate(),tse.getType(),0);
 924           se.setProbability(tse.getProbability());
 925           se.setNewRate(tse.getNewRate());
 926           break;
 927         }
 928
 929         default: {
 930           throw new Exception("Error: not valid ScheduleEdge here");
 931         }
 932         }
 933         se.setSourceCNode(tse.getSourceCNode());
 934         se.setTargetCNode(cn2cn.get(tse.getTargetCNode()));
 935         se.setFEdge(tse.getFEdge());
 936         se.setTargetFState(tse.getTargetFState());
 937         se.setIsclone(true);
 938         tse.getSource().addEdge(se);
 939         scheduleEdges.add(se);
 940       }
 941       inedges = null;
 942     } else {
 943       sEdge.getTarget().removeInedge(sEdge);
 944       sEdge.setTarget(csNode);
 945       csNode.getInedgeVector().add(sEdge);
 946       sEdge.setTargetCNode(cn2cn.get(sEdge.getTargetCNode()));
 947       sEdge.setIsclone(true);
 948     }
 949
 950     Queue<ScheduleNode> toClone = new LinkedList<ScheduleNode>(); // all nodes to be cloned
 951     Queue<ScheduleNode> clone = new LinkedList<ScheduleNode>();  //clone nodes
 952     Queue<Hashtable> qcn2cn = new LinkedList<Hashtable>(); // queue of the mappings of classnodes inside cloned ScheduleNode
 953     Vector<ScheduleNode> origins = new Vector<ScheduleNode>();  // queue of source ScheduleNode cloned
 954     Hashtable<ScheduleNode, ScheduleNode> sn2sn =
 955       new Hashtable<ScheduleNode, ScheduleNode>(); // mapping from cloned ScheduleNode to clone ScheduleNode
 956     clone.add(csNode);
 957     toClone.add((ScheduleNode)sEdge.getTarget());
 958     origins.addElement((ScheduleNode)sEdge.getTarget());
 959     sn2sn.put((ScheduleNode)sEdge.getTarget(), csNode);
 960     qcn2cn.add(cn2cn);
 961     while(!toClone.isEmpty()) {
 962       Hashtable<ClassNode, ClassNode> tocn2cn =
 963         new Hashtable<ClassNode, ClassNode>();
 964       csNode = clone.poll();
 965       ScheduleNode osNode = toClone.poll();
 966       cn2cn = qcn2cn.poll();
 967       // Clone all the external ScheduleEdges and the following ScheduleNodes
 968       Vector edges = osNode.getEdgeVector();
 969       for(i = 0; i < edges.size(); i++) {
 970         ScheduleEdge tse = (ScheduleEdge)edges.elementAt(i);
 971         ScheduleNode tSNode =
 972           (ScheduleNode)((ScheduleNode)tse.getTarget()).clone(tocn2cn, 0);
 973         scheduleNodes.add(tSNode);
 974         clone.add(tSNode);
 975         toClone.add((ScheduleNode)tse.getTarget());
 976         origins.addElement((ScheduleNode)tse.getTarget());
 977         sn2sn.put((ScheduleNode)tse.getTarget(), tSNode);
 978         qcn2cn.add(tocn2cn);
 979         ScheduleEdge se = null;
 980         switch(tse.getType()) {
 981         case ScheduleEdge.NEWEDGE: {
 982           se = new ScheduleEdge(tSNode,"new",tse.getFstate(),tse.getType(),0);
 983           break;
 984         }
 985
 986         case ScheduleEdge.TRANSEDGE: {
 987           se = new ScheduleEdge(tSNode,"transmit",tse.getFstate(),tse.getType(),0);
 988           break;
 989         }
 990
 991         default: {
 992           throw new Exception("Error: not valid ScheduleEdge here");
 993         }
 994         }
 995         se.setSourceCNode(cn2cn.get(tse.getSourceCNode()));
 996         se.setTargetCNode(tocn2cn.get(tse.getTargetCNode()));
 997         se.setFEdge(tse.getFEdge());
 998         se.setTargetFState(tse.getTargetFState());
 999         se.setProbability(tse.getProbability());
1000         se.setNewRate(tse.getNewRate());
1001         se.setIsclone(true);
1002         csNode.addEdge(se);
1003         scheduleEdges.add(se);
1004       }
1005       tocn2cn = null;
1006       edges = null;
1007     }
1008
1009     toClone = null;
1010     clone = null;
1011     qcn2cn = null;
1012     cn2cn.clear();
1013     cn2cn = null;
1014     origins = null;
1015     sn2sn = null;
1016   }
1017
1018   private long calInExeTime(FlagState fs) throws Exception {
1019     long exeTime = 0;
1020     ClassDescriptor cd = fs.getClassDescriptor();
1021     ClassNode cNode = cd2ClassNode.get(cd);
1022     exeTime = cNode.getFlagStates().elementAt(0).getExeTime() - fs.getExeTime();
1023     while(true) {
1024       Vector inedges = cNode.getInedgeVector();
1025       // Now that there are associate ScheduleEdges, there may be
1026       // multiple inedges of a ClassNode
1027       if(inedges.size() > 1) {
1028         throw new Exception("Error: ClassNode's inedges more than one!");
1029       }
1030       if(inedges.size() > 0) {
1031         ScheduleEdge sEdge = (ScheduleEdge)inedges.elementAt(0);
1032         cNode = (ClassNode)sEdge.getSource();
1033         exeTime += cNode.getFlagStates().elementAt(0).getExeTime();
1034       } else {
1035         break;
1036       }
1037       inedges = null;
1038     }
1039     exeTime = cNode.getScheduleNode().getExeTime() - exeTime;
1040     return exeTime;
1041   }
1042
1043   private ScheduleNode splitSNode(ScheduleEdge se,
1044                                   boolean copy) {
1045     assert(ScheduleEdge.NEWEDGE == se.getType());
1046
1047     FEdge fe = se.getFEdge();
1048     FlagState fs = (FlagState)fe.getTarget();
1049     FlagState nfs = (FlagState)fs.clone();
1050     fs.getEdgeVector().removeAllElements();
1051     nfs.getInedgeVector().removeAllElements();
1052     ClassNode sCNode = se.getSourceCNode();
1053
1054     // split the subtree whose root is nfs from the whole flag transition tree
1055     Vector<FlagState> sfss = sCNode.getFlagStates();
1056     Vector<FlagState> fStates = new Vector<FlagState>();
1057     Queue<FlagState> toiterate = new LinkedList<FlagState>();
1058     toiterate.add(nfs);
1059     fStates.add(nfs);
1060     while(!toiterate.isEmpty()) {
1061       FlagState tfs = toiterate.poll();
1062       Iterator it_edges = tfs.edges();
1063       while(it_edges.hasNext()) {
1064         FlagState temp = (FlagState)((FEdge)it_edges.next()).getTarget();
1065         if(!fStates.contains(temp)) {
1066           fStates.add(temp);
1067           toiterate.add(temp);
1068           sfss.removeElement(temp);
1069         }
1070       }
1071       it_edges = null;
1072     }
1073     sfss = null;
1074     Vector<FlagState> sFStates = FlagState.DFS.topology(fStates, null);
1075     fStates = null;
1076     // create a ClassNode and ScheduleNode for this subtree
1077     ClassNode cNode = new ClassNode(sCNode.getClassDescriptor(), sFStates);
1078     ScheduleNode sNode = new ScheduleNode(cNode, 0);
1079     cNode.setScheduleNode(sNode);
1080     cNode.setSorted(true);
1081     cNode.setTransTime(sCNode.getTransTime());
1082     classNodes.add(cNode);
1083     scheduleNodes.add(sNode);
1084     try {
1085       sNode.calExeTime();
1086     } catch (Exception e) {
1087       e.printStackTrace();
1088     }
1089     // flush the exeTime of fs and its ancestors
1090     fs.setExeTime(0);
1091     toiterate.add(fs);
1092     while(!toiterate.isEmpty()) {
1093       FlagState tfs = toiterate.poll();
1094       long ttime = tfs.getExeTime();
1095       Iterator it_inedges = tfs.inedges();
1096       while(it_inedges.hasNext()) {
1097         FEdge fEdge = (FEdge)it_inedges.next();
1098         FlagState temp = (FlagState)fEdge.getSource();
1099         long time = fEdge.getExeTime() + ttime;
1100         if(temp.getExeTime() > time) {
1101           temp.setExeTime(time);
1102           toiterate.add(temp);
1103         }
1104       }
1105       it_inedges = null;
1106     }
1107     toiterate = null;
1108
1109     // create a 'trans' ScheudleEdge between this new ScheduleNode and se's
1110     // source ScheduleNode
1111     ScheduleEdge sEdge =
1112       new ScheduleEdge(sNode, "transmit", fs, ScheduleEdge.TRANSEDGE, 0);
1113     sEdge.setFEdge(fe);
1114     sEdge.setSourceCNode(sCNode);
1115     sEdge.setTargetCNode(cNode);
1116     sEdge.setTargetFState(nfs);
1117     // TODO
1118     // Add calculation codes for calculating transmit time of an object
1119     sEdge.setTransTime(cNode.getTransTime());
1120     se.getSource().addEdge(sEdge);
1121     scheduleEdges.add(sEdge);
1122     // remove the ClassNodes and internal ScheduleEdges out of this subtree
1123     // to the new ScheduleNode
1124     ScheduleNode oldSNode = (ScheduleNode)se.getSource();
1125     Iterator it_isEdges = oldSNode.getScheduleEdgesIterator();
1126     Vector<ScheduleEdge> toremove = new Vector<ScheduleEdge>();
1127     Vector<ClassNode> rCNodes = new Vector<ClassNode>();
1128     rCNodes.addElement(sCNode);
1129     if(it_isEdges != null) {
1130       while(it_isEdges.hasNext()) {
1131         ScheduleEdge tse = (ScheduleEdge)it_isEdges.next();
1132         if(rCNodes.contains(tse.getSourceCNode())) {
1133           if(sCNode.equals(tse.getSourceCNode())) {
1134             if (!(tse.getSourceFState().equals(fs))
1135                 && (sFStates.contains(tse.getSourceFState()))) {
1136               tse.setSource(cNode);
1137               tse.setSourceCNode(cNode);
1138             } else {
1139               continue;
1140             }
1141           }
1142           sNode.getScheduleEdges().addElement(tse);
1143           sNode.getClassNodes().addElement(tse.getTargetCNode());
1144           rCNodes.addElement(tse.getTargetCNode());
1145           oldSNode.getClassNodes().removeElement(tse.getTargetCNode());
1146           toremove.addElement(tse);
1147         }
1148       }
1149     }
1150     it_isEdges = null;
1151     oldSNode.getScheduleEdges().removeAll(toremove);
1152     toremove.clear();
1153     // redirect ScheudleEdges out of this subtree to the new ScheduleNode
1154     Iterator it_sEdges = se.getSource().edges();
1155     while(it_sEdges.hasNext()) {
1156       ScheduleEdge tse = (ScheduleEdge)it_sEdges.next();
1157       if(!(tse.equals(se)) && !(tse.equals(sEdge))
1158           && (tse.getSourceCNode().equals(sCNode))) {
1159         if(!(tse.getSourceFState().equals(fs))
1160             && (sFStates.contains(tse.getSourceFState()))) {
1161           tse.setSource(sNode);
1162           tse.setSourceCNode(cNode);
1163           sNode.getEdgeVector().addElement(tse);
1164           toremove.add(tse);
1165         }
1166       }
1167     }
1168     it_sEdges = null;
1169     se.getSource().getEdgeVector().removeAll(toremove);
1170     toremove = null;
1171     rCNodes = null;
1172     sFStates = null;
1173
1174     try {
1175       if(!copy) {
1176         //merge se into its source ScheduleNode
1177         sNode.setCid(((ScheduleNode)se.getSource()).getCid());
1178         ((ScheduleNode)se.getSource()).mergeSEdge(se);
1179         scheduleNodes.remove(se.getTarget());
1180         scheduleEdges.removeElement(se);
1181         // As se has been changed into an internal edge inside a ScheduleNode,
1182         // change the source and target of se from original ScheduleNodes
1183         // into ClassNodes.
1184         if(se.getType() == ScheduleEdge.NEWEDGE) {
1185           se.setTarget(se.getTargetCNode());
1186           //se.setSource(se.getSourceCNode());
1187           //se.getTargetCNode().addEdge(se);
1188           se.getSourceCNode().addEdge(se);
1189         }
1190       } else {
1191         sNode.setCid(ScheduleNode.colorID++);
1192         handleScheduleEdge(se, true);
1193       }
1194     } catch (Exception e) {
1195       e.printStackTrace();
1196       System.exit(-1);
1197     }
1198
1199     return sNode;
1200   }
1201
1202   // TODO: restrict the number of generated scheduling according to the setted
1203   // scheduleThreshold
1204   private boolean coreMapping(int generateThreshold,
1205                               int skipThreshold) throws Exception {
1206     if(this.coreNum == -1) {
1207       throw new Exception("Error: un-initialized coreNum when doing scheduling.");
1208     }
1209
1210     if(this.scheduleGraphs == null) {
1211       this.scheduleGraphs = new Vector<Vector<ScheduleNode>>();
1212     }
1213
1214     int reduceNum = this.scheduleNodes.size() - this.coreNum;
1215
1216     // Combine some ScheduleNode if necessary
1217     // May generate multiple graphs suggesting candidate schedulings
1218     if(!(reduceNum > 0)) {
1219       // Enough cores, no need to combine any ScheduleNode
1220       this.scheduleGraphs.addElement(this.scheduleNodes);
1221       int gid = 1;
1222       if(this.state.PRINTSCHEDULING) {
1223         String path = this.state.outputdir + "scheduling_" + gid + ".dot";
1224         SchedulingUtil.printScheduleGraph(path, this.scheduleNodes);
1225       }
1226       return false;
1227     } else {
1228       SchedulingUtil.assignCids(this.scheduleNodes);
1229
1230       // Go through all the Schedule Nodes, organize them in order of their cid
1231       Vector<Vector<ScheduleNode>> sNodeVecs =
1232         SchedulingUtil.rangeScheduleNodes(this.scheduleNodes);
1233
1234       int gid = 1;
1235       boolean isBig = Math.pow(this.coreNum, reduceNum) > 1000;
1236       Random rand = new Random();
1237       if(isBig && state.BAMBOOCOMPILETIME) {
1238           CombinationUtil.RootsGenerator rGen =
1239                 CombinationUtil.allocateRootsGenerator(sNodeVecs,
1240                                                        this.coreNum);
1241           while((gid <= this.scheduleThreshold) && (rGen.nextGen())) {
1242               // first get the chosen rootNodes
1243               Vector<Vector<ScheduleNode>> rootNodes = rGen.getRootNodes();
1244               Vector<Vector<ScheduleNode>> nodes2combine = rGen.getNode2Combine();
1245
1246               CombinationUtil.CombineGenerator cGen =
1247                   CombinationUtil.allocateCombineGenerator(rootNodes,
1248                           nodes2combine);
1249               while((gid <= this.scheduleThreshold) && (cGen.randomGenE())) {
1250                   boolean implement = true;
1251                   /*if(isBig) {
1252                       implement = Math.abs(rand.nextInt()) % 100 > generateThreshold;
1253                   }*/
1254                   if(implement) {
1255                       Vector<Vector<CombinationUtil.Combine>> combine = cGen.getCombine();
1256                       Vector<ScheduleNode> sNodes =
1257                           SchedulingUtil.generateScheduleGraph(this.state,
1258                                   this.scheduleNodes,
1259                                   this.scheduleEdges,
1260                                   rootNodes,
1261                                   combine,
1262                                   gid++);
1263                       this.scheduleGraphs.add(sNodes);
1264                       sNodes = null;
1265                       combine = null;
1266                   } else if(Math.abs(rand.nextInt()) % 100 > skipThreshold){
1267                       break;
1268                   }
1269               }
1270               cGen.clear();
1271               rootNodes = null;
1272               nodes2combine = null;
1273           }
1274           rGen.clear();
1275           sNodeVecs = null;
1276       } else if (false) {
1277           CombinationUtil.RandomGenerator rGen =
1278                 CombinationUtil.allocateRandomGenerator(sNodeVecs,
1279                                                         this.coreNum);
1280           // random genenration
1281           while((gid <= this.scheduleThreshold) && (rGen.nextGen())) {
1282               Vector<Vector<ScheduleNode>> mapping = rGen.getMapping();
1283               boolean implement = true;
1284               if(isBig) {
1285                   implement = Math.abs(rand.nextInt()) % 100 > generateThreshold;
1286               }
1287               if(implement) {
1288                   Vector<ScheduleNode> sNodes =
1289                       SchedulingUtil.generateScheduleGraph(this.state,
1290                           this.scheduleNodes,
1291                           this.scheduleEdges,
1292                           mapping,
1293                           gid++);
1294                   this.scheduleGraphs.add(sNodes);
1295                   sNodes = null;
1296               }
1297               mapping = null;
1298           }
1299           rGen.clear();
1300           sNodeVecs = null;
1301       } else {
1302           CombinationUtil.RootsGenerator rGen =
1303                 CombinationUtil.allocateRootsGenerator(sNodeVecs,
1304                     this.coreNum);
1305       while((!isBig || (gid <= this.scheduleThreshold)) && (rGen.nextGen())) {
1306         // first get the chosen rootNodes
1307         Vector<Vector<ScheduleNode>> rootNodes = rGen.getRootNodes();
1308         Vector<Vector<ScheduleNode>> nodes2combine = rGen.getNode2Combine();
1309
1310         CombinationUtil.CombineGenerator cGen =
1311           CombinationUtil.allocateCombineGenerator(rootNodes,
1312                                                    nodes2combine);
1313         while((!isBig || (gid <= this.scheduleThreshold)) && (cGen.nextGen())) {
1314           boolean implement = true;
1315           if(isBig) {
1316             implement = Math.abs(rand.nextInt()) % 100 > generateThreshold;
1317           }
1318           if(implement) {
1319             Vector<Vector<CombinationUtil.Combine>> combine = cGen.getCombine();
1320             Vector<ScheduleNode> sNodes =
1321               SchedulingUtil.generateScheduleGraph(this.state,
1322                   this.scheduleNodes,
1323                   this.scheduleEdges,
1324                   rootNodes,
1325                   combine,
1326                   gid++);
1327             this.scheduleGraphs.add(sNodes);
1328             sNodes = null;
1329             combine = null;
1330           } else if(Math.abs(rand.nextInt()) % 100 > skipThreshold){
1331             break;
1332           }
1333         }
1334         cGen.clear();
1335         rootNodes = null;
1336         nodes2combine = null;
1337       }
1338       rGen.clear();
1339       sNodeVecs = null;
1340       }
1341       return isBig;
1342     }
1343   }
1344
1345   static class TaskInfo {
1346     public int m_numofexits;
1347     public long[] m_exetime;
1348     public double[] m_probability;
1349     public Vector<Hashtable<String, Integer>> m_newobjinfo;
1350     public int m_byObj;
1351
1352     public TaskInfo(int numofexits) {
1353       this.m_numofexits = numofexits;
1354       this.m_exetime = new long[this.m_numofexits];
1355       this.m_probability = new double[this.m_numofexits];
1356       this.m_newobjinfo = new Vector<Hashtable<String, Integer>>();
1357       for(int i = 0; i < this.m_numofexits; i++) {
1358         this.m_newobjinfo.add(null);
1359       }
1360       this.m_byObj = -1;
1361     }
1362   }
1363 }