熱點推薦:
您现在的位置: 電腦知識網 >> 編程 >> 操作系統 >> 正文

十大題型算法全實現——(八)作業調度[4]

2013-11-15 15:49:35  來源: 操作系統 

  cout<1)"<

  for(i=0;i

  cout<

  ege<

  }

  }

  }

  //FIFO算法

  void FIFO()

  {

  int i;

  int current_hour;

  int current_minute;

  int total_time=0;

  //輸出作業流

  cout<

  cout<

  cout<<"---------------------------------------------------------------"<

  cout.setf(2);

  cout<

  current_hour=jobs[0].reach_hour;

  current_minute=jobs[0].reach_minite;

  for(i=0;i

  jobs[i].start_time=current_hour*100+current_minute;

  jobs[i].wait_time=(current_hour-jobs[i].reach_hour)*60+(current_minute-jobs[i].reach_minite)+jobs[i

  ].need_time;

  cout<

  time<

  current_hour=current_hour+(jobs[i].need_time+current_minute)/60;

[1]  [2]  [3]  [4]  [5]  [6]  [7]  [8]  [9]  


From:http://tw.wingwit.com/Article/program/czxt/201311/24021.html
    推薦文章
    Copyright © 2005-2013 電腦知識網 Computer Knowledge   All rights reserved.