What people are saying - Write a review
We haven't found any reviews in the usual places.
An Analysis of Drum Storage Units
Performance of an IO Channel with Multiple Paging Drums
7 other sections not shown
Other editions - View all
Abate and Dubner analysis approximation arcs assumption busy intervals central processor Chapter circular list circumference computer systems critical interval critical region defined denote devices discussed drum organization drum revolution drum scheduling algorithm drum's expected waiting exponentially distributed FIFO FIFO paging drum Figure fixed-head drum function Hence I/O channel I/O requests I/O waiting implementation integer INTEGER*2 INTRVL latency Lemma Markov chain minimal matching procedure moving-head disk MTPT algorithm MTPT disciplines MTPT scheduling algorithm MTPT scheduling discipline MTPT1 MTPT2 MTPTO number of cylinders ordered bipartite graph performance permutation permutation i|r Poisson process queueing models random arrivals random variables read-write heads record lengths rotating storage units rotational delays rotational latency scheduling discipline sector queue set of I/O shortest-latency-time-first shown in Fig single cycle permutation SLTF and MTPT SLTF discipline SLTF file drum SLTF paging drum starting addresses Step SUBROUTINE terminal node Theorem