View in EDS PDF Full Text

A Cost Oriented Algorithm for Data Set Allocation in Storage Hierarchies.

Saved in:
Bibliographic Details
Title: A Cost Oriented Algorithm for Data Set Allocation in Storage Hierarchies.
Authors: Lum, V. Y.1, Senko, M. E.1, Wang, C. P.1, Ling, H.1
Source: Communications of the ACM. Jun75, Vol. 18 Issue 6, p318-322. 5p. 3 Charts.
Subjects: Information storage & retrieval systems, Dynamic storage allocation (Computer science), Cost control, Databases, Decision making, Computer programming, Electronic information resources, Algorithms
Abstract: 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. [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: 5206794
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A Cost Oriented Algorithm for Data Set Allocation in Storage Hierarchies.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Lum%2C+V%2E+Y%2E%22">Lum, V. Y.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Senko%2C+M%2E+E%2E%22">Senko, M. E.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Wang%2C+C%2E+P%2E%22">Wang, C. P.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Ling%2C+H%2E%22">Ling, H.</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Jun75, Vol. 18 Issue 6, p318-322. 5p. 3 Charts.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Information+storage+%26+retrieval+systems%22">Information storage & retrieval systems</searchLink><br /><searchLink fieldCode="DE" term="%22Dynamic+storage+allocation+%28Computer+science%29%22">Dynamic storage allocation (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Cost+control%22">Cost control</searchLink><br /><searchLink fieldCode="DE" term="%22Databases%22">Databases</searchLink><br /><searchLink fieldCode="DE" term="%22Decision+making%22">Decision making</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+programming%22">Computer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+information+resources%22">Electronic information resources</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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. [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=5206794
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/360825.360843
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 5
        StartPage: 318
    Subjects:
      – SubjectFull: Information storage & retrieval systems
        Type: general
      – SubjectFull: Dynamic storage allocation (Computer science)
        Type: general
      – SubjectFull: Cost control
        Type: general
      – SubjectFull: Databases
        Type: general
      – SubjectFull: Decision making
        Type: general
      – SubjectFull: Computer programming
        Type: general
      – SubjectFull: Electronic information resources
        Type: general
      – SubjectFull: Algorithms
        Type: general
    Titles:
      – TitleFull: A Cost Oriented Algorithm for Data Set Allocation in Storage Hierarchies.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Lum, V. Y.
      – PersonEntity:
          Name:
            NameFull: Senko, M. E.
      – PersonEntity:
          Name:
            NameFull: Wang, C. P.
      – PersonEntity:
          Name:
            NameFull: Ling, H.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 06
              Text: Jun75
              Type: published
              Y: 1975
          Identifiers:
            – Type: issn-print
              Value: 00010782
          Numbering:
            – Type: volume
              Value: 18
            – Type: issue
              Value: 6
          Titles:
            – TitleFull: Communications of the ACM
              Type: main
ResultId 1