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 the tern reservation? Write down a brief note on it.
What do you meant by the CPU-bound process?
What do you mean by demand and pre-paging?
Explain various file accessing methods?
What are the benefits of multithreaded programming?
State some of the applications of the real-time systems.
Give a brief introduction of the term Pipe?
Write down the main reasons for process suspension?
In the background of memory management, what are replacement and placement algorithms?
Explain the term TP Monitor?
18,76,764
1952758 Asked
3,689
Active Tutors
1458792
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!