Consider four periodic tasks (T1, T2, T3 and T4) with the following arrival times, computation times, deadlines and priority, in Table Q1. Tasks T1 T2 T3 T4 Executing Fixed Priority Very high High Low Very low Table Q1 Arrival Computation Deadline time times 7 5 1 0 Preempted 3 5 7 5 i. Non-Preemptive fixed-priority scheduling ii. Preemptive fixed-priority scheduling iii. Earliest Deadline First (EDF) scheduling 15 9 15 15 Blocked Draw timeline diagrams to show the execution of the following scheduling policies. In each timeline show the three situations: executing, preempted and blocked, when appropriate using the legend given in Table Q1.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Consider four periodic tasks (T1, T2, T3 and T4) with the following arrival times,
computation times, deadlines and priority, in Table Q1.
Tasks
T1
T2
T3
T4
Executing
Fixed
Priority
Very high
High
Low
Very low
Table Q1
Arrival
time
7
5
1
0
Preempted
Computation Deadline
times
3
5
7
5
15
9
15
15
Blocked
Draw timeline diagrams to show the execution of the following scheduling policies. In
each timeline show the three situations: executing, preempted and blocked, when
appropriate using the legend given in Table Q1.
i. Non-Preemptive fixed-priority scheduling
ii. Preemptive fixed-priority scheduling
iii. Earliest Deadline First (EDF) scheduling
Transcribed Image Text:Consider four periodic tasks (T1, T2, T3 and T4) with the following arrival times, computation times, deadlines and priority, in Table Q1. Tasks T1 T2 T3 T4 Executing Fixed Priority Very high High Low Very low Table Q1 Arrival time 7 5 1 0 Preempted Computation Deadline times 3 5 7 5 15 9 15 15 Blocked Draw timeline diagrams to show the execution of the following scheduling policies. In each timeline show the three situations: executing, preempted and blocked, when appropriate using the legend given in Table Q1. i. Non-Preemptive fixed-priority scheduling ii. Preemptive fixed-priority scheduling iii. Earliest Deadline First (EDF) scheduling
Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY