Optimization of Memory Hierarchies in Multiprogrammed Systems
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Anomalies with variable partition paging algorithms
Communications of the ACM
A cost oriented algorithm for data set allocation in storage hierarchies
Communications of the ACM
An anomaly in space-time characteristics of certain programs running in a paging machine
Communications of the ACM
PROGRAM RESTRUCTURING FOR VIRTUAL SYSTEMS
PROGRAM RESTRUCTURING FOR VIRTUAL SYSTEMS
STORAGE HIERARCHY SYSTEMS
On the inclusion properties for multi-level cache hierarchies
ISCA '88 Proceedings of the 15th Annual International Symposium on Computer architecture
On the inclusion properties for multi-level cache hierarchies
25 years of the international symposia on Computer architecture (selected papers)
Modeling multiprocessor computer systems with unbalanced flows
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Performance of Pruning-Cache Directories for Large-Scale Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
The Multi-Queue Replacement Algorithm for Second Level Buffer Caches
Proceedings of the General Track: 2002 USENIX Annual Technical Conference
A look-ahead data staging architecture for relational data base machines
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
Second-Level Buffer Cache Management
IEEE Transactions on Parallel and Distributed Systems
A consistency architecture for hierarchical shared caches
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
AFIPS '82 Proceedings of the June 7-10, 1982, national computer conference
| Hi-index | 0.00 |
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.