Tertiary buddy system for efficient dynamic memory allocation

Authors:
Divakar Yadav;A. K. Sharma
Affiliations:
Computer Science & Information Technology, Jaypee Institute of Information Technology University, Noida, India;Computer Science & Information Technology, Jaypee Institute of Information Technology University, Noida, India
Venue:
SEPADS'10 Proceedings of the 9th WSEAS international conference on Software engineering, parallel and distributed systems
Year:
2010

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 system, called "tertiary buddy system" for dynamic storage allocation is presented in this work. Tertiary buddy system allows block sizes of 2k and 3.2k-3 whereas the original binary buddy system allows only block sizes of 2k. This extension is achieved at an additional cost of two bits per block. Simulation of the proposed algorithm has been implemented in C programming language. The performance analysis in terms of internal fragmentation for the tertiary buddy system with other existing schemes such as binary buddy system, fibonacci buddy system and weighted buddy system is given in this work. Further the comparison of simulation results for number of splits and average number of merges for the above systems are also being discussed.