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


Please Help Members By Posting Answers For Below Questions

How many registers does x86 have?

554


Explain Round Robin.

602


Explain the difference between demand-paging and pre-paging?

634


Define the basic logical structure of a computer.

539


Difference between a thread and process?

664






Explain the concept of Thread Pool? what its Benefits?

553


Can I have two browsers on my computer?

488


Why is round robin algorithm considered better than first come first served algorithm?

795


What causes a page fault?

542


How do I stop chkdsk at startup?

502


What is a job queue?

649


What is the Difference between Loading and Linking ?

15437


When the pipe is used?

546


Explain 32 bit application/OS vs 64 application/OS?

513


What is sock_seqpacket?

615