Buddy system of the memory allocation
Describe the Buddy system of the memory allocation.
Expert
Free memory is maintained in the linked lists, each of equivalent sized blocks. Any such block is of size 2^k. If some memory is needed by a process, the block size of the next higher order is selected and broken to two. Note that the two such pieces vary in address only in their kth bit. These pieces are termed as buddies. If any used block is freed, the OS checks to see if its buddy is as well free. If so, it is re-joined, and place to the original free-block linked-list.
Write down the demerit of MVT?
Write down the typical elements of the process image?
Write down a brief note on cycle stealing?
what are the two procedures used in a recovery algorithm?
What is meant by the busy waiting?
Explain the term virtual memory?
Write about the term Memory Compaction.
State some of the binding steps?
Your system is contaminated with Virus? Explain how to recover the data?
i can only afford $70, can i proceed with payments
18,76,764
1952111 Asked
3,689
Active Tutors
1447952
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!