Q.

Which of the following is the base for scheduling algorithm?

A. wcet
B. time
C. execution time
D. address accessing time
Answer» A. wcet
Explanation: the base for scheduling algorithm is the wcet, worst case execution time which is a bound on the execution time of tasks. such computing is undecidable in the general case, so it is decidable for certain programs only such as programs without recursion, iteration count, while loops etc.
3.6k
0
Do you find this helpful?
24

Discussion

No comments yet