Describe the Buddy system of memory allocation.
Answer Posted / 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 |
Post New Answer View All Answers
What are the 7 c's of communication?
What are the major differences between Thread and Process?
How do I find the location of an excel file?
Explain the characteristics of instruction and execution time.
What is root partition?
When does thrashing occur?
what is difference between xp & 2003?
What is normal operating system?
What do you call a bootable disk that contains a full usable os?
What are the benefits and losses of placing the functionality in a device controller rather than in placing it in the kernel?
Define max, min heap and search time of heap.
What is shadow ram?
When is a system in a safe state?
What are dynamic loading, dynamic linking and overlays?
What are types of os?