哈夫曼树带权路径长度_c 哈夫曼树编码_数据结构哈夫曼树编码(6)

for(int time =1;!waiting.empty()||!workload.empty();time++){ while(!workload.empty() && time ==

workload.front().arrival_time()){

evt= workload.front();

osf<<" Arriving: "<

workload.pop();

}

if(!waiting.empty() && time >= finish_time){

totaljob ++;

evt = waiting.front();

agg_latency += time - evt.arrival_time();

osf<<" Servicing: "<

finish_time = time + evt.getjob().getnumpages() * seconds_per_page;

}

}

osf<<" total job "<

osf<<" aggregate latency: "<

osf<<" mean latency : "<

return;

}

if(file.find("bigfirst") != string::npos){

string outfile = "bigfirst.out";

ofstream osf(outfile.c_str());

loadworkload(file);

osf<<"FIFO Simulation "<

for(int time

=1;!priority_waiting.empty()||!workload.empty();time++){

while(!workload.empty() && time ==

workload.front().arrival_time()){

evt= workload.front();

osf<<" Arriving: "<

workload.pop();

}

if(!priority_waiting.empty() && time >= finish_time){

totaljob ++;

evt = priority_waiting.top();

agg_latency += time - evt.arrival_time();

osf<<" Servicing: "<

finish_time = time + evt.getjob().getnumpages() * seconds_per_page; }

}

osf<<" total job "<

osf<<" aggregate latency: "<

osf<<" mean latency : "<

return;

}

cerr<<"The program dont know what algorithm to use"<

本文来自电脑杂谈，转载请注明本文网址：
http://www.pc-fly.com/a/jisuanjixue/article-35162-6.html