Skip to main navigation Skip to search Skip to main content

Variations on the binary buddy system for dynamic memory management

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Two new variations of the binary buddy system for dynamic storage bookkeeping are introduced. These variations, the revised buddy system and the tailored-lists buddy system, recombine smaller memory blocks only upon necessity in an attempt to save on processor execution time. Simulation results comparing the three systems reveal that the two new variations are superior to the original buddy system, since they are faster and the difference in memory utilization is insignificant, A comparison of the re-vised system and the tailored-lists system indicates that they are equal in performance.

Original languageEnglish
Title of host publicationProceedings of the 18th Annual Southeast Regional Conference, ACM-SE 1980
PublisherAssociation for Computing Machinery, Inc
Pages73-78
Number of pages6
ISBN (Electronic)0897910141, 9780897910149
DOIs
StatePublished - Mar 24 1980
Event18th Annual Southeast Regional Conference, ACM-SE 1980 - Tallahassee, United States
Duration: Mar 24 1980Mar 26 1980

Publication series

NameProceedings of the 18th Annual Southeast Regional Conference, ACM-SE 1980

Conference

Conference18th Annual Southeast Regional Conference, ACM-SE 1980
Country/TerritoryUnited States
CityTallahassee
Period03/24/8003/26/80

Keywords

  • Binary buddy system
  • Dynamic storage allocation
  • Fragmentation
  • Revised buddy system
  • Tailored-lists buddy system

Fingerprint

Dive into the research topics of 'Variations on the binary buddy system for dynamic memory management'. Together they form a unique fingerprint.

Cite this