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

Can you have 2 operating systems on one computer?

534


What is real time operating systems?

593


Does a clean install erase everything?

527


How can I tell if a program is 64 bit?

492


How do you create a directory?

552






What are the different synchronization mechanisms?

550


Can you move program files x86 to another drive?

497


What are the major differences between Thread and Process?

607


What is the meaning of busy spin in multi-threading?

579


Mention the steps involved in the execution of a program.

497


What is cascading termination?

789


Define trashing?

593


Where is the root directory?

502


Binding of instructions and data to memory?

658


What is synchronization? What are the different synchronization mechanisms?

546