Statistical Properties of the Buddy System
Journal of the ACM (JACM)
Communications of the ACM
A simplified recombination scheme for the Fibonacci buddy system
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
Disk file allocation based on the buddy system
ACM Transactions on Computer Systems (TOCS)
The Starburst long field manager
VLDB '89 Proceedings of the 15th international conference on Very large data bases
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Storage management in IBM APL systems
IBM Systems Journal
The memory fragmentation problem: solved?
Proceedings of the 1st international symposium on Memory management
A High-Performance Memory Allocator for Object-Oriented Systems
IEEE Transactions on Computers
Fast Allocation and Deallocation with an Improved Buddy System
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Estimating internal memory fragmentation for Java programs
Journal of Systems and Software
Scalability of dynamic storage allocation algorithms
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
An efficient dynamic memory allocator for sensor operating systems
Proceedings of the 2007 ACM symposium on Applied computing
| Hi-index | 14.98 |
This paper discusses ways of reducing fragmentation ion in buddy systems. Although internal fragmentation may be estimated for any buddy system, external fragmentation cannot be determined theoretically. It is suggested here that mean external fragmentation for any buddy system is directly related to the height of the associated binary tree. Simulation studies with a new buddy system support this conjecture. Attempts at reducing internal fragmentation have, in the past, increased the tree height covering the range of request sizes and given rise to a commensurate increase in external fragmentation. A new buddy system is described which supports a large number of buddy sizes without requiring a large tree height. The new scheme is a modified form of the weighted buddy method, entitled the dual buddy system. It provides the same set of block sizes as the weighted scheme but has the same tree height as the binary buddy system. Simulation results show that mean external fragmentation is within four percent of that of the binary system and much lower than that of the weighted scheme. The new system has better overall storage utilization han others for uniform random request sizes.