Propeties of storage hierarchy systems with multiple page sizes and redundant data
- 1 September 1979
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 4 (3) , 345-367
- https://doi.org/10.1145/320083.320095
Abstract
The need for high performance, highly reliable storage for very large on-line databases, coupled with rapid advances in storage device technology, has made the study of generalized storage hierarchies an important area of research. This paper analyzes properties of a data storage hierarchy system specifically designed for handling very large on-line databases. To attain high performance and high reliability, the data storage hierarchy makes use of multiple page sizes in different storage levels and maintains multiple copies of the same information across the storage levels. Such a storage hierarchy system is currently being designed as part of the INFOPLEX database computer project. Previous studies of storage hierarchies have primarily focused on virtual memories for program storage and hierarchies with a single page size across all storage levels and/or a single copy of information in the hierarchy. In the INFOPLEX design, extensions to the least recently used (LRU) algorithm are used to manage the storage levels. The read-through technique is used to initially load a referenced page of the appropriate size into all storage levels above the one in which the page is found. Since each storage level is viewed as an extension of the immediate higher level, an overflow page from level i is always placed in level i + 1. Important properties of these algorithms are derived. It is shown that depending on the types of algorithms used and the relative sizes of the storage levels, it is not always possible to guarantee that the contents of a given storage level i is always a superset of the contents of its immediate higher storage level i - 1. The necessary and sufficient conditions for this property to hold are identified and proved. Furthermore, it is possible that increasing the size of intermediate storage levels may actually increase the number of references to lower storage levels, resulting in reduced performance. Conditions necessary to avoid such an anomaly are also identified and proved.Keywords
This publication has 7 references indexed in Scilit:
- Anomalies with variable partition paging algorithmsCommunications of the ACM, 1978
- A cost oriented algorithm for data set allocation in storage hierarchiesCommunications of the ACM, 1975
- Experiments on Page Size, Program Access Patterns, and Virtual Memory PerformanceIBM Journal of Research and Development, 1972
- Virtual MemoryACM Computing Surveys, 1970
- Optimization of Memory Hierarchies in Multiprogrammed SystemsJournal of the ACM, 1970
- An anomaly in space-time characteristics of certain programs running in a paging machineCommunications of the ACM, 1969
- A study of replacement algorithms for a virtual-storage computerIBM Systems Journal, 1966