![]() |
|
![]() | ||
|
Subject:
Computers
Category: Computers > Operating Systems Asked by: sumavind-ga List Price: $3.00 |
Posted:
04 Nov 2002 12:03 PST
Expires: 13 Nov 2002 11:43 PST Question ID: 98482 |
Consider a task set with with the following independent periodic tasks: Task P1:C1 = 20; T1 = 100 Task P2:C2 = 30; T2 = 145 Can these tasks be successfully scheduled using rate monotonic scheduling? Now consider another task; Task P3:C3 = 68; T3 = 150 Suppose that the first instance of the these three tasks arrive at time t = 0. Assume that the first deadline for each task is the following: D1 = 100; D2 = 145; D3 = 150 Using rate monotonic scheduling, will all three deadlines be met? what about deadlines for future repetitions of each task? |
![]() | ||
|
There is no answer at this time. |
![]() | ||
|
There are no comments at this time. |
If you feel that you have found inappropriate content, please let us know by emailing us at answers-support@google.com with the question ID listed above. Thank you. |
Search Google Answers for |
Google Home - Answers FAQ - Terms of Service - Privacy Policy |