edited by
37,562 views
105 votes
105 votes
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of $3, 7$ and $20$ milliseconds, respectively. The priority of each task is the inverse of its period, and the available tasks are scheduled in order of priority, which is the highest priority task scheduled first. Each instance of $T_{1}, T_{2}$ and $T_{3}$ requires an execution time of $1, 2$ and $4$ milliseconds, respectively. Given that all tasks initially arrive at the beginning of the $1^{\text{st}}$ millisecond and task preemptions are allowed, the first instance of $T_{3}$ completes its execution at the end of_____________________milliseconds.
edited by

14 Answers

0 votes
0 votes

video starts at 36:43 NPTEL IIT KHARAGPUR RATE MONOTONIC SCHEDULER (EMBEDDED SYSTEMS)

I think this is out of the league question, as it is not taught in computer science branches.

Still it is a kind of scheduling, so after watching this video

You will be able to answer this question more clearly and fastly

Answer:

Related questions

48 votes
48 votes
6 answers
3
makhdoom ghaya asked Feb 12, 2015
12,170 views
The following two functions $P1$ and $P2$ that share a variable $B$ with an initial value of $2$ execute concurrently.$$\begin{array}{|l|l|}\hline \text{P1() \{ } & \tex...
31 votes
31 votes
2 answers
4