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 two procedures used in a recovery algorithm?
Describe briefly short, long and medium-term scheduling?
Describe the Universal Mobile Telecommunications System?
Explain what is meant by the shared libraries?
Write down the drawbacks of using threads?
Explain the benefits of Linked allocation?
In the framework of memory management, describe the placement and replacement algorithms?
Would you be able to describe yourself as competitive?
How you cope up from under pressure?
Explain different types of Real-Time Scheduling?
18,76,764
1930433 Asked
3,689
Active Tutors
1446098
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!