ACM Home Page
Please provide us with feedback. Feedback
A cost oriented algorithm for data set allocation in storage hierarchies
Full text PdfPdf (495 KB)
Source
Communications of the ACM archive
Volume 18 ,  Issue 6  (June 1975) table of contents
Pages: 318 - 322  
Year of Publication: 1975
ISSN:0001-0782
Authors
V. Y. Lum  IBM Research Lab, San Jose, CA
M. E. Senko  IBM Research Lab, San Jose, CA
C. P. Wang  IBM Research Lab, San Jose, CA
H. Ling  IBM Research Lab, San Jose, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 10,   Citation Count: 6
Additional Information:

abstract   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/360825.360843
What is a DOI?

ABSTRACT

Data set allocation in today's multilevel storage systems is usually based on qualitative, ad hoc decisions. While it would be desirable to obtain an optimal solution to this allocation problem, it is clear that the number of parameters involved makes it intractable to straight-forward solution. In such a situation, we must find a set of assumptions which simplify the problem greatly, but which still provide a basis for considering all significant cost elements. This paper presents such a first, quantitative allocation step. It considers many of the significant detailed costs of system utilization, data storage, data staging, and data migration. Although many avenues of further improvement are available, the present algorithm seems to be usefully accurate. As such, it can aid in quantifying the problems of data set allocation, storage system configuration, and new device designs.


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
Arora, S.R., and Gallo, A. Optimal sizing, loading, and reloading in a multi-level memory hierarchy system. Proc. AFIPS 1971 SJCC. Vol. 38, AFIPS Press, Montvale, N.J., pp. 337-344.
2
 
3
Anacker, W., and Wang, C.P. Performance Evaluation of Computing Systems with Memory Hierarchies, IEEE Trans. EIC. (Dec. 1967), 764-773.
 
4
Yeh, A.C. An application cf statistical methodology in the study of computer system performance. IBM Internal Tech. Rep., Poughkeepsie, N.Y.
 
5
CPU Utilization in San Jose Research Computing Facility. Private communication.
 
6
Senko, M.E., Lum, V.Y., and Owens, P. J. A File Organization Evaluation Model (FOREM). Proc. IF1P Cong., 1968.
 
7
Lure, V.Y., Senko, M.E., Ling, H., and Barlow, J.H. Quantitative timing analysis and verification for file organization modeling. Prce. 4th Internat. Symp. on Computer and Information Sci., 1972, pp. 377-386.


Collaborative Colleagues:
V. Y. Lum: colleagues
M. E. Senko: colleagues
C. P. Wang: colleagues
H. Ling: colleagues