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.
Briefly describe the term compiler?
What do you mean by demand and pre-paging?
Describe the well-liked multiprocessor thread-scheduling strategies?
Explain the term Directory?
To a net book with no DVD how can we install Windows 7?
Discuss the term Segmentation.
what are the two procedures used in a recovery algorithm?
Write down the functions constituting the OS's memory management?
Describe briefly short, long and medium-term scheduling?
What do you mean by the term Domain Controller? Describe in brief.
18,76,764
1955504 Asked
3,689
Active Tutors
1431388
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!