	CSTC Resource Cover Page
Title	An Investigation of Disk Scheduling Algorithms
Summary	A) Students study a program that simulates disk scheduling algorithms and answer questions about it. The program is written in Pascal. B) Students run the program, collect results, graph the results, and answer questions about the algorithms. The two algorithms used are FCFS and SSTF. C) Students add the look algorithm to the simulation program. D) Students read a research article and answer some questions about it. Note: Parts A, C, and D are not crucial and could be included or skipped. This laboratory project requires a Pascal compiler. The students would benefit from using some type of graphing software, to display the data generated by the program. This project requires about 45 minutes of the student before the lab session, and about 4 hours to complete all of the parts. Note that not all the parts need be completed in lab. The lab cover sheet at the address provided has more specific timing information. View this lab
Author	Daniel Joyce Villanova University http://www.csc.vill.edu/~joyce/home.html joyce@vill.edu
Platform requirements	Pascal compiler
Supplemental information	Date Submitted: Thu Jun 12 14:47:16 EDT 1997 Subject: Computer Systems Organization - Performance of Systems Keywords: operating systems simulation disk scheduling

CSTC Resource Cover Page