The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Statistical Properties of the Buddy System
Journal of the ACM (JACM)
A class of dynamic memory allocation algorithms
Communications of the ACM
A note on storage fragmentation and program segmentation
Communications of the ACM
Communications of the ACM
Improving the Performance of Buddy Systems
IEEE Transactions on Computers
Design of a distributed object manager for the Smalltalk-80 system
OOPLSA '86 Conference proceedings on Object-oriented programming systems, languages and applications
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Storage management in IBM APL systems
IBM Systems Journal
Tailored-List and Recombination-Delaying Buddy Systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
A dynamic storage allocation technique based on memory residence time
Communications of the ACM
Communications of the ACM
Anomalous behavior of the fifty-percent rule in dynamic memory allocation
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
Variations on the binary buddy system for dynamic memory management
ACM-SE 18 Proceedings of the 18th annual Southeast regional conference
An algorithm with constant execution time for dynamic storage allocation
RTCSA '95 Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications
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
Dynamic Defragmentation of Reconfigurable Devices
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
| Hi-index | 48.30 |
An extension of the buddy method, called the weighted buddy method, for dynamic storage allocation is presented. The weighted buddy method allows block sizes of 2k and 3·2k, whereas the original buddy method allowed only block sizes of 2k. This extension is achieved at an additional cost of only two bits per block.Simulation results are presented which compare this method with the buddy method. These results indicate that, for a uniform request distribution, the buddy system has less total memory fragmentation than the weighted buddy algorithm. However, the total fragmentation is smaller for the weighted buddy method when the requests are for exponentially distributed block sizes.