Bibliographic Details
| Title: |
Buddy System. |
| Authors: |
Peterson, James L.1, Norman, Theodore A.2, Gaines, R. S. |
| Source: |
Communications of the ACM. Jun77, Vol. 20 Issue 6, p421-431. 11p. 7 Diagrams, 5 Charts, 2 Graphs. |
| Subjects: |
Algorithms, Dynamic storage allocation (Computer science), Computer programming, Memory maps (Computer science), Storage fragmentation (Computer science), Computer science |
| Abstract: |
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 fragmentation of the binary buddy system, the Fibonacci buddy system, and the weighted buddy system are given. Comparative simulation results are also presented for internal, external, and total fragmentation. [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 |
