首页 | 本学科首页   官方微博 | 高级检索  
     

基于PageRank和基准测试的异构集群节点性能评价算法研究
引用本文:胡亚红,王一洲,毛家发.基于PageRank和基准测试的异构集群节点性能评价算法研究[J].计算机工程与科学,2020,42(3):391-396.
作者姓名:胡亚红  王一洲  毛家发
作者单位:(1.浙江工业大学计算机科学与技术学院,浙江 杭州 310023;2.中国工商银行,浙江 杭州 310000)
摘    要:为了提高集群效率,需要根据集群节点的性能来进行集群的数据部署和任务调度。在异构集群中,节点性能存在很大差异,如何评价节点的性能非常具有挑战性。可以使用基准测试来评价节点的性能,而不同的基准测试对节点评价的角度不尽相同。PageRank算法被谷歌用来对网站进行排名,现在它也被应用于评价书籍的影响力或用户行为等等。提出一种新颖的基于PageRank的节点性能评价算法,以充分利用不同基准测试的评价结果。首先对每个节点使用LINPACK、NPB、IOzone等主流基准测试进行评价;然后采用PageRank算法处理每个基准测试的执行结果,从而得到节点的性能。为了使用PageRank算法,建立了1个图模型,并计算了性能向量和概率转移矩阵。该算法具有计算复杂度低、综合评价效果好等优点。

关 键 词:PageRank  基准测试  性能评价  异构集群  
收稿时间:2019-08-17
修稿时间:2019-10-20

A node performance evaluation method for heterogeneous clusters based on PageRank and benchmarks
HU Ya-hong,WANG Yi-zhou,MAO Jia-fa.A node performance evaluation method for heterogeneous clusters based on PageRank and benchmarks[J].Computer Engineering & Science,2020,42(3):391-396.
Authors:HU Ya-hong  WANG Yi-zhou  MAO Jia-fa
Affiliation:(1.College of Computer Science & Technology,Zhejiang University of Technology,Hangzhou 310023; 2.Industrial and Commercial Bank of China,Hangzhou 310000,China)
Abstract:For a cluster to achieve its maximum throughput, data placement and task scheduling should be handled according to the performance of the cluster nodes. In a heterogeneous cluster, each node has quite different performance, and how to evaluate nodes’ performance is a challenge issue. Normally, nodes are evaluated by benchmarks, and different benchmarks evaluate the nodes from different aspects. PageRank algorithm is used by Google to rank web sites and now it is also applied to evaluate the influence of books or users' behavior, etc. A novel PageRank based node performance evaluation algorithm is proposed to take advantage of the evaluation results from different benchmarks. Firstly, each node is evaluated by mainstream benchmarks, such as LINPACK, NPB and IOzone. Secondly, PageRank algorithm is applied to calculate the nodes’ performance according to the execution results from each benchmark. In order to use PageRank algorithm, a graph model is established, and performance vectors and probability transition matrix are also calculated. The proposed algorithm can produce comprehensive evaluation results with low computational complexity.
Keywords:PageRank  benchmark  performance evaluation  heterogeneous clusters  
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机工程与科学》浏览原始摘要信息
点击此处可从《计算机工程与科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号