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.
Explain some of the disadvantages of the linked allocation?
Illustrated out the essential differentiation between non-pre-emptive and pre-emptive scheduling?
Explain the following: a) Adaptive mutex. b) Turnstile.
Explain the use of monitors.
Write down some of the advantages of Child Domain?
Illustrate the term Independent process.
Explain what do you mean by the term Dynamic loading?
What is meant by the term mutex?
Briefly explain the term pages in os?
Describe the term busy waiting and spinlock.
18,76,764
1955180 Asked
3,689
Active Tutors
1459008
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!