Optimization of Memory Hierarchies in Multiprogrammed Systems
Journal of the ACM (JACM)
Implications of certain assumptions in database performance evauation
ACM Transactions on Database Systems (TODS)
Propeties of storage hierarchy systems with multiple page sizes and redundant data
ACM Transactions on Database Systems (TODS)
The Logical Record Access Approach to Database Design
ACM Computing Surveys (CSUR)
Long term file migration: development and evaluation of algorithms
Communications of the ACM
Database cost analysis: a top-down approach
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Design and performance tools for data base systems
VLDB '77 Proceedings of the third international conference on Very large data bases - Volume 3
MARC: MVS archival storage and recovery program
IBM Systems Journal
An object placement advisor for DB2 using solid state storage
Proceedings of the VLDB Endowment
| Hi-index | 48.23 |
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.