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.
Specify what is understood by the distributed systems?
Describe the term parallel clusters. Explain the term.
What is meant by the term Safe State and state its use in the deadlock avoidance?
Describe in detail the Translation Look aside Buffer (TLB)?
Write down the main functions of a Kernel?
Explain the term Indefinite Blocking or Starvation.
Describe the term Co-operating process in brief.
what are the two procedures used in a recovery algorithm?
Write a brief note on busy waiting?
Explain the benefits of Linked allocation?
18,76,764
1928055 Asked
3,689
Active Tutors
1419859
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!