1,737 views
1 1 vote
consider a uniprocess system executing four tasks T1,T2,T3 and T4 each of which is composed of an 10 sequence of job(or instances) which are arrives at periodically at interval of 2,4,8 and 16 ms respectively.the priority of each task is directly proportional to its periods and the avaliable task are schedule in order of priority,with the highest priority task schedule first.each instance of T1,T2,T3 and T4 requires an execution time 1,2,4 and 6 ms respectively.given that all task arrive at beginning of the  2ms and task preempted allowed,the 2nd instance of T3 its execution at the end of_______ ms

2 Answers

Best answer
0 0 votes

execution sequence....

1).............................

2)T4

3)T4

4)T4

5)T4

6)T4

7)T4

8)T3

9)T3

10)T3

11)T3

12)T2

13)T2

14)T1

15)................................

16)T4

17)T4

18)T4

19)T4

20)T4

21)T4

22)T3

23)T3

24)T3

25)T3....

so ans according to me is 25 ms..

please let me know,if it is correct or not.... 

• selected by
0 0 votes

Answer will be 25 ms

As priority of job is directly proportional to its period 

So T4 has highest priority and T1 has lowest priority

So, execution sequence

  1. T4
  2. T4
  3. T4
  4. T4
  5. T4
  6. T4
  7. T3
  8. T3
  9. T3
  10. T3
  11. T2
  12. T2
  13. T1
  14. _ (All jobs are in interval here)
  15. T3
  16. T3
  17. T4
  18. T4​
  19. T4
  20. T4
  21. T4
  22. T4
  23. T3
  24. T3

​Here all jobs arrived at the begining of 2 ms , So, total time(24+1)=25ms

• edited by
Position:
Show:

Related questions

2 2 votes
0 0 answers
3.9k
3.9k views
Anurag_s asked Dec 18, 2015
3,871 views
Main purpose behind this question is, which access mechanism to consider by default:Simultaneous ie on Miss directly access from main memory without transferring to cache...
1 1 vote
3 answers 3 answers
826
826 views
pritika kundu asked Dec 4, 2015
826 views
A computer system implements a 8kilobytes pages and a 36 bit physical address space.each page table entry contains a valid bit,and the translation.if the maximum size of ...
1 1 vote
1 1 answer
563
563 views
Aishabanu_Multani asked Mar 25, 2025
563 views
Check whether the following grammar is LL(1) or not S🡪iCtSA | a A🡪 eS | 𝜖 C🡪 b