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
Can you have 2 operating systems on one computer?
What is real time operating systems?
Does a clean install erase everything?
How can I tell if a program is 64 bit?
How do you create a directory?
What are the different synchronization mechanisms?
Can you move program files x86 to another drive?
What are the major differences between Thread and Process?
What is the meaning of busy spin in multi-threading?
Mention the steps involved in the execution of a program.
What is cascading termination?
Define trashing?
Where is the root directory?
Binding of instructions and data to memory?
What is synchronization? What are the different synchronization mechanisms?