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.
Specify the principal events of the Process Creation.
How you cope up from under pressure?
Explain long term scheduler & short term schedulers?
Would you be able to describe yourself as competitive?
Explain what do you mean by the term Dynamic loading?
What do you mean by RADIUS Server?
What is meant by the term Safe State and state its use in the deadlock avoidance?
Write down the drawbacks of using threads?
Name various stages a processes go through before it is executed finally.
write a short note on time stamp ordering
18,76,764
1928124 Asked
3,689
Active Tutors
1446546
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!