ACM Home Page
Please provide us with feedback. Feedback
A class of dynamic memory allocation algorithms
Full text PdfPdf (336 KB)
Source
Communications of the ACM archive
Volume 16 ,  Issue 10  (October 1973) table of contents
Pages: 615 - 618  
Year of Publication: 1973
ISSN:0001-0782
Author
Daniel S. Hirschberg  Princeton Univ., Princeton, NJ
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 83,   Citation Count: 15
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/362375.362392
What is a DOI?

ABSTRACT

A new dynamic memory allocation algorithm, the Fibonacci system, is introduced. This algorithm is similar to, but seems to have certain advantages over, the “buddy” system. A generalization is mentioned which includes both of these systems as special cases.


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
2
 
3
Knuth, D.E. The Art of Computer Programmhtg, Vol. 1 (2nd printing). Addison-Wesley, Reading, Mass., 1968, pp. 435-455.
 
4
Minker, J., et al. Analysis of data processing systems. Tech. Rept. 69-99, U. of Maryland, College Park, Md., 1969.
5

CITED BY  16

Collaborative Colleagues:
Daniel S. Hirschberg: colleagues