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.
Describe the tern reservation? Write down a brief note on it.
Explain some of the disadvantages of the linked allocation?
Your system is contaminated with Virus? Explain how to recover the data?
Explain the following algorithm: a) First Come, First Served Scheduling. b) Shortest Job First Scheduling. c) Priority Scheduling.
Explain the term Directory?
Explain the types of jobs that are developed?
What do you understand by the term arm-stickiness?
Explain several page replacement algorithms which are used for the page replacement?
What are the benefits of multithreaded programming?
Specify what all the things the solution for Critical-Section Problem should satisfy?
18,76,764
1955624 Asked
3,689
Active Tutors
1449946
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!