Question 2 (8 points). The MLFQ (multi-level feedback queue) is a famous scheduling discipline. It consists of a number of rules as follows. 1: If Priority(A) > Priority(B), A runs (B doesn't). 2: If Priority(A) = Priority(B), A & B run in round-robin fashion. 3: When a job enters the system, it is placed at the highest priority queue (the topmost queue). 4: Once a job uses up its time slice at a given level, its priority is reduced. 5: After some time period, move all the jobs in the system to the top-most (highest-priority) queue. Now, write down the rule (or rules, using numbers) that come into play in each of the following example traces of MLFQ behavior. Note that * marks an arrival, if the information is relevant. Scheduling graph Rule(s)? (write the numbers) [2 points for each, -0.5 for each error until to 0] AA Q3: A* Q2: AA Q1: AAAAAAAAAA ... Q3: A* Q2: Q1: BBBBBBBB Q3: A* Q2: AA Q1: BBBBBBBB AAAABBBB ... Q3: AB Q2: AABB Q1: AAABBB AAABBBBB... Question 2 (8 points). The MLFQ (multi-level feedback queue) is a famous scheduling discipline. It consists of a number of rules as follows. 1: If Priority(A) > Priority(B), A runs (B doesn't). 2: If Priority(A) = Priority(B), A & B run in round-robin fashion. 3: When a job enters the system, it is placed at the highest priority queue (the topmost queue). 4: Once a job uses up its time slice at a given level, its priority is reduced. 5: After some time period, move all the jobs in the system to the top-most (highest-priority) queue. Now, write down the rule (or rules, using numbers) that come into play in each of the following example traces of MLFQ behavior. Note that * marks an arrival, if the information is relevant. Scheduling graph Rule(s)? (write the numbers) [2 points for each, -0.5 for each error until to 0] AA Q3: A* Q2: AA Q1: AAAAAAAAAA ... Q3: A* Q2: Q1: BBBBBBBB Q3: A* Q2: AA Q1: BBBBBBBB AAAABBBB ... Q3: AB Q2: AABB Q1: AAABBB AAABBBBB