The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
An algorithm for locating adjacent storage blocks in the buddy system
Communications of the ACM
A simplified recombination scheme for the Fibonacci buddy system
Communications of the ACM
Communications of the ACM
A weighted buddy method for dynamic storage allocation
Communications of the ACM
A class of dynamic memory allocation algorithms
Communications of the ACM
Communications of the ACM
Fast Allocation and Deallocation with an Improved Buddy System
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Memory management: tertiary buddy system
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
Tertiary buddy system for efficient dynamic memory allocation
SEPADS'10 Proceedings of the 9th WSEAS international conference on Software engineering, parallel and distributed systems
| Hi-index | 48.22 |
A generalization of the buddy system for storage allocation is described. The set of permitted block sizes {SIZEi}ni=0 must satisfy the condition SIZEi = SIZEi-1 + SIZEi-k(i) where k may be any meaningful integral-valued function. This makes it possible to force logical storage blocks to coincide with physical storage blocks, such as tracks and cylinders.