Back to Search
Start Over
Storage Utilization in a Memory Hierarchy When Storage Assignment Is Performed by a Hashing Algorithm.
- Source :
- Communications of the ACM; Mar1971, Vol. 14 Issue 3, p172-175, 4p, 1 Diagram, 3 Graphs
- Publication Year :
- 1971
-
Abstract
- The utilization of storage is studied in a two-level memory hierarchy. The first storage level, which is the fast store, is divided into a number of storage areas. When an entry is to be filed in the hierarchy, a hashing algorithm will attempt to place the entry into one of these areas. If this particular area is full, then the entry will be placed into the slower second-level store, even though other areas in the first-level store may have space available. Given that N entries have been filed in the entire hierarchy, an expression is derived for the expected number of entries filed in the first-level store. This expression gives a measure of how effectively the first-level store is being used. By means of examples, storage utilization is then studied as a function of the hashing algorithm, the number of storage areas into which the first-level store is divided and the total size of the first-level store. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00010782
- Volume :
- 14
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- Communications of the ACM
- Publication Type :
- Periodical
- Accession number :
- 5226485
- Full Text :
- https://doi.org/10.1145/362566.362570