Scribd
Upload
12 views2 pages

Criteria For Cpu Sheduling

CPU scheduling algorithms are assessed based on criteria such as CPU utilization, throughput, turnaround time, waiting time, and response time to evaluate their effectiveness. Additional important factors include fairness, simplicity, and predictability, which contribute to overall system performance and user experience. The aim is to maximize CPU efficiency while minimizing delays and ensuring equitable resource distribution among processes.

Uploaded by

pavithramuthu2021
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
12 views2 pages

Criteria For Cpu Sheduling

CPU scheduling algorithms are assessed based on criteria such as CPU utilization, throughput, turnaround time, waiting time, and response time to evaluate their effectiveness. Additional important factors include fairness, simplicity, and predictability, which contribute to overall system performance and user experience. The aim is to maximize CPU efficiency while minimizing delays and ensuring equitable resource distribution among processes.

Uploaded by

pavithramuthu2021
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

CPU scheduling algorithms are evaluated based on several criteria to

determine their effectiveness. Here are some of the key criteria:

1. CPU Utilization:

* This measures how busy the CPU is. The goal is to keep the CPU as busy as
possible to maximize its utilization.

* It is expressed as a percentage and ideally should be high (closer to


100%).

2. Throughput:

* This measures the number of processes completed per unit of time.

* A higher throughput indicates that the CPU is efficiently processing tasks.

3. Turnaround Time:

* This is the total time taken for a process to complete, from its arrival time
to its completion time.

* It includes the time spent waiting in the ready queue, execution time, and
I/O time.

* The goal is to minimize turnaround time to improve responsiveness.

4. Waiting Time:

* This is the amount of time a process spends waiting in the ready queue
before it gets the CPU.

* It reflects the efficiency of the scheduling algorithm in allocating CPU time


to processes.

* Minimizing waiting time is crucial for interactive systems.

5. Response Time:

* This is the time it takes for a process to produce its first response after a
request is submitted.

* It is particularly important for interactive systems where users expect


quick feedback.

* Minimizing response time enhances user experience.

Other Important Criteria:


* Fairness: The scheduling algorithm should ensure that each process gets a
fair share of CPU time and that no process is starved of resources.

* Simplicity: The algorithm should be easy to understand and implement to


minimize overhead.

* Predictability: The algorithm should behave predictably so that users can


estimate the execution time of their processes.

You might also like