A Class of Dynamic Memory Allocation Algorithms.
Saved in:
| Title: | A Class of Dynamic Memory Allocation Algorithms. |
|---|---|
| Authors: | Hirschberg, Daniel S.1, Weissman, C. |
| Source: | Communications of the ACM. Oct73, Vol. 16 Issue 10, p615-618. 4p. 2 Diagrams. |
| Subjects: | Dynamic storage allocation (Computer science), Algorithms, Computer programming, Fibonacci sequence |
| 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
