操作系统教程第三版课件（左万历）04第四章 互斥同步与通讯（1）1.pptVIP

读者／写者问题-Java solution public synchronized void endRead() { --readCount; if(readCount==0) dbReading=false; notifyAll(); } 调度算法 FCFS（first come first serve） 公平 效率低 (12,190,19,180,11,190…) SSTF（shortest seek time first） 效率高 磁道歧视 SCAN（elevator algorithm） 效率较高，较公平 Hansen管程实现SCAN算法 外部过程： 申请：require(dest:0..199) 释放：release() 使用方式： require(dest); {IO操作} --(管程外操作) release 管程实现SCAN算法 Type diskhead=MONITOR Var busy:boolean; headpos:0..199; direction:(up,down); cylinder:Array[0..199]Of condition; count:Array[0..199]Of integer; Define require, release; 管程实现SCAN算法 Procedure require(dest:0..199); Begin If busy Then Begin count[dest]:=count[dest]+1; wait(cylinder[dest]) End; busy:=true; If destheadpos Then direction:=down Else If destheadpos Then direction:=up; headpos:=dest End; 管程实现SCAN算法 Procedure upscan; Var I:0..200; Begin I:=headpos; While (I=199)and(count[I]=0) Do I:=I+1; If I=199 Then Begin count[I]:=count[I]-1; signal(cylinder[I]) End End; 管程实现SCAN算法 Procedure downscan; Var I:-1..199; Begin I:=headpos; While (I=0)and(count[I]=0) Do I:=I-1; If I=0 Then Begin count[I]:=count[I]-1; signal(cylinder[I]) End End; 管程实现SCAN算法 Procedure release; Begin busy:=false; If direction=up Then Begin upscan; downscan End Else Begin downscan; upscan End End; 管程实现SCAN算法 Procedure initialize