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
Who invented os?
What is the concept of demand paging?
What is the 4 layer model?
What is turnaround time?
How does disk operating system work?
what is the command to copy windows files (i386) without formatting OS?
What is RR scheduling algorithm?
Do you know what is a binary semaphore?
How does swapping result in better memory management?
What are the differences between Real Time Operating System (RTOS) and General Purpose Operating Systems (GPOS)?
What is cache-coherency?
Write syntax to set JVM Memory as min-256Mb & max 512Mb?
Do I need program files x86?
What is gang scheduling in operating system (os)?
What is sudo user?