Interested to Buy Any Domain ? << Click Here >> for more details...
Describe the Buddy system of memory allocation.
- 3 Answers
- 15468 Views
- HP, I also Faced
- E-Mail Answers
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 two different ram speed modules be used together?
Which is better chkdsk r or f?
Different types of real-time scheduling?
What is the most powerful operating system?
Who invented os?
What is the best page size when designing an operating system?
What is the basic difference between pre-emptive and non-pre-emptive scheduling.
Why is round robin algorithm considered better than first come first served algorithm?
How does DMA increase system concurrency? How does it complicate hardware design?
Will my laptop run faster with more ram?
Explain booting the system and bootstrap program in operating system.
What do you understand by system clock? What is system unit?
What are distributed systems?
What is mutual exclusion and multithreading in OS?
What are the reasons for process termination?
