检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:许美玲[1] 乔莹[1] 莫毓昌[1] 钟发荣[1] XU Meiling QIAO Ying MO Yuchang ZHONG Farong(College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Jinhua Zhejiang 321004, China)
机构地区:[1]浙江师范大学数理与信息工程学院,浙江金华321004
出 处:《计算机应用》2017年第2期463-467,493,共6页journal of Computer Applications
基 金:国家自然科学基金面上项目(61272130;61572442);浙江省公益性项目(2015C33085)~~
摘 要:针对节点计算能力相同但故障分布不同的集群系统的性能分析问题,基于k-to-l-out-of-n结构对集群系统的性能进行建模,并提出了一种基于二元决策图(BDD)的分析方法。针对k-to-l-out-of-n结构的BDD模型生成问题,分析了BDD的结构特征并设计自顶向下生成算法,克服了传统的自底向上生成算法必须生成大量中间冗余节点的缺陷;然后利用生成的BDD模型高效地计算出系统处于一个特定性能级别的概率;最后通过实例说明了BDD方法能够有效分析节点具有不同故障分布的集群系统性能。To analyze the performance of cluster computing systems with identical computing power but different failure distribution, a k-to-l-out-of-n structure was used to model system performance, and a new analytical method based on Binary Decision Diagram (BDD) was proposed for the performance analysis. A new and efficient BDD algorithm that makes full use of the special k-to-l-out-of-n structure was also proposed using a top-down manner, which solved the problem that the traditional bottom-up generation algorithm must generate a large number of intermediate redundant nodes. Then the proposed BDD was used to efficiently calculate the probability of the system being at a specific performance level. At last, some examples were provided to illustrate the proposed BDD-based performance analysis methodology as well as its efficiency in analyzing large- scale cluster computing systems.
关 键 词:集群计算系统 k-to-l-out-of-n模型 二元决策图
分 类 号:TP302[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117