| A disk head scheduling simulator |
| Full text |
Pdf
(185 KB)
|
| Source
|
Technical Symposium on Computer Science Education
archive
Proceedings of the 35th SIGCSE technical symposium on Computer science education
table of contents
Norfolk, Virginia, USA
SESSION: Operating systems
table of contents
Pages: 325 - 329
Year of Publication: 2004
ISBN:1-58113-798-2
Also published in ...
|
|
Author
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 18, Downloads (12 Months): 58, Citation Count: 0
|
|
|
ABSTRACT
Disk head scheduling is a standard topic in undergraduate operating systems courses. Disk drives were once fairly simple devices with little intelligence. Disk head scheduling and bad block mapping were done exclusively by operating systems. As disk drives became larger and faster, they took on some of these tasks. Modern drives often have a large cache and hide their internal structure from the outside world. In spite of changes in disk technology, the teaching of disk head scheduling has changed little over the last decade. This paper describes a disk head scheduling simulator that allows students to explore traditional disk scheduling algorithms as well as the consequences of modern disk technology. The simulator, which is written in Java and is freely available, can be run remotely from a browser or downloaded for local execution. We present methods for modifying the traditional curriculum to make the presentation of disk head scheduling more relevant and interesting.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Denning, P. J., "Effects of scheduling on file memory operations," AFIPS Spring Joint Computer Conference, April 1967, pp. 9--21.
|
| |
2
|
|
| |
3
|
SOURCE Robbins, S., A disk head scheduling simulator, 2003. Online. Internet. Available WWW: \httpfont http://vip.cs.utsa.edu/nsf/disk/
|
| |
4
|
|
| |
5
|
Stallings, W., Operating Systems, Second Edition, Prentice Hall, 1995.
|
| |
6
|
|
 |
7
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE conference on Design automation
Gwo-Dong Chen
, Daniel D. Gajski
|