View in EDS PDF Full Text

Dynamic Memory Allocation in Computer Simulation.

Saved in:
Bibliographic Details
Title: Dynamic Memory Allocation in Computer Simulation.
Authors: Nielsen, Norman R.1
Source: Communications of the ACM. Nov1977, Vol. 20 Issue 11, p864-873. 10p.
Subjects: Dynamic storage allocation (Computer science), Algorithms, Simulation methods & models, Memory maps (Computer science), SIMSCRIPT (Computer program language), Computer simulation, Mathematical optimization, Storage fragmentation (Computer science)
Abstract: This paper investigates the performance of 35 dynamic memory allocation algorithms when used to service simulation programs as represented by 18 test cases. Algorithm performance was measured in terms of processing time, memory usage, and external memory fragmentation. Algorithms maintaining separate free space lists for each size of memory block used tended to perform quite well compared with other algorithms. Simple algorithms operating on memory ordered lists (without any free list) performed surprisingly well. Algorithms employing power-of-two block sizes had favorable processing requirements hut generally unfavorable memory usage. Algorithms employing LIFO, FIFO, or memory ordered free lists generally performed poorly compared with others. [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: 17862544
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Dynamic Memory Allocation in Computer Simulation.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Nielsen%2C+Norman+R%2E%22">Nielsen, Norman R.</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>. Nov1977, Vol. 20 Issue 11, p864-873. 10p.
– 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="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Simulation+methods+%26+models%22">Simulation methods & models</searchLink><br /><searchLink fieldCode="DE" term="%22Memory+maps+%28Computer+science%29%22">Memory maps (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22SIMSCRIPT+%28Computer+program+language%29%22">SIMSCRIPT (Computer program language)</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+simulation%22">Computer simulation</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+optimization%22">Mathematical optimization</searchLink><br /><searchLink fieldCode="DE" term="%22Storage+fragmentation+%28Computer+science%29%22">Storage fragmentation (Computer science)</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This paper investigates the performance of 35 dynamic memory allocation algorithms when used to service simulation programs as represented by 18 test cases. Algorithm performance was measured in terms of processing time, memory usage, and external memory fragmentation. Algorithms maintaining separate free space lists for each size of memory block used tended to perform quite well compared with other algorithms. Simple algorithms operating on memory ordered lists (without any free list) performed surprisingly well. Algorithms employing power-of-two block sizes had favorable processing requirements hut generally unfavorable memory usage. Algorithms employing LIFO, FIFO, or memory ordered free lists generally performed poorly compared with others. [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=17862544
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/359863.359890
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 10
        StartPage: 864
    Subjects:
      – SubjectFull: Dynamic storage allocation (Computer science)
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Simulation methods & models
        Type: general
      – SubjectFull: Memory maps (Computer science)
        Type: general
      – SubjectFull: SIMSCRIPT (Computer program language)
        Type: general
      – SubjectFull: Computer simulation
        Type: general
      – SubjectFull: Mathematical optimization
        Type: general
      – SubjectFull: Storage fragmentation (Computer science)
        Type: general
    Titles:
      – TitleFull: Dynamic Memory Allocation in Computer Simulation.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Nielsen, Norman R.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 11
              Text: Nov1977
              Type: published
              Y: 1977
          Identifiers:
            – Type: issn-print
              Value: 00010782
          Numbering:
            – Type: volume
              Value: 20
            – Type: issue
              Value: 11
          Titles:
            – TitleFull: Communications of the ACM
              Type: main
ResultId 1