Disk-scheduling

说明：  ① 理解和掌握常用的磁盘调度算法的内容和原理。磁盘是可被多个进程共享的设备。当有 多个进程都请求访问磁盘时，应采用一种适当的调度算法，以使各个进程对磁盘的平均访问(主要是寻道)时间最小。 ② 通过本实验，使用先来先服务算法、最短寻道时间优先算法、扫描算法，模拟实现一个简单的磁盘调度系统。
(The understanding and grasp of the commonly used disk scheduling algorithm content and principle. The disk can be shared by multiple processes equipment. When there isMultiple processes all requests to access a disk, should adopt an appropriate scheduling algorithm, to make the process of disk average access (mainly seek ) minimum time.II through this experiment, using a first come first serve algorithm, shortest seek time first algorithm, sweep algorithm, simulation of the realization of a simple disk scheduling system.)