View in EDS PDF Full Text

Buddy System.

Saved in:
Bibliographic Details
Title: Buddy System.
Authors: Peterson, James L.1, Norman, Theodore A.2, Gaines, R. S.
Source: Communications of the ACM. Jun77, Vol. 20 Issue 6, p421-431. 11p. 7 Diagrams, 5 Charts, 2 Graphs.
Subjects: Algorithms, Dynamic storage allocation (Computer science), Computer programming, Memory maps (Computer science), Storage fragmentation (Computer science), Computer science
Abstract: Two algorithms are presented for implementing any of a class of buddy systems for dynamic storage allocation. Each buddy system corresponds to a set of recurrence relations which relate the block sizes provided to each other. Analyses of the internal fragmentation of the binary buddy system, the Fibonacci buddy system, and the weighted buddy system are given. Comparative simulation results are also presented for internal, external, and total fragmentation. [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: 5225292
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Buddy System.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Peterson%2C+James+L%2E%22">Peterson, James L.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Norman%2C+Theodore+A%2E%22">Norman, Theodore A.</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Gaines%2C+R%2E+S%2E%22">Gaines, R. S.</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Jun77, Vol. 20 Issue 6, p421-431. 11p. 7 Diagrams, 5 Charts, 2 Graphs.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><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="%22Storage+fragmentation+%28Computer+science%29%22">Storage fragmentation (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+science%22">Computer science</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Two algorithms are presented for implementing any of a class of buddy systems for dynamic storage allocation. Each buddy system corresponds to a set of recurrence relations which relate the block sizes provided to each other. Analyses of the internal fragmentation of the binary buddy system, the Fibonacci buddy system, and the weighted buddy system are given. Comparative simulation results are also presented for internal, external, and total fragmentation. [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=5225292
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/359605.359626
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 11
        StartPage: 421
    Subjects:
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Dynamic storage allocation (Computer science)
        Type: general
      – SubjectFull: Computer programming
        Type: general
      – SubjectFull: Memory maps (Computer science)
        Type: general
      – SubjectFull: Storage fragmentation (Computer science)
        Type: general
      – SubjectFull: Computer science
        Type: general
    Titles:
      – TitleFull: Buddy System.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Peterson, James L.
      – PersonEntity:
          Name:
            NameFull: Norman, Theodore A.
      – PersonEntity:
          Name:
            NameFull: Gaines, R. S.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 06
              Text: Jun77
              Type: published
              Y: 1977
          Identifiers:
            – Type: issn-print
              Value: 00010782
          Numbering:
            – Type: volume
              Value: 20
            – Type: issue
              Value: 6
          Titles:
            – TitleFull: Communications of the ACM
              Type: main
ResultId 1