Given the order-requirement digraph below (with time given in minutes) and the priority list T₁, T₂, T ₃, T₄, T₅, T₆, T₇, apply the list-processing algorithm to construct a schedule using two processors. How much time does the resulting schedule require? A) 16 minutes B) 17 minutes C) 18 minutes D) 21 minutes

Question

Quizplus · Accepted Answer

The list-processing algorithm works as follows: 1. Start with an empty schedule and an empty list of tasks. 2. Find the highest-priority task that has all of its prerequisites completed and add it to the list of tasks to be scheduled. 3. If there are two or more tasks with the same priority and all of their prerequisites completed, choose one of them arbitrarily. 4. Repeat steps 2 and 3 until all tasks are scheduled. Using this algorithm and the given priority list, we can construct the following schedule for two processors: Processor 1: T₁ T₃ T₅ T₇ Processor 2: T₂ T₄ T₆ The resulting schedule requires a total of 17 minutes. Therefore, the answer is B.

Given the Order-Requirement Digraph Below (With Time Given in Minutes)