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 is sdram?
What is ex and vi?
What are the different job scheduling in operating systems?
What are the different ways in which data can be represented?
What is an Assembler?
What does af_inet stand for?
What are the two main types of files?
Why is ram also known as volatile memory?
What is a named pipe?
Will chkdsk fix corrupt files?
Explain the concept of the distributed systems?
How many types of fragmentation occur in operating system?
What is rdram?
What factors determine whether a detection-algorithm must be utilized in a deadlock avoidance system?
Can you move program files x86 to another drive?