1,779 views
0 votes
0 votes
Which of the following are the criteria for CPU scheduling algorithm evaluation.
A. Maximum CPU utilization under the constraint that maximum response time is one second.
B. Maximum throughput such that turnaround time is (on an average) linearly proportional to total execution time.
C. Both
D. None

1 Answer

Best answer
1 votes
1 votes

 The basic purpose of cpu scheduling algorithm is that it should tend to maximize cpu fairness , CPU utilization , balanced utilization and throughput , and minimizes turnaround ,waiting and response time.

  • In general one wants to optimize the average value of a criteria ( Maximize CPU utilization and throughput, and minimize all the others for proper utilization. ) However some times one wants to do something different, such as to minimize the maximum response time.
  • Turnaround time represents the average period of time taken by a process executes. The turnaround time is computed by subtracting the time, when the process was created from the time is terminated. The turnaround time is inversely proportional to throughput( It is the total number of processes completed per unit time or rather say total amount of work done in a unit of time.). 
  • Throughput is Inversely Proportional to the response time.

A. Maximum CPU utilization under the constraint that maximum response time is one second.

B. Maximum throughput such that turnaround time is (on an average) linearly proportional to total execution time.

Both A and B are the criteria for CPU scheduling algorithm evaluation.

 Option C is the Correct Answer.

selected by

Related questions

2 votes
2 votes
1 answer
1
LRU asked Sep 28, 2021
306 views
Under a relational database if table A has a foreign key constraint referencing to another table B, then Each tuple in A is related to zero or one tuple of B.Each tuple i...
0 votes
0 votes
1 answer
2
LRU asked Sep 26, 2021
672 views
What is the minimum number of students, each of whom comes from one of the 50 states, who must be enrolled in a university to guarantee that there are at least 100 who co...
3 votes
3 votes
1 answer
3
PEKKA asked Jan 2, 2017
538 views
f(n) = $\Theta (n^{2})$ g(n) = $\Omega (n)$ h(n)=O(log n) then [ f(n) . g(n) ] + [h(n) . f(n) ] is $\Omega (n)$$\Theta (n^{2})$O(log n)None
0 votes
0 votes
2 answers
4
PEKKA asked Dec 6, 2016
435 views
Complexity of the following snippet is for (i=1;i<n;++i) for(j=1;j<=n;j=j+i) c=c+1;