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.
Describe in brief the FAT file systems.
Write down the essential functions of process management?
List some of the disadvantages of context switching?
Illustrate the term Asymmetric Multiprocessing.
State Fourth Generation (4G)?
Explain how index blocks can be executed within the indexed allocation scheme?
Explain what is meant by the file?
Write down the various kinds of memory?
Specify the principal events of the Process Creation.
i can only afford $70, can i proceed with payments
18,76,764
1961200 Asked
3,689
Active Tutors
1455802
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!