摘要
针对Web服务器中传统的动态请求调度算法,如先到先服务算法等,不能充分利用多核处理器并行性的问题,根据多核Web服务器缓存结构的特点提出了基于缓存层级结构的多核Web服务器动态请求调度算法。该算法从处理器核心间的负载均衡和多核处理器的缓存层级结构特点两个方面对动态请求进行调度。基于此算法进行了仿真实验,实验结果表明该算法可保持多核处理器核心间的负载均衡,并能有效缓解多核Web服务器的乒乓效应。
In order to solve the problem that traditional scheduling algorithms for dynamic requests, such as first come first served algorithm, couldn＇ t fully exploit the parallelism of multi-core processors, this paper proposed a cache hierarchy-based scheduling algorithm for dynamic requests in multi-core Web servers according to the characteristics of multi-core processors＇ cache hierarchy. The algorithm scheduled the dynamic requests on the basis of load balance between processing cores and characteristics of multi-core processors＇ cache hierarchy. The simulation experiment based on the algorithm shows that the pro- posed algorithm can keep load balance between processing cores and alleviate the ping-pong effect in multi-core Web server ef- fectively.
出处
《计算机应用研究》
CSCD
北大核心
2016年第1期87-91,共5页
Application Research of Computers
基金
中央高校基本科研业务费资助项目(YZ1319)
