多核Web服务器中基于分配矩阵的动态请求调度-电子与信息学报.PDFVIP

第 38 卷第 9 期 电 子 与 信 息 学 报 Vol.38No.9 2016 年 9 月 Journal of Electronics Information Technology . Setp. 2016 多核 Web 服务器中基于分配矩阵的动态请求调度算法 尤国华* 陈骏君 赵 英 (北京化工大学信息中心 北京 100029) 摘 要：为了构建高性能的 Web 服务器，充分利用 Web 服务器中多核处理器的性能成为关键。传统的先到先服务 策略没有考虑多核处理器的特点，不能充分利用多核处理器的性能。为解决此问题，该文提出一种基于分配矩阵的 动态请求调度算法。该算法充分考虑了多核处理器的特点，可将同类动态请求动态分配至同一个处理器核心，提高 了Web 服务器处理动态请求的速度。仿真实验结果表明，采用该算法的 Web 服务器在自相似性、平均响应时间、 丢包率等方面均优于传统的先到先服务算法。 关键词：Web 服务器；多核；动态请求；调度 中图分类号：TP301 文献标识码： A 文章编号：1009-5896(2016)09-2188-06 DOI: 10.11999/JEIT151328 A Dynamic Request Scheduling Algorithm Based on Allocation Matrix in Multi-core Web Server YOU Guohua CHEN Junjun ZHAO Ying (Center for Information Technology, Beijing University of Chemical Technology, Beijing 100029, China) Abstract: To implement the high performance web server, it is a key to exploit fully the performance of multi-core CPUs in web servers. Traditional First Come First Served (FCFS) policy does not consider the characteristic of multi-core processors, and could not fully exploit its performance. To address this problem, a dynamic request scheduling algorithm based on allocation matrix is proposed in this paper. The algorithm fully considers the characteristic of multi-core processors, assigns the same kind of dynamic requests to the same processing core, and improves the speed of handling dynamic requests in web server. The results of the experiment show that the web server that adopts this algorithm is superior to the traditional FCFS algorithm in the aspect of similarity, mean response time and dropped rate of dynamic requests. Key words: Web Servers; Mult