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.
What are the objectives of Operating System?
Specify advantages of the Indexed allocation?
Write down the essential conditions for deadlock to occur?
What do you meant by the CPU-bound process?
Explain cache memory?
What do you mean by cycle stealing? Describe in brief.
What is the Translation Lookaside Buffer (or TLB)?
Describe what is meant by the term operating system?
Briefly explain compaction?
What is meant by the term mutex?
18,76,764
1946135 Asked
3,689
Active Tutors
1449174
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!