Interested to Buy Any Domain ? << Click Here >> for more details...
Describe the Buddy system of memory allocation.
- 3 Answers
- 15435 Views
- HP, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / guest
Free memory is maintained in linked lists, each of equal
sized blocks. Any such block is of size 2k. When some
memory is required by a process, the block size of next
higher order is chosen, and broken into two. The two such
pieces differ in address only in their kth bit. Such pieces
are called buddies. When any used block is freed, the OS
checks to see if its buddy is also free. If so, it is
rejoined, and put into the original free-block linked-list.
| Is This Answer Correct ? | 28 Yes | 11 No |
Answer / 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 |
Answer / infamous novice
buddy system is a memory allocation method using buddy
crackers! ^_^
| Is This Answer Correct ? | 3 Yes | 14 No |
Briefly explain thrashing.
Differentiate between compiler and interpreter?
Ms dos provide no means of concurrent processing.three complication that concurrent processing adds to an operating system? ?
What is the most used operating system?
Explain what do you understand by registers, briefly explain the various types of registers.
Define demand paging?
Explain the booting process of a windows xp system.
How you can check whether a machine is 64 bit or 32 bit?
An Infosys Question : I + Opposite of, W + Initial of, Ice + twice of the letter b4T + 3/4 of X + 15th letter + 1/2 of 0. Please find the answer & mail me
21 Answers HCL, Infosys, Instagram, Nokia, Oracle, Sun Business Solutions,
How to communicate between difference process?
What isthe difference between a 'thread' and a 'process'?
Different types of real-time scheduling?
Windows 
