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
How many registers does x86 have?
Explain Round Robin.
Explain the difference between demand-paging and pre-paging?
Define the basic logical structure of a computer.
Difference between a thread and process?
Explain the concept of Thread Pool? what its Benefits?
Can I have two browsers on my computer?
Why is round robin algorithm considered better than first come first served algorithm?
What causes a page fault?
How do I stop chkdsk at startup?
What is a job queue?
What is the Difference between Loading and Linking ?
When the pipe is used?
Explain 32 bit application/OS vs 64 application/OS?
What is sock_seqpacket?