Skip to main content
SpringerLink
Log in

On the worst case performance of buddy systems

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

The worst-case performance of both binary and Fibonacci buddy systems is analyzed. For both unrestricted and allocation-only request sequences, exact bounds on both the external and total fragmentation are derived.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bromley, A.G.: Memory fragmentation in buddy methods for dynamic storage allocation. Acta Inf. 14, 107–118 (1980)

    Google Scholar 

  2. Hirschberg, D.S.: A class of dynamic memory allocation algorithms. Commun. ACM 16, 615–618 (1973)

    Google Scholar 

  3. Knowlton, K.C.: A fast storage allocator. Commun. ACM 8, 623–625 (1965)

    Google Scholar 

  4. Knuth, D.E.: The Art of Computer Programming 1, p. 634. Fundamental Algorithms, 2nd edition. Reading, MA: Addison-Wesley 1973

  5. Krogdahl, S.: A dynamic storage allocation problem. Inf. Process. Letters 2, 96–99 (1973)

    Google Scholar 

  6. Loui, M.C.: Simulations among multidimensional Turing Machines. Theor. Comput. Sci. 21, 145–161 (1982)

    Google Scholar 

  7. Loui, M.C.: Minimizing access pointers into trees and arrays. J. Comput. Syst. Sci. (To appear)

  8. Loui, M.C.: Optimal dynamic embedding of trees into arrays. SIAM J. Comput. 12, 463–472 (1983)

    Google Scholar 

  9. Peterson, D.L., Norman, T.A.: Buddy systems. Commun. ACM 20, 421–431 (1977)

    Google Scholar 

  10. Purdom, P.W., Stigler, S.M.: Statistical properties of the buddy system. J. ACM 17, 683–697 (1970)

    Google Scholar 

  11. Robson, J.M.: An estimate of the store size necessary for dynamic storage allocation. J. ACM 18, 416–423 (1971)

    Google Scholar 

  12. Robson, J.M.: Bounds for some functions concerning dynamic storage allocation. J. ACM 21, 491–499 (1974)

    Google Scholar 

  13. Russell, D.L.: Internal fragmentation in a class of buddy systems. SIAM J. Comput. 6, 607–621 (1977)

    Google Scholar 

  14. Shen, K.K., Peterson, J.L.: A weighted buddy system method for dynamic storage allocation. Commun. ACM 17, 558–562 (1974); 18, 202 (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Pittsburgh, 15260, Pittsburgh, PA, USA

    Errol L. Lloyd

  2. University of Illinois, 61801, Urbana, IL, USA

    Michael C. Loui

Authors
  1. Errol L. Lloyd
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael C. Loui
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Partially supported under NSF Grant MCS-8103713

Partially supported under NSF Grant IST-8012242

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lloyd, E.L., Loui, M.C. On the worst case performance of buddy systems. Acta Informatica 22, 451–473 (1985). https://doi.org/10.1007/BF00288778

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00288778

Keywords

Search

Navigation