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
What do you understand by registers?
How many types of fragmentation occur in operating system?
Explain about Different types of real-time scheduling?
what's the latest ram lunch?
What is a critical section?
Explain the handheld systems. List the issues related to the handheld system.
Is excel for mac 64 bit?
What is sock_stream?
What is bounded-buffer problem?
Describe the objective of multiprogramming.
What is the difference between logical and physical address space?
How do I check for memory leaks?
How much ram do I need for 2019 gaming?
What problems are faced during the implementation of a network-transparent system?
How do I remove a second operating system from my computer?