Solved

Buddy algorithm

Posted on 2004-10-19
7
1,817 Views
Last Modified: 2008-02-01
What is buddy algorithm for dynamic allocation of memory. Plz explain with a snippet of code
Thanks in advance
0
Comment
Question by:saurabhramya
  • 2
7 Comments
 
LVL 12

Accepted Solution

by:
OnegaZhang earned 168 total points
ID: 12355699
0
 
LVL 55

Expert Comment

by:Jaime Olivares
ID: 12357915
Here is an interesting application (and theory) about the buddy algorithm:
http://www.cse.seas.wustl.edu/techreportfiles/getreport.asp?269
0
 
LVL 55

Assisted Solution

by:Jaime Olivares
Jaime Olivares earned 166 total points
ID: 12357991
0
 

Assisted Solution

by:rraghu77
rraghu77 earned 166 total points
ID: 12443698
Have a look at the code below.....
Its very primitive....not robust(doesnt free memory)....but will demonstrate the algorithm
its implemented for only 16, 32 and 48 byte blocks.....
Warning: no stress test....it may bomb
Let me know if this helps.......

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

// Buddy Algorithm for 16, 32, 48 blocks
struct Memory_Chunk
{
   char * mem_ptr;
   int mem_size;
   Memory_Chunk * next;
};

// globals
Memory_Chunk * block_16_list = 0; // blocks of 16 bytes
Memory_Chunk * block_32_list = 0; // blocks of 32 bytes
Memory_Chunk * block_48_list = 0; // blocks of 48 bytes
const unsigned int NUM_BLOCKS = 2u; // number of blocks

Memory_Chunk * allocate_chunk(unsigned int chunk_size)
{
  Memory_Chunk * mem = (Memory_Chunk *)malloc(sizeof(Memory_Chunk));
  memset(mem, 0, sizeof(Memory_Chunk));
  mem->mem_ptr = (char*)malloc(chunk_size);
  mem->mem_size = chunk_size;

  return mem;
}

Memory_Chunk * make_mem_list(unsigned int mem_chunk_size,
                             unsigned int chunk_count)
{
   Memory_Chunk * head = allocate_chunk(mem_chunk_size);
   Memory_Chunk * cur_ptr = head;
   for(unsigned int i_chunk = 1u; i_chunk < chunk_count; i_chunk ++)
   {
      Memory_Chunk * ptr = allocate_chunk(mem_chunk_size);
      cur_ptr->next = ptr;
      cur_ptr = cur_ptr->next;
   }
   return head;
}
void add_to_list(Memory_Chunk* mem_chunk)
{
   Memory_Chunk ** list_ptr =
      (Memory_Chunk **) malloc(sizeof(Memory_Chunk *));

   switch(mem_chunk->mem_size)
   {
   case 16:
      list_ptr = &block_16_list;
      break;
   case 32:
      list_ptr = &block_32_list;
      break;
   case 48:
      list_ptr = &block_48_list;
      break;
   }
   if (!*list_ptr)
      *list_ptr = mem_chunk;
   else
   {
      Memory_Chunk * ptr = *list_ptr;
      while(ptr->next)
         ptr = ptr->next;
      ptr->next = mem_chunk;
   }
}

void* split_chunk(Memory_Chunk* mem_chunk)
{
   // To split the chunk, memory is freed and
   // reallocated accordingly
   void * ret_mem_ptr = 0;

   free(mem_chunk->mem_ptr);

   switch(mem_chunk->mem_size)
   {
   case 32:
      // split to 16 bytes chunk
      add_to_list(allocate_chunk(16));
      ret_mem_ptr = malloc(16);
      break;
   case 48:
      // split to 16 and 32 byte chunks
      add_to_list(allocate_chunk(16));
      ret_mem_ptr = malloc(32);
      break;
   }
   free(mem_chunk); // free the structure.
   return ret_mem_ptr;
}

void* request_memory(unsigned int chunk_size)
{
   Memory_Chunk * free_list_ptr = 0;
   Memory_Chunk ** list_ptr =
      (Memory_Chunk **) malloc(sizeof(Memory_Chunk *));
   Memory_Chunk * prev_ptr = 0;
   void * mem_chunk_ptr = 0;
   bool split_required = false;

   if ( (chunk_size <= 16) && block_16_list)
   {
      free_list_ptr = block_16_list;
      list_ptr = &block_16_list;
   }
   else
   if ( (((chunk_size > 16) && (chunk_size <= 32) && (block_32_list))) ||
         (!block_16_list && block_32_list) )
   {
      if ((!block_16_list && block_32_list))
         split_required = true;

      free_list_ptr = block_32_list;
      list_ptr = &block_32_list;
   }
   else
   if ( (((chunk_size > 32) && (chunk_size <= 48) && (block_48_list))) ||
         (!block_32_list && block_48_list) )
   {
      if (!block_32_list && block_48_list)
         split_required = true;

      free_list_ptr = block_48_list;
      list_ptr = &block_48_list;
   }
   else
   {
      printf("No free memory");
      return 0;
   }

   prev_ptr = free_list_ptr;
   while(free_list_ptr->next)
   {
      prev_ptr = free_list_ptr;
      free_list_ptr = free_list_ptr->next;
   }

   // get the address of the memory chunk
   mem_chunk_ptr = free_list_ptr->mem_ptr;

   if (prev_ptr->next)
   {
      prev_ptr->next = 0; // Remove the node
   }
   else
   {
      *list_ptr = 0; // end of the list
   }

   if (split_required)
   {
      mem_chunk_ptr = split_chunk(free_list_ptr);
   }
   else
   {  
      free(free_list_ptr); // free the structure.
      free_list_ptr = 0;
   }
   return mem_chunk_ptr; // return the memory chunk
}


void main()
{
   block_48_list = make_mem_list(48, NUM_BLOCKS);
   void * mem = request_memory(30); // 30 is number of bytes
}

0

Featured Post

ScreenConnect 6.0 Free Trial

Discover new time-saving features in one game-changing release, ScreenConnect 6.0, based on partner feedback. New features include a redesigned UI, app configurations and chat acknowledgement to improve customer engagement!

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Suggested Solutions

Go is an acronym of golang, is a programming language developed Google in 2007. Go is a new language that is mostly in the C family, with significant input from Pascal/Modula/Oberon family. Hence Go arisen as low-level language with fast compilation…
Basic understanding on "OO- Object Orientation" is needed for designing a logical solution to solve a problem. Basic OOAD is a prerequisite for a coder to ensure that they follow the basic design of OO. This would help developers to understand the b…
The goal of the video will be to teach the user the concept of local variables and scope. An example of a locally defined variable will be given as well as an explanation of what scope is in C++. The local variable and concept of scope will be relat…
The viewer will learn how to user default arguments when defining functions. This method of defining functions will be contrasted with the non-default-argument of defining functions.

803 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question