View in EDS PDF Full Text

A Dynamic Storage Allocation Technique Based on Memory Residence Time.

Saved in:
Bibliographic Details
Title: A Dynamic Storage Allocation Technique Based on Memory Residence Time.
Authors: Beck, Leland L.1, Jones, Anita
Source: Communications of the ACM. Oct82, Vol. 25 Issue 10, p714-724. 11p. 1 Chart, 13 Graphs.
Subjects: Dynamic storage allocation (Computer science), Computer programming, Memory maps (Computer science), Computer memory management, Computer systems, Production scheduling
Abstract: A new dynamic storage allocation technique, the release-match method, is described. The memory utilization efficiency of this method is compared with that of the first-fit and best-fit methods, using a series of simulations. Results indicate that release-match gives significantly better memory utilization than first-fit or best-fit over a wide range of conditions. In addition, this method can be implemented with only minor increases in time and space overhead as compared with best-fit. The release-match method depends on prior knowledge of the memory residence time for each request. A modification of the release-match method which does not require such knowledge (the age-match method) is described; the performance of this method is investigated using a variety of request distributions. Age-match approaches the performance of release-match when the mean request size is a significant fraction of the total memory space. Its usefulness decreases as the coefficient of variation of the request lifetimes increases. The possibility of using release-match with estimated residence times is considered; some preliminary results are given, and a number of future directions for research are proposed. [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: 5495702
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A Dynamic Storage Allocation Technique Based on Memory Residence Time.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Beck%2C+Leland+L%2E%22">Beck, Leland L.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Jones%2C+Anita%22">Jones, Anita</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Oct82, Vol. 25 Issue 10, p714-724. 11p. 1 Chart, 13 Graphs.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Dynamic+storage+allocation+%28Computer+science%29%22">Dynamic storage allocation (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+programming%22">Computer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Memory+maps+%28Computer+science%29%22">Memory maps (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+memory+management%22">Computer memory management</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+systems%22">Computer systems</searchLink><br /><searchLink fieldCode="DE" term="%22Production+scheduling%22">Production scheduling</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: A new dynamic storage allocation technique, the release-match method, is described. The memory utilization efficiency of this method is compared with that of the first-fit and best-fit methods, using a series of simulations. Results indicate that release-match gives significantly better memory utilization than first-fit or best-fit over a wide range of conditions. In addition, this method can be implemented with only minor increases in time and space overhead as compared with best-fit. The release-match method depends on prior knowledge of the memory residence time for each request. A modification of the release-match method which does not require such knowledge (the age-match method) is described; the performance of this method is investigated using a variety of request distributions. Age-match approaches the performance of release-match when the mean request size is a significant fraction of the total memory space. Its usefulness decreases as the coefficient of variation of the request lifetimes increases. The possibility of using release-match with estimated residence times is considered; some preliminary results are given, and a number of future directions for research are proposed. [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=5495702
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/358656.358671
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 11
        StartPage: 714
    Subjects:
      – SubjectFull: Dynamic storage allocation (Computer science)
        Type: general
      – SubjectFull: Computer programming
        Type: general
      – SubjectFull: Memory maps (Computer science)
        Type: general
      – SubjectFull: Computer memory management
        Type: general
      – SubjectFull: Computer systems
        Type: general
      – SubjectFull: Production scheduling
        Type: general
    Titles:
      – TitleFull: A Dynamic Storage Allocation Technique Based on Memory Residence Time.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Beck, Leland L.
      – PersonEntity:
          Name:
            NameFull: Jones, Anita
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 10
              Text: Oct82
              Type: published
              Y: 1982
          Identifiers:
            – Type: issn-print
              Value: 00010782
          Numbering:
            – Type: volume
              Value: 25
            – Type: issue
              Value: 10
          Titles:
            – TitleFull: Communications of the ACM
              Type: main
ResultId 1