The main objective in this assignment is to implement the
Buddy System memory management
strategy
by writing two functions that implement the same functionalities as the C Standard library’s
malloc()
and
free()
. You should apply your knowledge of memory management concepts, so the
functions are as efficient as possible. The buddy system will be characterised and compared against the existing C Standard library functions based on
ACTUAL RUNNING TIME
and
MEMORY USAGE
.
iuww520iuww520iuww520iuww520iuww520iuww520iuww520iuww520
Given a large block of contiguous memory to manage, your functions should be able to fulfil a series
of memory allocation and deallocation requests. In your implementation, you are
not
allowed to
use the built‐in malloc, free, new, delete or any other memory allocators that come from other
third‐party libraries.
START
‐
UP CODES:
The start‐up codes provide a
test routine
that makes successive calls for memory allocations and
deallocations, involving a replaceable implementation of
MALLOC
and
FREE
. Functions for
measuring the actual running time and total memory usage of the memory management strategy
are also provided.
///
// TEST ROUTINE
///
#ifdef
RUN_COMPLETE_TEST
cout
<<
"
\n\n
executing "
<<
NO_OF_ITERATIONS
<<
" rounds of combinations of memory allocation and deallocation..."
<<
endl;
for
(i
=0
;i
<
NO_OF_ITERATIONS;i
++
) {
k
=
myrand()
%
NO_OF_POINTERS;
// pick a pointer
if
(n[k]) {
// if it was allocated then free it
// check that the stuff we wrote has not changed
if
( (n[k][
0
])
!=
(
unsigned char
) k)
//(n[k]+s[k]+k) )
printf(
"Error when checking first byte! in block %d
\n
"
,k);
if
(s[k]
>1 &&
(n[k][s[k]
-1
])
!=
(
unsigned char
) k )
//(n[k]-s[k]-k))
printf(
"Error when checking last byte! in block %d
\n
"
,k);
FREE
(n[k]);
}
size
=
randomsize();
// pick a random size
#ifdef DEBUG_MODE
cout
<<
"
\t
Pick random size to allocate: "
<<
size
<<
endl;
#endif
n[k]
=
(
unsigned char
*
)
MALLOC
(size);
// do the allocation
if
(n[k]
!=
NULL
){
#ifdef DEBUG_MODE
cout
<<
"
\t
allocated memory of size: "
<<
size
<<
endl;
#endif
s[k]
=
size;
// remember the size
n[k][
0
]
=
(
unsigned char
) k;
// put some data in the first and
if
(s[k]
>1
) n[k][s[k]
-1
]
=
(
unsigned char
) k;
// last byte
}
else
{
cout
<<
"
\t
Failed to allocate memory of size: "
<<
size
<<
endl;
}
}
#endif
Selecting a memory management strategy to test
You can switch between different memory management strategies by changing the definition of
MALLOC
and
FREE
, as defined inside
main.cpp
(see below). The first two options are already
provided, but the third option corresponds to the
Buddy System
and therefore, needs to be
implemented in this assignment:
//---------------------------------------
// WHICH MEMORY MANAGEMENT STRATEGY?
//---------------------------------------
// enable the following compiler directives to test the real malloc and free
//
(1) use built-in C functions
const string strategy = "malloc";
#define MALLOC malloc
#define FREE free
//---------------------------------------
//enable the following compiler directives to test a simple implementation of malloc and free
/
/(2) use user-defined functions
//const string strategy = "mymalloc";
// #define MALLOC mymalloc
// #define FREE myfree
//---------------------------------------
//enable the following compiler directives to test your implementation of the Buddy system strategy
//
(3) use Buddy System
// const string strategy = "Buddy System";
// #define USE_BUDDY_SYSTEM
// #define MALLOC
buddyMalloc
// #define FREE
buddyFree
//---------------------------------------
CORE FUNCTIONS REQUIRED:
Skeleton functions for buddy system’s malloc and free are already provided inside
buddysys.cpp
.
Write your implementation inside them. You are allowed to add any supporting functions, data
structures and variables in the program.
void *
buddyMalloc
(int request_memory){
//write your buddy system’s memory allocation codes here
//this function should provide the same functionality as the malloc() function
}
int
buddyFree
(void *p){
//write your buddy system’s memory deallocation codes here
//this function should provide the same functionality as the free() function