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.
What do you mean by the term Domain Controller? Describe in brief.
Explain different types of Real-Time Scheduling?
Describe briefly the term read-write locks?
What do you mean by the term RIS? Also describe Imaging or ghosting?
Write down the four layers which Windows NT have in order to attain independence?
Write down the sub-components of I/O manager in Windows NT?
How is the signal or wait operations for monitor dissimilar from those for semaphores?
What are the objectives of Operating System?
Explain functions of the virtual file system (VFS)?
Specify some of the conditions which should hold for the Deadlock Prevention?
18,76,764
1937430 Asked
3,689
Active Tutors
1445427
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!