value per unit for processes that use the same memory as ancestors (for
example, if the process shows the flow created by using the clone () ) .
Recounting A Quantum When Creating A New
Process
Consider what happens when you create a new process. The simplest
solution (to copy the counter value to the descendant data structure) can
cause processes to artificially extend their quant by creating new
descendants that execute the same code. In order to prevent this, after
the fork () function, the values of the counter are split in half: one half goes
to descendants, the other remains ancestral.
List the disadvantages of the algorithm.
❖
The choice of process to execute is due to the calculation of the
dynamic priority for all processes in the queue of finished
processes. With the increasing number of ready processes in the
system, it is unprofitable to view the queue from start to finish during
each call of the scheduling procedure
❖
If the number of processes is very large, it will take a long time to
list all the dynamic priorities at the beginning of a new era. On the
other hand, epochs change less often with more processes in the
system
❖
The algorithm is designed to reduce response time for processes
with limited I / O capabilities, even if they are not interactive (eg,
background search engine indexing) and do not require a short
response time
❖
With the increase in the number of processors, maintaining common
queues that do not take into account the presence of different
processors becomes unprofitable
