Analysis of Drum and Disk Storage Units |
Contents
An Analysis of Drum Storage Units | 13 |
3 | 69 |
An Optimal Drum Scheduling Algorithm | 108 |
Copyright | |
11 other sections not shown
Other editions - View all
Common terms and phrases
analysis arcs assumption busy intervals central processor Chapter circular list computer systems critical interval critical region CURCYL defined drum organization drum revolutions drum scheduling algorithm endpoints expected waiting exponentially distributed f node f₁ FIFO Figure fixed-head drum FORTRAN function greedy algorithm Hence I/O channel I/O requests I/O waiting implementation INTEGER INTRVL latency Lemma Markov mean I/O minimal matching procedure moving-head disk MTPT algorithm MTPT disciplines MTPT scheduling algorithm MTPT scheduling discipline MTPT sequence MTPTO NlogN number of cylinders ordered bipartite graph paging drum performance permutation queueing models random arrivals random variables read-write heads record lengths RESCHD rotating storage units rotational delays SCAN scheduling discipline sector queue set of I/O Shellsort shown in Fig simulation single cycle permutation SLTF and MTPT SLTF discipline SLTF file drum starting address Step SUBROUTINE terminal node Theorem total latency uniformly distributed zero cost interchange