MINIX 3 essentially uses the scheduling method in Fig. 2-43, with different priorities for classes. The lowest class (user processes) has round-robin scheduling, but the tasks and servers always are allowed to run until they block. Is it possible for processes in the lowest class to starve? Why (or why not)?

Transcribed Image Text:

rdy_head 15 IDLE_Q 7 USER_Q 4 3 2 1 0 TASK_Q IDLE init fs rs disk tty system pm log clock mem rdy_tail IDLE_Q USER_Q 15 7 4 3 2 1 TASK_Q 0 Figure 2-43. The scheduler maintains sixteen queues, one per priority level. Shown here is the initial queuing of processes as MINIX 3 starts up.