| 周飞菲.树形数据网格中实现副本放置的一种优化算法[J].电子测量与仪器学报,2019,33(2):195-202 |
| 树形数据网格中实现副本放置的一种优化算法 |
| Optimal algorithm of replica placement in tree data grid |
| |
| DOI： |
| 中文关键词: 树形数据网格 副本放置 复制成本 成本最小化 有效网络利用 |
| 英文关键词:tree data grid replica placement replication cost cost minimization effective network usage |
| 基金项目:2018年度河南省科技攻关重点研发与推广项目（182102210139）资助 |
|
|
|
|
| 摘要点击次数: 61 |
| 全文下载次数: 1 |
| 中文摘要: |
| 针对树形数据网格这种分布式分层数据网格模型,提出了一种最佳副本放置算法,其中的副本数量k可以由用户指定。算法实现由2个阶段构成.在阶段1,对二叉树的全部节点以反向广度优先顺序被访问,且基于对象i的一个副本是否被放置在一个节点上,以自底向上的方式计算出包含读取成本和存储成本的总复制成本;在阶段2,基于一个递归过程,把由在阶段1计算得到的读取成本和存储成本作为输入,采取自上而下的过程放置副本,以使总复制成本最小化。理论分析和仿真实验结果表明,最佳副本放置算法不仅有较低的时间复杂度,而且在归一化放置成本、有效网络利用和本地访问百分比性能指标方面都优于目前几种典型的副本放置算法。 |
| 英文摘要: |
| Aiming at the distributed hierarchical data grid model as tree data grid, an optimal replica placement algorithm is proposed in this paper, in which the number of replicas is k, which is specified by the user. The proposed algorithm consists of two phases. In phase 1,all nodes of binary tree are visited in reverse breadth first order, and based on whether a replica of object i is placed on a node or not, the total replication cost including both read and storage cost are calculated in a bottom up manner. In phase 2, based on a recursive process, the read cost and the storage cost calculated in phase 1 are used as input, and replicas are placed using top down procedure in order to minimize the total replication cost. Theoretical analysis and simulation results show that the optimal replica placement algorithm proposed in this paper not only has the lower time complexity, but also outperforms several typical replica placement algorithms at present in terms of the normalized placement cost, effective network usage and percentage of local access. |
| 查看全文 查看/发表评论 下载PDF阅读器 |
|
|
|
