PSA優先級調度算法（搶占式）（java）處理機調度算法：Priorityschedulingalgorithm優先級調度算法（搶占式）運?結果流程圖

PSA優先級調度算法（搶占式）（java）處理機調度算法：Priorityschedulingalgorithm優先級調度算法（搶占式）運?結果流程圖---------------------java代碼------------------------packageoperate;importjava.util.*;/***優先級調度算法*搶占式（單處理機）*@authorymj*@Date：2019/12/1522:53*/publicclassPSA2{staticScannercin=newScanner(System.in);/**進程控制塊*/staticclass---------------------java代碼------------------------packageoperate;importjava.util.*;/***優先級調度算法*搶占式（單處理機）*@authorymj*@Date：2019/12/1522:53*/publicclassPSA2{staticScannercin=newScanner(System.in);/**進程控制塊*/staticclassPCBimplementsComparable<PCB>{intid;//進程idintarriveTime;//到達時間intrunTime;//運?時間（要求服務時間）inthasRanTime=0;//已經運?時間，初始值為0intPRI;//優先級doubleresponseRatio;//響應?=(等待時間+要求服務時間)/要求服務時間intresponseTime;//響應時間==?次運?時間-到達時間intturnAroundTime;//周轉時間intwaitTime;//等待時間publicPCB(intid,intarriveTime,intrunTime,intPRI){this.id=id;this.arriveTime=arriveTime;this.runTime=runTime;this.PRI=PRI;}@Override@OverridepublicintcompareTo(PCBo){//按照到達時間進?就緒隊列returnthis.arriveTime-o.arriveTime;}}staticPCB[]pcbs;/**到達隊列*/staticQueue<PCB>queue=newPriorityQueue<>();/**計算當前進程響應?*/staticvoidcalculateResponseRatio(PCBpcb,intcurrentTime){pcb.waitTime=currentTime+1-pcb.arriveTime;//等待時間pcb.responseRatio=(pcb.waitTime+pcb.runTime)*1.0/pcb.runTime;}/**初始化PCB信息*/staticvoidinitPCB(){System.out.print((輸?進程數：輸?進程數：);intnum=cin@OverridepublicintcompareTo(PCBo){//按照到達時間進?就緒隊列returnthis.arriveTime-o.arriveTime;}}staticPCB[]pcbs;/**到達隊列*/staticQueue<PCB>queue=newPriorityQueue<>();/**計算當前進程響應?*/staticvoidcalculateResponseRatio(PCBpcb,intcurrentTime){pcb.waitTime=currentTime+1-pcb.arriveTime;//等待時間pcb.responseRatio=(pcb.waitTime+pcb.runTime)*1.0/pcb.runTime;}/**初始化PCB信息*/staticvoidinitPCB(){System.out.print((輸?進程數：輸?進程數：);intnum=cin.nextInt();pcbs=newPCB[num+1];System.out.println((輸?到達時間，運?時間,優先級優先級);for(inti=1;i<=num;i++){System.out.print((進程進程+i+);pcbs[i]=newPCB(i,cin.nextInt(),cin.nextInt(),cin.nextInt());queue.offer(pcbs[i]);}}/**判斷當前已經到達的進程，判斷進程的響應?并使之進?就緒隊列*/staticbooleanjudge(Queue<PCB>readyQueue,intcurrentTime){booleanflag=false;//為true表?有到達的進程while(true){PCBpcb=queue.peek();//最先到達的進程if(pcb==null){//所有進程都已經進?了就緒隊列break;}elseif(pcb.arriveTime<=currentTime){//當前有進程到達PCBrunPCB=queue.poll();readyQueue.offer(runPCB);//進?就緒隊列---等待運?flag=true;}else{//當前沒有進程到達break;}}returnflag;}/**進程進?處理機運?,如果進程運?結束返回true*/staticbooleanprocessRun(PCBpcb,intcurrentTime){if(pcb.hasRanTime==0){//進程?次運?時間pcb.responseTime=currentTime;}pcb.hasRanTime++;//進?處理機運?System.out.printf((,pcb.id);if(pcb.hasRanTime==pcb.runTime){//進程已經結束pcb.turnAroundTime=currentTime+1-pcb.arriveTime;//周轉時間pcb.waitTime=pcb.turnAroundTime-pcb.runTime;//等待時間pcb.responseTime-=pcb.arriveTime;returntrue;}else{System.out.println();returnfalse;}}/**計算并打印就緒隊列中的進程*//**計算并打印就緒隊列中的進程*/staticvoidprintReadyProcess(Queue<PCB>queue,intcurrentTime){Iterator<PCB>iterator=queue.iterator();System.out.print((就緒隊列就緒隊列);while(iterator.hasNext()){PCBpcb=iterator.next();calculateResponseRatio(pcb,currentTime);System.out.printf((進程%d優先級優先級,pcb.id,pcb.PRI);}System.out.println();}/**處理機運?*/staticvoidrun(){intcurrentTime=0;//當前時間if(!queue.isEmpty()){currentTime=queue.peek().arriveTime;}/**定義就緒隊列,根據作業長短低-?排序*/Queue<PCB>readyQueue=/**計算并打印就緒隊列中的進程*/staticvoidprintReadyProcess(Queue<PCB>queue,intcurrentTime){Iterator<PCB>iterator=queue.iterator();System.out.print((就緒隊列就緒隊列);while(iterator.hasNext()){PCBpcb=iterator.next();calculateResponseRatio(pcb,currentTime);System.out.printf((進程%d優先級優先級,pcb.id,pcb.PRI);}System.out.println();}/**處理機運?*/staticvoidrun(){intcurrentTime=0;//當前時間if(!queue.isEmpty()){currentTime=queue.peek().arriveTime;}/**定義就緒隊列,根據作業長短低-?排序*/Queue<PCB>readyQueue=newPriorityQueue<PCB>(newComparator<PCB>(){@Overridepublicintcompare(PCBo1,PCBo2){if(o1.PRI!=o2.PRI){return(o2.PRI-o1.PRI)>0?1:-1;}else{returno1.arriveTime-o2.arriveTime;}}});PCBrunPcb=null;System.out.println((正在運?的進程正在運?的進程);while(true){System.out.printf((,currentTime);if(queue.isEmpty()&&readyQueue.isEmpty()&&runPcb==null){System.out.println((當前所有進程運?結束當前所有進程運?結束);break;}else{//進程進?處理機運?if(judge(readyQueue,currentTime)==true){//此時有新到的進程//當前處理機上的進程就要下處理機if(runPcb!=null){//處理機占?中readyQueue.offer(runPcb);//進?就緒隊列runPcb=null;//此時處理機為空閑}}if(runPcb!=null){//處理機上還有進程/**在處理機中運?進程-->runPCB*/if(processRun(runPcb,currentTime)==true){//運?后進程已經結束printReadyProcess(readyQueue,currentTime);runPcb=null;}}else{//處理機空閑runPcb=readyQueue.poll();//出就緒隊列，if(runPcb==null){//就緒隊列為空,意味著此時處理機空閑，?且沒有到達的進程currentTime++;//處理機等待System.out.printf((處理機空閑處理機空閑);continue;//進?下?輪}else{//出就緒隊列，上處理機運?if(processRun(runPcb,currentTime)==true){//運?后進程已經結束printReadyProcess(readyQueue,currentTime);runPcb=null;}}}}/**時間?+1*/currentTime++;}}}publicstaticvoidmain(String[]args){initPCB();System.out.println((處理機開始運?處理機開始運?);run();System.out.println((處理機運?結束處理機運?結束);showTurnAroundTime();}//周轉時間privatestaticvoidshowTurnAroundTime(){doubleaverageT=0;doubleaverageWTAT=0;double}/**時間?+1*/currentTime++;}}}publicstaticvoidmain(String[]args){initPCB();System.out.println((處理機開始運?處理機開始運?);run();System.out.println((處理機運?結束處理機運?結束);showTurnAroundTime();}//周轉時間privatestaticvoidshowTurnAroundTime(){doubleaverageT=0;doubleaverageWTAT=0;doubleaverageWT=0;System.out.println((進程周轉時間帶權周轉時間等待時間等待時間);for(inti=1;i<pcbs.length;i++){intturnAroundTime=pcbs[i].turnAroundTime;doubleweightTurnAroundTime=turnAroundTime*1.0/pcbs[i].runTime;intwaitTime=pcbs[i].waitTime;System.out.printf((,i,turnAroundTime,weightTurnAroundTime,waitTime);averag