Login/RegisterOperating System :: Process Management - Discussion
27 / 41
Which is non pre-emptive
ARound robin
BFIFO
CMQS
DMQSF
Show Explanation
FIFO: FIFO or FCFS is a non-preemptive mode of CPU scheduling where the processes are allocated CPU based o arrival time, i.e, lower the arrival time, earlier will be the CPU allotment. Each process will be alloted CPU until and unless the process terminates.
MQS(Multilevel Queue Scheduling): In this, processes are classified into different groups. For example, interractive processes(foreground) and batch processes(background) are two types because of their different response time, scheduling needs and priorities. This algorithm partitions the ready queue into separate queues. Processes are permanently assigned to each queue. This is done based upon the properties such as memory size or process type.
MQSF(Multilevel feedback queue scheduling): It is an enhancement of MQS. The principle here is that processes can move between the queues now. In this scheduling, the ready queue is partitioned into multiple queue of different priorities. The processes are assigned to the queues by the system based ontheir CPU-burst time characteristics. This means that if a process consumes too much of CPU time, it is placed into a lower priority queue. So I/O bound and interractive processes stay in the higher priority queues and the CPU bound processes move to the lower priority queues. However, these processes in the lower priority queues should be promoted to the next higher priority queue after a suitable time interval. This technique is known as Aging.
Asked In ::
Round Robin: It is a preemptive mode of CPU scheduling. In this, the available processes which join the ready queue are selected in FCFS order for execution. Also, each process is allowed to execute for a fixed time quantum, i.e, the maximum allowable time given to each process to execute. When the time quantum is reached, the process joins the ready queue, and again waits for the CPU to get alloted to it. Only those processes waits in the ready queue which still has their CPU burst time left. When a process completes its execution, it terminates.
FIFO: FIFO or FCFS is a non-preemptive mode of CPU scheduling where the processes are allocated CPU based o arrival time, i.e, lower the arrival time, earlier will be the CPU allotment. Each process will be alloted CPU until and unless the process terminates.
MQS(Multilevel Queue Scheduling): In this, processes are classified into different groups. For example, interractive processes(foreground) and batch processes(background) are two types because of their different response time, scheduling needs and priorities. This algorithm partitions the ready queue into separate queues. Processes are permanently assigned to each queue. This is done based upon the properties such as memory size or process type.
MQSF(Multilevel feedback queue scheduling): It is an enhancement of MQS. The principle here is that processes can move between the queues now. In this scheduling, the ready queue is partitioned into multiple queue of different priorities. The processes are assigned to the queues by the system based ontheir CPU-burst time characteristics. This means that if a process consumes too much of CPU time, it is placed into a lower priority queue. So I/O bound and interractive processes stay in the higher priority queues and the CPU bound processes move to the lower priority queues. However, these processes in the lower priority queues should be promoted to the next higher priority queue after a suitable time interval. This technique is known as Aging.
Read Full Answer
Report Error
Please Login First Click Here
