The Research On Process Binding Based On CPU Cache

With the development of computer technology, the speed gap between speed of CPU and memory access is obvious, which is the phenomenon of the so-called "memory wall",and this is one of the hot topics of the research of the performance of the computer system. This paper select the way to enhance the system efficiency by optimizing the Cache efficiency.From the perspective of enhance the efficiency of the Cache, put forward a more reasonable Cache replacement strategy is one of the most directive solution. The "jitter" phenomenon in the last level Cache make the system access to data from memory, which will influence the speed of system operation. The "jitter" phenomenon are caused by the process interference. And all data blocks are using the same replacement algorithm, which has poor performance in the last level Cache. This also resulted in the LRU replacement algorithm in the last level Cache performance is poor.According to the "jitter" phenomenon in the last level Cache, this paper puts forward the replacement algorithm of IBP based on binding process, this replacement will let the Cache bind to the correspond process,the system will choose different replacement strategies according to the state of the process. This binding process avoid the data interference between the Cache block, which protect the important data blocks and ease the phenomenon of Cache "jitter" caused by low temporal locality.Finally, based on the same load in different replacement algorithms running under the workloads. The experimental results show that the proposed IBP replacement strategy will enhance the efficiency of the system about 7%-8%, This will laid a theoretical foundation for the in-depth study of the Cache technology.