Nothing Special   »   [go: up one dir, main page]

skip to main content
article
Free access

A simplified recombination scheme for the Fibonacci buddy system

Published: 01 June 1975 Publication History

Abstract

A simplified recombination scheme for the Fibonacci buddy system which requires neither tables nor repetitive calculations and uses only two additional bits per buffer is presented.

References

[1]
Hirschberg, D.A class of dytnamic memory allocation algorithms. Comm. ACM16, 10 (Oct. 1973), 615-618.
[2]
Hinds, James A. An algorithm for locating adjacent storage blocks in the buddy system (in preparation).
[3]
Knuth, D. The Art of Computer Programming, Vol. 1. Addi- Wesley, Reading, Mass., 1968, pp. 443-444.
[4]
Basili, V., and Turner, J. SIMPL-T, a structured programming language. CN-14, U. of Maryland, College Park, Md.

Cited By

View all
  • (2021)Spring Buddy: A Self-Adaptive Elastic Memory Management Scheme for Efficient Concurrent Allocation/Deallocation in Cloud Computing Systems2021 IEEE 27th International Conference on Parallel and Distributed Systems (ICPADS)10.1109/ICPADS53394.2021.00056(402-409)Online publication date: Dec-2021
  • (2020)AcclaimProceedings of the 2020 USENIX Conference on Usenix Annual Technical Conference10.5555/3489146.3489208(897-910)Online publication date: 15-Jul-2020
  • (2019)Mismatched memory management of Android smartphonesProceedings of the 11th USENIX Conference on Hot Topics in Storage and File Systems10.5555/3357062.3357072(7-7)Online publication date: 8-Jul-2019
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Communications of the ACM
Communications of the ACM  Volume 18, Issue 6
June 1975
51 pages
ISSN:0001-0782
EISSN:1557-7317
DOI:10.1145/360825
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1975
Published in CACM Volume 18, Issue 6

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Fibonacci buddy system
  2. buddy system
  3. dynamic storage allocation

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)125
  • Downloads (Last 6 weeks)12
Reflects downloads up to 16 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2021)Spring Buddy: A Self-Adaptive Elastic Memory Management Scheme for Efficient Concurrent Allocation/Deallocation in Cloud Computing Systems2021 IEEE 27th International Conference on Parallel and Distributed Systems (ICPADS)10.1109/ICPADS53394.2021.00056(402-409)Online publication date: Dec-2021
  • (2020)AcclaimProceedings of the 2020 USENIX Conference on Usenix Annual Technical Conference10.5555/3489146.3489208(897-910)Online publication date: 15-Jul-2020
  • (2019)Mismatched memory management of Android smartphonesProceedings of the 11th USENIX Conference on Hot Topics in Storage and File Systems10.5555/3357062.3357072(7-7)Online publication date: 8-Jul-2019
  • (2015)iBuddy: Inverse Buddy for Enhancing Memory Allocation/Deallocation Performanceon Multi-Core SystemsIEEE Transactions on Computers10.1109/TC.2013.229604964:3(720-732)Online publication date: 1-Mar-2015
  • (2010)Tertiary buddy system for efficient dynamic memory allocationProceedings of the 9th WSEAS international conference on Software engineering, parallel and distributed systems10.5555/1807733.1807742(61-66)Online publication date: 20-Feb-2010
  • (2005)Fast allocation and deallocation with an improved buddy systemActa Informatica10.5555/2697438.269765641:4-5(273-291)Online publication date: 1-Mar-2005
  • (2005)Fast allocation and deallocation with an improved buddy systemActa Informatica10.1007/s00236-004-0159-641:4-5(273-291)Online publication date: Mar-2005
  • (2005)Dynamic storage allocation: A survey and critical reviewMemory Management10.1007/3-540-60368-9_19(1-116)Online publication date: 1-Jun-2005
  • (2000)Fast Allocation and Deallocation with an Improved Buddy SystemFoundations of Software Technology and Theoretical Computer Science10.1007/3-540-46691-6_7(84-96)Online publication date: 9-Jun-2000
  • (1991)Storage management in IBM APL systemsIBM Systems Journal10.1147/sj.304.045630:4(456-468)Online publication date: 1-Oct-1991
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media