Description: Design program to simulate the first come first served FCFS, shortest seek time first SSTF, the working process of SCAN and cyclic SCAN algorithm. Assuming a n track number composed of the access sequence, given start track number m and head movement direction (forward or backward), respectively, using the disk scheduling algorithms of different access track sequence, head movement distance are given every visit, calculating the average search length of each kind of algorithm.
To Search:
File list (Check if you may need any files):
jsj11234_6.doc
Download