Description: 1, for a given set of as disk access scheduling: Request service ABCDEFGHIJK access track to reach No. 30 50 100 1,802,090,150,708,010,160 2, the requests were a first-come, first served, shortest seek first, and elevator scheduling method of scheduling. 3, the algorithm required to give each disk access order to calculate the average number of mobile channel. 4, assuming that the current read-write head 90 to move the direction of increasing track number.
To Search:
File list (Check if you may need any files):
磁盘调度
........\cpdd.cpp
........\cpdd.dsp
........\cpdd.dsw
........\cpdd.ncb
........\cpdd.opt
........\cpdd.plg
........\Debug
........\.....\cpdd.exe
........\.....\cpdd.ilk
........\.....\cpdd.obj
........\.....\cpdd.pch
........\.....\cpdd.pdb
........\.....\vc60.idb
........\.....\vc60.pdb
........\操作系统实验(进程调度+存储管理+磁盘调度++银行家算法+文件系统设计).doc
Download