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 is meant by the process synchronization?
Illustrate the main difference between the Mixed Mode and Native Mode?
Explain the Types of Jobs?
Explain, why thread is known as the lightweight process?
What do you understand by the term Time-sharing Systems?
Explain the benefit of the Dynamic Loading.
Explain what is effective access time?
Explain what do you mean by the System Programs?
Explain what do you meant by the term overlay.
Explain long term scheduler & short term schedulers?
18,76,764
1923301 Asked
3,689
Active Tutors
1460777
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!