Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.programming > #2345

Re: Buddy System Memory Allocator

Show all headers | View raw

"Mark" <mark@dibsco.co.uk> wrote in message news:_Iges.3$jY.2@fx25.am4...

>It seems that this is commonly done using a bitmap, but I don't understand 
>how you keep this manageable if you have a reasonable amount of memory and 
>want a relatively small minimum block size. A bitmap of 32 bits will only 
>give me coverage for 8k of memory if I use a minimum block size of 256 
>bytes. I am trying to figure out how to avoid having a bitmap that is 
>hundreds or thousands of bits long. I'm sure that there must be a better 
>way.

What would be the problem of a bitmap that large?

The memory overheads seem to be only 0.05% (512 bytes per 1MB), so it can't 
be memory. Or do you need a bitmap for every block size? (But then, with the 
other bitmaps getting smaller, the overhead just doubles in total.)

-- 
Bartc 

Back to comp.programming | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread

Thread

Buddy System Memory Allocator "Mark" <mark@dibsco.co.uk> - 2012-10-13 17:32 +0100
  Re: Buddy System Memory Allocator "BartC" <bc@freeuk.com> - 2012-10-14 16:33 +0100
  Re: Buddy System Memory Allocator Pascal J. Bourguignon <pjb@informatimago.com> - 2012-10-19 12:24 +0000
    Re: Buddy System Memory Allocator "BartC" <bc@freeuk.com> - 2012-10-19 15:04 +0100
      Re: Buddy System Memory Allocator Pascal J. Bourguignon <pjb@informatimago.com> - 2012-10-19 16:37 +0000

csiph-web