A class of dynamic memory allocation algorithms
Communications of the ACM
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
Improving the Performance of Buddy Systems
IEEE Transactions on Computers
Storage management in IBM APL systems
IBM Systems Journal
Communications of the ACM
Dynamic memory allocation in computer simulation
Communications of the ACM
A buddy system variation for disk storage allocation
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
Analysis of free-storage algorithms: revisited
IBM Systems Journal
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.27 |
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.