Linux Process Scheduling Strategy Based on Cache Contention Optimization
Xia Sha, Jun Li · Jisuanji gongcheng · 2013
According to the analysis of the process scheduling algorithm of Linux kernel 2.6.22,through the information getting from Performance Monitor Unit(PMU),this paper puts forward three performance indexes CMR,CRR and OCIP to describe the process behavior of cache contention.On the basis of this,it uses polling algorithm to optimize the process scheduling in order to reduce the cache contention of Last Level Cache(LLC).Benchmark test results show that this algorithm can improve about 6% performance when the system load is high.