TY  - JOUR
T1  - Proportional Share Resource Allocation with Latency-Sensitive Threads
AU - , V.l. Jyothi AU - , S.K. Srivatsa 
JO  - Asian Journal of Information Technology
VL  - 5
IS  - 7
SP  - 681
EP  - 685
PY  - 2006
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2006.681.685
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2006.681.685
KW  - Share resource
KW  -latency
KW  -sensitive threads
AB  - Systems need to run a larger and more diverse set of applications, from real time to interactive to batch, on uniprocessor & multiprocessor platforms. The problem of inferring application resource requirements is difficult because the relationship between application performance and resource requirements is complex and workload dependent. This study investigates a measurement-based approach to resource inference – employing online measurements of workload characteristics and system resource usage to estimate application resource requirements. A scheduling algorithm which provides low latency for real-time and interactive application is presented. The schedulability of each process is enforced by a guaranteed cpu service rate, independent of the demands of other processes. The resulting scheduler is implemented in the Linux kernel and evaluate its performance using various application and benchmarks.
ER  -