Iterative performance bounding for greedy-threaded process

C. S. Wong, I. K.T. Tan, R. D. Kumari, K. P. Kalaiyappan

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

2 Citations (Scopus)


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 multi-threading 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.

Original languageEnglish
Title of host publicationTENCON 2009 - 2009 IEEE Region 10 Conference
Publication statusPublished - 2009
Externally publishedYes
EventIEEE Tencon (IEEE Region 10 Conference) 2009 - Singapore, Singapore
Duration: 23 Nov 200926 Nov 2009 (Proceedings)


ConferenceIEEE Tencon (IEEE Region 10 Conference) 2009
Abbreviated titleTENCON 2009
Internet address


  • Component
  • Multiprocessing
  • Operating system kernels
  • Processor scheduling
  • Time-sharing computer systems

Cite this