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.
Write down a short note on Belady's Anomaly?
Explain about the structure of Operating System.
Write about the term Memory Compaction.
Write down about the Asymmetric Clustering.
Illustrate the term Batch Systems.
Write down some of the advantages of Child Domain?
Explain what do you understand by the Demand Paging?
What is the Translation Lookaside Buffer (or TLB)?
Explain different functions of the Scheduler?
What do you mean by the term Domain Controller? Describe in brief.
18,76,764
1924251 Asked
3,689
Active Tutors
1430778
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!