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 do you mean by the term BSOD? Describe, what do you do if you get blue screen in a computer? Explain how do you troubleshoot it?
What do you understand by the concept of Reentrancy?
List out the benefits of the Contiguous allocation?
Write down the drawbacks of using threads?
What is the key object oriented concepts employed through Windows NT?
Write down a brief note on NTFS file system.
write a short note on time stamp ordering
How is the signal or wait operations for monitor dissimilar from those for semaphores?
Explain cache memory?
Explain the term symmetric multiprocessing in brief.
18,76,764
1926472 Asked
3,689
Active Tutors
1430902
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!