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.
Describe briefly the term read-write locks?
Write down the probable threads which thread can have?
What do you mean by the context switching?
Write down the various kinds of memory?
Explain various requirements that solution to the critical section problem should satisfy?
Explain the term system utilities in brief.
What do you mean by the term IAS Server? Illustrate.
What is meant by the semaphore?
Explain what do you mean by the Interrupt?
Briefly explain the term condition variable?
18,76,764
1935039 Asked
3,689
Active Tutors
1423095
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!