检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:庞丽萍[1] 朱楚波[1] 吴松[1] 熊慕舟[1]
机构地区:[1]华中科技大学计算机科学与技术学院,湖北武汉430074
出 处:《华中科技大学学报(自然科学版)》2005年第z1期150-153,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)
基 金:国家自然科学基金资助项目(60403024);湖北省自然科学基金资助项目(2004ABA053)
摘 要:提出了一种基于最小代价的广域网存储虚拟化的动态副本管理模型.包括副本创建、副本选择和副本一致性更新三种策略.其中副本创建策略用排队论来分析副本创建代价和副本访问代价,动态创建副本;副本选择策略通过计算副本的最小访问代价,获得满足用户需求的副本;副本一致性更新策略采用软状态服务和对主副本、副本更新代价小的存储代理优先访问的原则进行副本的松散一致性更新.最后将本模型的实现与无副本存储系统和基于请求轮询的存储系统进行性能比较测试,测试结果表明基于最小访问代价的副本管理模型将客户端请求按照存储节点服务能力进行调度,实现了更有效的负载平衡调度.A new dynamic replication model base on minimal access cost to implement storage virtualization in wide-area network is introduced.The model balances creating replicas cost and accessing replicas cost using queuing theory to decide whether replicas should be created or not,and chooses the best replica for user based on minimal accessing cost.As addition,a consistent replicas update strategy integrated soft state service,master replicas top-priority update and minimal accessing cost storage agent priority update will be presented.At the end of this paper the implementation of the model presented in this paper is tested comparing to the storage system which does not have replicas and the storage system which serves the client requests based on round robin.Experimental results show that the model presented in this paper serves the client requests based on the storage node′s capability,which can achieve more effective service requests load-balance.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222