A simplified recombination scheme for the Fibonacci buddy system

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A simplified recombination scheme for the Fibonacci buddy system

Full text

Pdf (177 KB)

Source

Communications of the ACM archive
Volume 18 , Issue 6 (June 1975) table of contents

Pages: 331 - 332

Year of Publication: 1975

ISSN:0001-0782

Authors

Ben Cranston	Univ. of Maryland, College Park
Rick Thomas	Univ. of Maryland, College Park D

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 43, Citation Count: 6

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/360825.360854 What is a DOI?

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Daniel S. Hirschberg, A class of dynamic memory allocation algorithms, Communications of the ACM, v.16 n.10, p.615-618, Oct. 1973 [doi>10.1145/362375.362392]
	2	Hinds, James A. An algorithm for locating adjacent storage blocks in the buddy system (in preparation).
	3	Donald E. Knuth, The Art of Computer Programming Volumes 1-3 Boxed Set, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1998
	4	Basili, V., and Turner, J. SIMPL-T, a structured programming language. CN-14, U. of Maryland, College Park, Md.

CITED BY 6

	Warren Burton, A buddy system variation for disk storage allocation, Communications of the ACM, v.19 n.7, p.416-417, July 1976
	James L. Peterson , Theodore A. Norman, Buddy systems, Communications of the ACM, v.20 n.6, p.421-431, June 1977
	Norman R. Nielsen, Dynamic memory allocation in computer simulation, Communications of the ACM, v.20 n.11, p.864-873, Nov. 1977
	Divakar Yadav , A. K. Chaturvedi , Snehil Pansari , Avart Krishnan, Memory management: tertiary buddy system, Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications, p.46-49, January 25-27, 2008, Acapulco, Mexico
	R. Trimble, Storage management in IBM APL systems, IBM Systems Journal, v.30 n.4, p.456-468, 1991
	G. Bozman , W. Buco , T. P. Daly , W. H. Tetzlaff, Analysis of free-storage algorithms: revisited, IBM Systems Journal, v.23 n.1, p.44-64, March 1984