A NEW IMPLEMENTATION TECHNIQUE FOR BUDDY SYSTEM

Abstract

Buddy system algorithm is dynamic memory control which is usually embedded in
the memory management unit, which is a part of the most widely use modern operating
systems. Dynamic memory management is an important and essential part of computer
systems design. Efficient memory allocation, garbage collection and compaction are
becoming increasingly more critical in parallel, distributed and real-time applications
using object-oriented languages like C++ and Java. In this paper we present a technique
that uses a Binary tree for the list of available memory blocks and show how this method
can manage memory more efficiently and facilitate easy implementation of well known
garbage collection techniques.