Iterative performance bounding for greedy-threaded process

Current proportional thread-fair scheduling algorithms allocate CPU resources based on the total weight of runnable threads in the system instead of the total weight within runnable processes. This results in starvation issue in multithreading environments as the scheduler prefers processes with larger number of threads. We illustrate this issue through experimental evaluations on the Linux completely fair scheduler (which is based on proportional fair scheduling algorithm) thus revealing its weakness. Software developers can take advantage of this issue by spawning additional amount of threads in order to obtain more CPU resources. A novel approach based on weight readjustment techniques is proposed as a solution to provide performance bounding algorithm to limit the dominance of processes with excessive number of threads. The algorithm was implemented on CFS and evaluation results demonstrate that the proposed mechanism significantly minimizes the raised starvation issue.