sortsrt.java

来自「设计多个调度算法」· Java 代码 · 共 38 行

package dispatcher;

class sortSRT {
  public static int[] sort(int n[][]){
    int time=0;
    int a[]=new int[24];
    for(int i=0;i<24;i++)
      a[i]=-1;
    PNode p[]=new PNode[5];
    for(int i=0;i<5;i++){
      p[i]=new PNode();
    }
    for(int i=0;i<5;i++){
      p[i].number =i;
      p[i].arriveTime = n[0][i];
      p[i].serveTime =n[1][i];
    }
    PNode temp=p[0];
    while(time<24){
      int min=255;
      for(int i=0;i<5;i++){
        if(p[i].arriveTime <=time && p[i].serveTime>0 ){
          if(p[i].serveTime<min){
            min=p[i].serveTime ;
            temp=p[i];
          }
        }
      }
      if(min==255) time++;
      else{
        a[time++]=temp.number ;
        temp.serveTime--;
      }
    }

    return a;
  }
}