Explanation Given: Two robots are working on given tasks in figure (1) with certain processing time. Time is given T = 32 . Approach: Priority-List Model: a. Assign the tasks from priority list to all the processors. b. If any processor is free after a time T, assign the next task from priority list to the free processor and if not any task is available then processor will go at idle state. c. Continue step (b) till all the tasks are completed. d. Some signs for priority list status, 1. Single slash means task is in processing, Task . 2. Cross means task is completed and ineligible for next processing, Task . Calculation: Consider the given figure, Figure (1 ) Suppose the priority list of given digraph is, A D ( 8 ) , A W ( 6 ) , A F ( 5 ) , I F ( 5 ) , A P ( 7 ) , I W ( 7 ) , I D ( 5 ) , I P ( 4 ) , P L ( 4 ) , P U ( 3 ) , H U ( 4 ) , I C ( 1 ) , P D ( 3 ) , E U ( 2 ) , F W ( 6 ) Now schedule the priority list for T = 32 using Priority-List Model. At time T = 0 (Start), the ready tasks are A D , A W , A F , and A P . The status of the robots is: P 1 starts task AD . P 2 starts task AW . The status of priority list is, A D , A W , A F , I F , A P , I W , I D , I P , P L , P U , H U , I C , P D , E U , F W The following figure shows the priority status, Figure (2) At time T = 6 , The status of the robots is: P 1 is busy. P 2 has completed task AW and will start task AF . The status of priority list is, A D , A W , A F , I F , A P , I W , I D , I P , P L , P U , H U , I C , P D , E U , F W The following figure shows the priority status, Figure (3) At time T = 8 , The status of the robots is: P 1 has completed AD and will start task AP . P 2 is busy. The status of priority list is, A D , A W , A F , I F , A P , I W , I D , I P , P L , P U , H U , I C , P D , E U , F W The following figure shows the priority status, Figure (4) At time T = 11 , The status of the robots is: P 1 is busy. P 2 has completed task AF and will remain idle as no task is ready. The status of priority list is, A D , A W , A F , I F , A P , I W , I D , I P , P L , P U , H U , I C , P D , E U , F W The following figure shows the priority status, Figure (5) At time T = 15 , The status of the robots is: P 1 has completed AP and will start task IF . P 2 will remain idle as no task is ready. The status of priority list is, A D , A W , A F , I F , A P , I W , I D , I P , P L , P U , H U , I C , P D , E U , F W The following figure shows the priority status, Figure (6) At time T = 20 , The status of the robots is: P 1 has completed IF and will start task IW

Excursions in Mathematics, Loose-Leaf Edition Plus MyLab Math with Pearson eText -- 18 Week Access Card Package

9th Edition

ISBN: 9780136208754

Author: Tannenbaum, Peter

Publisher: PEARSON

See similar textbooks

Videos

Question

Chapter 8, Problem 33E

To determine

To find:

The priority list status at given time using given diagram.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 8, Problem 32E

Chapter 8, Problem 34E

Students have asked these similar questions

Calculus lll May I please have the solutions for the following exercises? Thank you

Calculus lll May I please have the solution for the following question? Thank you

Find three horizontal tangents between [0,10]

Chapter 8 Solutions

Excursions in Mathematics, Loose-Leaf Edition Plus MyLab Math with Pearson eText -- 18 Week Access Card Package

Ch. 8 - For the digraph shown in Fig. 8-25, find a.the...Ch. 8 - For the digraph shown in Fig. 8-26, find Figure...Ch. 8 - For the digraph in Fig. 8-25, find a.all path of...Ch. 8 - For the digraph in Fig. 8-26, find a.a path of...Ch. 8 - For the digraph in Fig. 8-25, find a.all cycles of...Ch. 8 - For the digraph in Fig. 8-26, find a.all cycles of...Ch. 8 - Prob. 7E Ch. 8 - For the digraph in Fig.8-26, find a.all vertices...Ch. 8 - a.Draw a digraph with vertex-set V={A,B,C,D} and...Ch. 8 - a.Draw a digraph with vertex-set V={A,B,C,D} and...

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.

The priority list status at given time using given diagram.

Solution Summary: The author explains the Priority-List Model: assign tasks from priority list to all the processors, if any processor is free after a time T, assign the next task to the free processor.

Videos

To find: The priority list status at given time using given diagram.

Want to see the full answer?

Chapter 8 Solutions

To find:

The priority list status at given time using given diagram.