It is possible to substitute operating system kernel in the same way. For example we can use linux kernel, chrome operating system by utilizing dual boot functionality .Also using virtualization, we can run multiple operating system kernels..
Question 1c (ii)
The round robin algorithm does not favour IO bound processes. The main reason for that is CPU-bound process gets more CPU time, whereas I/O process has to wait for CPU-bound processes to consume their quanta before its turn of executing on the CPU.
Each I/O process gets put back at the end of the queue no matter how much or how little of the quantum was used. I/O bound processes are likely to run for a shorter period of time and then they block, which makes us understand that they would have to wait in the queue for a long time which is making the process slow.
To fix this problem we can use an auxiliary queue to hold processes that have I/O requests serviced
The Process in auxiliary queue gets…show more content… With paging we do not need to allocate contiguous memory for the process, instead of loading the complete memory of a program into main memory it divides the program into small bits and loads in the memory.
Paging divides virtual address space into small blocks and are called as pages .It also divides physical memory addresses into small blocks and are called as frames. Both virtual addresses and physical addresses should be divided into equal amount of small memory chunks. We can store any page in any frame. There is a mapping table called page table which has all the mapping information such as which page is stored in which frame. Operating system maintains a paging table for each process.
The processor converts virtual address spaces into physical address spaces. Every virtual address consists of a page number and an offset and it converts to frame number and an
