Describe the Buddy system of memory allocation.
Answer Posted / wiki addict
The buddy memory allocation technique allocates memory in
powers of 2, i.e 2x, where x is an integer. Thus, the
programmer has to decide on, or to write code to obtain, the
upper limit of x. For instance, if the system had 2000K of
physical memory, the upper limit on x would be 10, since 210
(1024K) is the biggest allocatable block. This results in
making it impossible to allocate everything in as a single
chunk; the remaining 976K of memory would have to be taken
in smaller blocks.
After deciding on the upper limit (let's call the upper
limit u), the programmer has to decide on the lower limit,
i.e. the smallest memory block that can be allocated. This
lower limit is necessary so that the overhead of storing
used and free memory locations is minimized. If this lower
limit did not exist, and many programs request small blocks
of memory like 1K or 2K, the system would waste a lot of
space trying to remember which blocks are allocated and
unallocated. Typically this number would be a moderate
number (like 2, so that memory is allocated in 2² = 4K
blocks), small enough to minimize wasted space, but large
enough to avoid excessive overhead. Let's call this lower
limit l.
Now that we have our limits, let us see what happens when a
program makes requests for memory. Let's say in this system,
l = 6, which results in blocks 26 = 64K in size, and u = 10,
which results in a largest possible allocatable block, 210 =
1024K in size. The following shows a possible state of the
system after various memory requests.
| Is This Answer Correct ? | 5 Yes | 3 No |
Post New Answer View All Answers
What is rdram?
What is the full form of os?
What is asynchronous task?
Explain briefly about linker and its functioning?
Explain how a TP Monitor manages memory and processor resources more effectively than a typical operating system.
How do I know if my hardware supports 64 bit?
Does android run on x86?
What is operating system give two examples?
What is the cause of thrashing? How does the system detect thrashing? Once it detects thrashing, what can the system do to eliminate this problem?
Can I run 64 bit on x86?
What is an immutable object? How can it help in writing a concurrent application?
What is a volatile keyword?
Explain what do you understand by registers, briefly explain the various types of registers.
What is a semaphore? What are the different types of semaphores?
What is best free operating system?