ACM Home Page
Please provide us with feedback. Feedback
An Analysis of Drum Storage Units
Full text PdfPdf (1.52 MB)
Source Journal of the ACM (JACM) archive
Volume 22 ,  Issue 1  (January 1975) table of contents
Pages: 83 - 105  
Year of Publication: 1975
ISSN:0004-5411
Authors
Samuel H. Fuller  Departments of Computer Science and Electrical Engineering, Carnegie-Mellon University, Pittsburgh, PA
Forest Baskett  Departments of Computer Science and Electrical Engineering, Stanford University, Stanford, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 20,   Citation Count: 4
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321864.321871
What is a DOI?

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
ABATE, J., AND DUBNER, I-i. Optimizing the performance of a drum-hke storage. IEEE Trans. on Computers C-18, 11 (Nov 1969), 992-996
 
2
ABRAMOW1TZ, M , AND STEGVN, I A Handbook of Mathematical Functwns National Bureau of Standards, Applied Mathematics Serms 55, June 1964.
 
3
BURROUaUS CORP Burroughs B6375 &sk file optimizer New Product Announcement, Burroughs Corp , Detroit, Mich , Feb 1970
4
 
5
COX, D R , AND SMITH, W L Queues. Monographs on Apphed Probability and Statistics, Chapman and Hall Ltd, London, 1961
 
6
DENNING, P J Effects of scheduling on file memory operations Proc AFIPS 1967 SJCC, Vol 30, AFIPS Press, Montvale, N J, pp. 9-21
 
7
FELLER, W An Introduction to Probab~.l~.ly Theory and Its Apphcatmns, Vol i. Wiley, New York, 1968.
 
8
FELLER, WAn Introductwn to Probab,hty Theory and Its Appl,catwns, Vol ~ Wiley, New York, 1970.
 
9
FULLER, S H A simulator of computer systems with storage units having rotatmnal delays Tech Note 17, D2g~tal Systems Laboratory, Stanford U, Stanford, Cahf, Aug 1972
 
10
FULLER, S H An optlmal drum scheduling algorithm. IEEE Trans on Computers C-21, 11 (Nov 1972), 1153-1165
 
11
FULLER, S H., Pmcn, T G , AND WILHELM, N C Measurement and analysis of a multiprogrammed computer system IEEE Workshop on Measurement and Performance Evaluation, Argonne, Ill., Oct. 1971.
12
 
13
GORDON, W J, AND NEWELL, G F Closed queuemg systems with exponential servers Oper Res 15 (1967), 254-265
 
14
IBM IBM 2835 storage control and IBM 2305 fixed head storage module Form GA26-1589-2, IBM Corp , San Jose, Callf
 
15
JACKSON, J F Jobshop-like queuemg systems Manage Sc~ 16, 1 (Oct. 1963), 131-142
 
16
JEWELL, W.S.A simple proof of L = kW Oper Res 15 (1967), 1109-1116
 
17
 
18
SAATY, T L Elements of Queuezng Theory McGraw-Hill, New York, 1961.
 
19
SKINNER, C. E Priority queuemg systems with server-walking tmle. Oper. Res 15, 2 (1967), 278-285
20


Collaborative Colleagues:
Samuel H. Fuller: colleagues
Forest Baskett: colleagues