Iterative performance bounding for greedy-threaded process


Wong, C. S. and Tan, I. K. T. and Kalaiyappan, K. P. and Kumari, R. D. (2009) Iterative performance bounding for greedy-threaded process. In: TENCON 2009 - 2009 IEEE Region 10 Conference. IEEE, pp. 1-7. ISBN 978-1-4244-4546-2

[img] Text
05396124.pdf - Published Version
Restricted to Repository staff only

Download (804kB)


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.

Item Type: Book Section
Subjects: T Technology > T Technology (General)
Divisions: Faculty of Information Science and Technology (FIST)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 12 Nov 2013 03:01
Last Modified: 12 Nov 2013 03:01


Downloads per month over past year

View ItemEdit (login required)