A real-time operating system (RTOS) is required to process tasks sent to an Electronic Control Unit which controls the systems of a typical family car. Rate Monotonic Scheduling (RMS) is one of the preemptive scheduling algorithms under consideration for this task. Q6 (a) What are the three key time parameters for any periodic task and four task states that need to be known when designing a scheduling algorithm for a system. Rate monotonic scheduling (RMS) is one of the scheduling algorithms for non- interacting periodic tasks in a single core microprocessor. Explain how the total task utilisation U- and utilisation upper bound U, can be used to assess if a task set of n tasks are schedulable. (b) Assuming there are four periodic tasks in a high-speed train control system with the following features as shown in Table Q6 C=execution time/task duration, D-Deadline and T-task period. |(c) Task C D TI 20 8 T2 3. 15 3 T3 10 10 T4 12 12 Table Q6 Determine if the RMS algorithm can handle these tasks without causing any catastrophic consequences. (i) To meet another requirement, the period of T2 must be changed to 5, can the task set still be scheduled? (ii)
A real-time operating system (RTOS) is required to process tasks sent to an Electronic Control Unit which controls the systems of a typical family car. Rate Monotonic Scheduling (RMS) is one of the preemptive scheduling algorithms under consideration for this task. Q6 (a) What are the three key time parameters for any periodic task and four task states that need to be known when designing a scheduling algorithm for a system. Rate monotonic scheduling (RMS) is one of the scheduling algorithms for non- interacting periodic tasks in a single core microprocessor. Explain how the total task utilisation U- and utilisation upper bound U, can be used to assess if a task set of n tasks are schedulable. (b) Assuming there are four periodic tasks in a high-speed train control system with the following features as shown in Table Q6 C=execution time/task duration, D-Deadline and T-task period. |(c) Task C D TI 20 8 T2 3. 15 3 T3 10 10 T4 12 12 Table Q6 Determine if the RMS algorithm can handle these tasks without causing any catastrophic consequences. (i) To meet another requirement, the period of T2 must be changed to 5, can the task set still be scheduled? (ii)
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...
Related questions
Question
Transcribed Image Text:A real-time operating system (RTOS) is required to process tasks sent to an Electronic
Control Unit which controls the systems of a typical family car. Rate Monotonic
Scheduling (RMS) is one of the preemptive scheduling algorithms under consideration
for this task.
Q6
What are the three key time parameters for any periodic task and four task states
that need to be known when designing a scheduling algorithm for a system.
(a)
Rate monotonic scheduling (RMS) is one of the scheduling algorithms for non-
interacting periodic tasks in a single core microprocessor. Explain how the total
task utilisation Ur and utilisation upper bound U, can be used to assess if a task
set of n tasks are schedulable.
(b)
Assuming there are four periodic tasks in a high-speed train control system with
the following features as shown in Table Q6 C=execution time/task duration,
D-Deadline and T=task period.
(c)
Task
T
T1
12
20
T2
15
3
T3
10
10
T4
3
12
12
Table Q6
Determine if the RMS algorithm can handle these tasks without causing
any catastrophic consequences.
(i)
To meet another requirement, the period of T2 must be changed to 5,
can the task set still be scheduled?
(ii)
Comment on the trend of the upper bound as the number of tasks
increases and how this influences your system design.
|(iii)
(iv)
Comment on the pros and cons of the RMS scheduling algorithm.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 5 images
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY