research-article

Improving the Performance of Buddy Systems

Authors:

I P Page,

J HaginsAuthors Info & Claims

IEEE Transactions on Computers, Volume 35, Issue 5

Pages 441 - 447

https://doi.org/10.1109/TC.1986.1676786

Published: 01 May 1986 Publication History

Publisher Site

Abstract

This paper discusses ways of reducing fragmentation ion in buddy systems. Although internal fragmentation may be estimated for any buddy system, external fragmentation cannot be determined theoretically. It is suggested here that mean external fragmentation for any buddy system is directly related to the height of the associated binary tree. Simulation studies with a new buddy system support this conjecture. Attempts at reducing internal fragmentation have, in the past, increased the tree height covering the range of request sizes and given rise to a commensurate increase in external fragmentation. A new buddy system is described which supports a large number of buddy sizes without requiring a large tree height. The new scheme is a modified form of the weighted buddy method, entitled the dual buddy system. It provides the same set of block sizes as the weighted scheme but has the same tree height as the binary buddy system. Simulation results show that mean external fragmentation is within four percent of that of the binary system and much lower than that of the weighted scheme. The new system has better overall storage utilization han others for uniform random request sizes.

References

[1]

K. C. Knowlton, "A fast storage allocator," Commun. Ass. Comput. Mach., vol. 8, pp. 623-625, Oct. 1965.

Digital Library

Google Scholar

[2]

I. P. Page, "Optimal fit of arbitrary sized segments," Brit. Comput. J., vol. 25, pp. 32-33, Jan. 1982.

Crossref

Google Scholar

[3]

J. L. Peterson and T. A. Norman, "Buddy systems," Commun. Ass. Comput. Mach., vol. 20, pp. 421-431, June 1977.

Digital Library

Google Scholar

[4]

P. W. Purdom and S. M. Stigler, "Statistical properties of the buddy system," J. Ass. Comput. Mach., vol. 17, pp. 683-697, Oct. 1970.

Digital Library

Google Scholar

[5]

J. L. Peterson, "Dynamic storage allocation with buddy systems," in Proc. 4th Texas Conf. Comput. Architect., Nov. 1975, pp. 2B4-1- 2B4-6.

Google Scholar

[6]

K. K. Shen and J. L. Peterson, "A weighted buddy system for dynamic storage allocation," Commun. Ass. Comput. Mach., vol. 17, pp. 558- 562, Oct. 1974.

Digital Library

Google Scholar

[7]

T. A. Norman, "Tailored buddy systems for dynamic storage allocation," in Proc. 4th Texas Conf. Comput. Architect., Nov. 1975, pp. 2B3-1- 2B3-5.

Google Scholar

[8]

D. S. Hirschberg, "A class of dynamic memory allocation algorithms," Commun. Ass. Comput. Mach., vol. 16, pp. 615-618, Oct. 1973.

Digital Library

Google Scholar

[9]

V. C. Harris and C. C. Styles, "A generalization of Fibonacci numbers," Fibonacci Quarterly, vol. 2, no. 4, pp. 227-289, Dec. 1964.

Google Scholar

[10]

H. R. P. Ferguson, "On a generalization of the Fibonacci numbers useful in memory allocation schema," Fibonacci Quarterly, vol. 14, no. 3, pp. 233-243, Oct. 1976.

Google Scholar

[11]

I. P. Page and J. Hagins, "Improving the performance of buddy systems," Dep. Comput. Sci., Univ. Texas, Dallas, Tech. Rep. CS-203.

Google Scholar

[12]

B. Cranston and R. A. Thomas, "A simplified recombination scheme for the Fibonacci buddy system," Commun. Ass. Comput. Mach., vol. 18, pp. 331-332, June 1975.

Digital Library

Google Scholar

Cited By

View all

Liang YLi JAusavarungnirun RPan RShi LKuo TXue CGavrilovska AZadok E(2020)AcclaimProceedings of the 2020 USENIX Conference on Usenix Annual Technical Conference10.5555/3489146.3489208(897-910)Online publication date: 15-Jul-2020
https://dl.acm.org/doi/10.5555/3489146.3489208
Liang YLi QXue CYadgar GNoh S(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
https://dl.acm.org/doi/10.5555/3357062.3357072
Higuera-Toledano M(2014)Building the Java Heap with Bricks in an Embedded Real-Time EnvironmentProceedings of the 2014 IEEE/ACM 18th International Symposium on Distributed Simulation and Real Time Applications10.1109/DS-RT.2014.16(57-66)Online publication date: 1-Oct-2014
https://dl.acm.org/doi/10.1109/DS-RT.2014.16
Show More Cited By

Index Terms

Improving the Performance of Buddy Systems
1. Computing methodologies
  1. Artificial intelligence
    1. Computer vision
      1. Computer vision problems
  2. Computer graphics
    1. Image manipulation
2. Hardware
  1. Integrated circuits
    1. Semiconductor memory
      1. Dynamic memory

Recommendations

Buddy systems

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 ...
Internal Fragmentation in a Class of Buddy Systems

A general class of buddy systems is defined and the overallocation of memory due to internal fragmentation is examined. It is shown that, for a uniform distribution of requests, the overallocation varies between $2x_{1}/(x_{1}+1)$ and $\frac{1}{2}(x_{1}+1)...
A weighted buddy method for dynamic storage allocation

An extension of the buddy method, called the weighted buddy method, for dynamic storage allocation is presented. The weighted buddy method allows block sizes of 2^k and 3·2^k, whereas the original buddy method allowed only block sizes of 2^k. This ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers

IEEE Transactions on Computers Volume 35, Issue 5

May 1986

99 pages

ISSN:0018-9340

Editor:
Theo Pavlidis

Issue’s Table of Contents

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 May 1986

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Liang YLi JAusavarungnirun RPan RShi LKuo TXue CGavrilovska AZadok E(2020)AcclaimProceedings of the 2020 USENIX Conference on Usenix Annual Technical Conference10.5555/3489146.3489208(897-910)Online publication date: 15-Jul-2020
https://dl.acm.org/doi/10.5555/3489146.3489208
Liang YLi QXue CYadgar GNoh S(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
https://dl.acm.org/doi/10.5555/3357062.3357072
Higuera-Toledano M(2014)Building the Java Heap with Bricks in an Embedded Real-Time EnvironmentProceedings of the 2014 IEEE/ACM 18th International Symposium on Distributed Simulation and Real Time Applications10.1109/DS-RT.2014.16(57-66)Online publication date: 1-Oct-2014
https://dl.acm.org/doi/10.1109/DS-RT.2014.16
Park HBaek SChoi JLee DNoh S(2013)Regularities considered harmfulACM SIGPLAN Notices10.1145/2499368.245113748:4(181-192)Online publication date: 16-Mar-2013
https://dl.acm.org/doi/10.1145/2499368.2451137
Park HBaek SChoi JLee DNoh S(2013)Regularities considered harmfulACM SIGARCH Computer Architecture News10.1145/2490301.245113741:1(181-192)Online publication date: 16-Mar-2013
https://dl.acm.org/doi/10.1145/2490301.2451137
Park HBaek SChoi JLee DNoh SSarkar VBodik R(2013)Regularities considered harmfulProceedings of the eighteenth international conference on Architectural support for programming languages and operating systems10.1145/2451116.2451137(181-192)Online publication date: 16-Mar-2013
https://dl.acm.org/doi/10.1145/2451116.2451137
Min HYi SCho YHong JCho YWainwright RHaddad HShin SKoo Y(2007)An efficient dynamic memory allocator for sensor operating systemsProceedings of the 2007 ACM symposium on Applied computing10.1145/1244002.1244254(1159-1164)Online publication date: 11-Mar-2007
https://dl.acm.org/doi/10.1145/1244002.1244254
Johnstone MWilson P(1998)The memory fragmentation problemACM SIGPLAN Notices10.1145/301589.28686434:3(26-36)Online publication date: 1-Oct-1998
https://dl.acm.org/doi/10.1145/301589.286864
Johnstone MWilson PJones SJones R(1998)The memory fragmentation problemProceedings of the 1st international symposium on Memory management10.1145/286860.286864(26-36)Online publication date: 1-Oct-1998
https://dl.acm.org/doi/10.1145/286860.286864
Chang JGehringer E(1996)A High-Performance Memory Allocator for Object-Oriented SystemsIEEE Transactions on Computers10.1109/12.48557445:3(357-366)Online publication date: 1-Mar-1996
https://dl.acm.org/doi/10.1109/12.485574
Show More Cited By

Abstract

References

Cited By

Index Terms

Recommendations

Buddy systems

Internal Fragmentation in a Class of Buddy Systems

A weighted buddy method for dynamic storage allocation

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations