The Liu-Layland scheme for testing schedulability uses the equations U= Σ and T₁ U≤n 2¹-1 where Cis the execution time,

Business, Finance, Economics, Accounting, Operations Management, Computer Science, Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Algebra, Precalculus, Statistics and Probabilty, Advanced Math, Physics, Chemistry, Biology, Nursing, Psychology, Certifications, Tests, Prep, and more.
Post Reply
answerhappygod
Site Admin
Posts: 899603
Joined: Mon Aug 02, 2021 8:13 am

The Liu-Layland scheme for testing schedulability uses the equations U= Σ and T₁ U≤n 2¹-1 where Cis the execution time,

Post by answerhappygod »

 1
1 (118.96 KiB) Viewed 25 times
The Liu-Layland scheme for testing schedulability uses the equations U= Σ and T₁ U≤n 2¹-1 where Cis the execution time, Tis the task time period, n is the number of tasks to be scheduled and U is the CPU utilization. - (d) For a real-time operating system that has 4 tasks with execution time of (1, 4, 2, 4) with corresponding task time periods of (4, 10, 6, 10), comment on the schedulability. [5 marks]
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!
Post Reply