Memory management: tertiary buddy system

Authors:
Divakar Yadav;A. K. Chaturvedi;Snehil Pansari;Avart Krishnan
Affiliations:
JIITU, Noida;JIITU, Noida;JIITU, Noida;JIITU, Noida
Venue:
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
Year:
2008

Citing 9
Cited 0

Statistical Properties of the Buddy System

Journal of the ACM (JACM)
A dynamic storage allocation technique based on memory residence time

Communications of the ACM
Buddy systems

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
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
A fast storage allocator

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

An extension of the binary buddy method, called the tertiary buddy method for dynamic storage allocation is presented. Tertiary buddy method allows block sizes of 2k and 3.2k-3 where as the original binary buddy method allows only block sizes of 2k. This extension is achieved at an additional cost of two bits per block. Analysis of the internal fragmentation of the tertiary buddy system, binary buddy system, the Fibonacci buddy system and the weighted buddy system are given. Simulation results are presented which compare this method with other buddy methods.