Author:
Gelenbe E.,Lenfant J.,Potier D.
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. E.G. Coffman, Analysis of a drum Input/Output Queue under Scheduled Operation in a Paged Computer System, J. ACM, vol. 16, n° 1 (1969), pp. 73–90.
2. A. Weingarten, The Eschenbach Drum Scheme, Comm. ACM, vol. 9, n° 7 (1966), pp. 509–512.
3. S. Fuller, An optimal Drum Scheduling Algorithm, IEEE Transactions on Computers, vol. C-21, n° 11 (1972) pp. 1153–1165.
4. W. Feller, An Introduction to Probability Theory and its Applications, vol. 1, 3rd ed., John Wiley, New York (1968).
5. H.S. Stone and S.H. Fuller, On the Near-Optimality of the Shortest-Latency-Time-First Drum Scheduling Discipline, Comm. ACM, vol. 16, n° 6 (1973), pp. 352–353.