In: Computer Science
List 4 desired scheduled algorithm characteristics
Characteristics of desired scheduled algorithm
CPU
Utilization − A scheduling algorithm should be designed so
that CPU remains busy as possible. It should make efficient use of
CPU.
Throughput
− Throughput is the amount of work completed in a unit of time. In
other words throughput is the processes executed to number of jobs
completed in a unit of time. The scheduling algorithm must look to
maximize the number of jobs processed per time unit.
Response
time − Response time is the time taken to start responding
to the request. A scheduler must aim to minimize response time for
interactive users.
Turnaround
time − Turnaround time refers to the time between the
moment of submission of a job/ process and the time of its
completion. Thus how long it takes to execute a process is also an
important factor.
Waiting
time − It is the time a job waits for resource allocation
when several jobs are competing in multiprogramming system. The aim
is to minimize the waiting time.
.