View in EDS PDF Full Text

Storage Utilization in a Memory Hierarchy When Storage Assignment Is Performed by a Hashing Algorithm.

Saved in:
Bibliographic Details
Title: Storage Utilization in a Memory Hierarchy When Storage Assignment Is Performed by a Hashing Algorithm.
Authors: Williams, John G.1, Ashenhurst, R. L.
Source: Communications of the ACM. Mar1971, Vol. 14 Issue 3, p172-175. 4p. 1 Diagram, 3 Graphs.
Subjects: Memory hierarchy (Computer science), Hashing, Algorithms, Computer storage devices, Electronic file management, Computer storage device industry
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]
Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 5226485
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Storage Utilization in a Memory Hierarchy When Storage Assignment Is Performed by a Hashing Algorithm.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Williams%2C+John+G%2E%22">Williams, John G.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Ashenhurst%2C+R%2E+L%2E%22">Ashenhurst, R. L.</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Mar1971, Vol. 14 Issue 3, p172-175. 4p. 1 Diagram, 3 Graphs.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Memory+hierarchy+%28Computer+science%29%22">Memory hierarchy (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Hashing%22">Hashing</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+storage+devices%22">Computer storage devices</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+file+management%22">Electronic file management</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+storage+device+industry%22">Computer storage device industry</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=5226485
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/362566.362570
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 4
        StartPage: 172
    Subjects:
      – SubjectFull: Memory hierarchy (Computer science)
        Type: general
      – SubjectFull: Hashing
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Computer storage devices
        Type: general
      – SubjectFull: Electronic file management
        Type: general
      – SubjectFull: Computer storage device industry
        Type: general
    Titles:
      – TitleFull: Storage Utilization in a Memory Hierarchy When Storage Assignment Is Performed by a Hashing Algorithm.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Williams, John G.
      – PersonEntity:
          Name:
            NameFull: Ashenhurst, R. L.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Mar1971
              Type: published
              Y: 1971
          Identifiers:
            – Type: issn-print
              Value: 00010782
          Numbering:
            – Type: volume
              Value: 14
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Communications of the ACM
              Type: main
ResultId 1