Buddy system of memory allocation
Illustrate briefly the Buddy system of memory allocation?
Expert
Free memory is maintained in linked lists, each of equivalent sized blocks. Any such block is of size 2^k. if some memory is necessitated by a process, the block size of next higher order is selected, and broken into two. Note that the two these pieces different in address only in their kth bit. These pieces are termed as buddies. When any employed block is freed, the Operating System confirms to see if its buddy is as well free. If so, it is rejoined, and place into the original free-block linked-list.
i need a tutor to teach me system software. for now i just need help for the first four chapters. here i attached my book.
Give a brief introduction of the term context switching?
Specify advantages of the Indexed allocation?
Explain about the structure of Operating System.
Describe which one is better: Windows 7 or Windows XP? Validate your answers with illustrations.
Define the term secondary memory.
Write down the various kinds of Kernel?
Explain the term logical address and physical address.
Explain what is effective access time?
What do you mean by time-stamping? Describe in detail.
18,76,764
1940677 Asked
3,689
Active Tutors
1419205
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!