文件名称:ll
介绍说明－－下载内容均来自于网络，请自行研究使用
1． 本实验是模拟操作系统的磁盘寻道方式，运用磁盘访问顺序的不同来设计磁盘的调度算法。
2． 实现的磁盘调度算法有FCFS，SSTF，SCAN，CSCAN和 NStepSCAN算法。
3． 设定开始磁道号寻道范围，依据起始扫描磁道号和最大磁道号数，随机产生要进行寻道的磁道号序列。
4． 选择磁盘调度算法，显示该算法的磁道访问顺序，计算出移动的磁道总数和平均寻道总数。
-1. This experiment is a simulation of the operating system disk seek ways, using different sequential disk access scheduling algorithm to design a disk.
2. Disk scheduling algorithms are FCFS, SSTF, SCAN, CSCAN and NStepSCAN algorithm.
3. Set the starting track number seek range, according to track number and start scanning the maximum number of track number, track number randomly generated sequence to be Seeker.
4. Select the disk scheduling algorithm, display track access order of the algorithm to calculate the total number of tracks and the total average seek to move.
2． 实现的磁盘调度算法有FCFS，SSTF，SCAN，CSCAN和 NStepSCAN算法。
3． 设定开始磁道号寻道范围，依据起始扫描磁道号和最大磁道号数，随机产生要进行寻道的磁道号序列。
4． 选择磁盘调度算法，显示该算法的磁道访问顺序，计算出移动的磁道总数和平均寻道总数。
-1. This experiment is a simulation of the operating system disk seek ways, using different sequential disk access scheduling algorithm to design a disk.
2. Disk scheduling algorithms are FCFS, SSTF, SCAN, CSCAN and NStepSCAN algorithm.
3. Set the starting track number seek range, according to track number and start scanning the maximum number of track number, track number randomly generated sequence to be Seeker.
4. Select the disk scheduling algorithm, display track access order of the algorithm to calculate the total number of tracks and the total average seek to move.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
ll.txt