作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (10): 80-82. doi: 10.3969/j.issn.1000-3428.2010.10.026

• 软件技术与数据库 • 上一篇    下一篇

基于数据相关性的调度算法

朱率率1,杨晓元1,2,张 薇1   

  1. (1. 武警工程学院电子技术系网络与信息安全武警部队重点实验室,西安 710086;2. 西安电子科技大学ISN国家重点实验室,西安 710071)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-05-20 发布日期:2010-05-20

Schedule Algorithm Based on Data Relativity

ZHU Shuai-shuai1, YANG Xiao-yuan1,2, ZHANG Wei1   

  1. (1. Key Laboratory of Network and Information Security of APF, Department of Electronic Technology, Engineering College of APF, Xi’an 710086; 2. National Key Laboratory of ISN, Xidian University, Xi’an 710071)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-05-20 Published:2010-05-20

摘要: 从数据份额属性间相关性的角度定量分析分布式存储网络中数据之间的关联。在此基础上提出一种分布式存储网络中数据更新的加权平均聚类算法,将相关的数据份额分布在不同网络节点上,使各节点上相关的数据保持相对分散。模拟实验结果表明,考虑数据相关性可以有效降低系统的失效概率。

关键词: 分布式存储网络, 数据相关性, 数据容错, 数据分离

Abstract: This paper analyzes the relevancy quantitatively in Distributed Storage Network(DSN) in the view of attributes relativity of data share. Based on the analysis, it presents a new mean-weight clustering algorithm in distributed storage networks based on the idea of dispersing correlative data share on different storage nodes. According to the simulative test, the algorithm can greatly lower compromising probability after taking the data relativity into consideration.

Key words: Distributed Storage Network(DSN), data relativity, data fault-tolerance, data dispersal

中图分类号: