网格计算中动态复制策略的设计  

Design of Dynamic Replication Strategies for a Grid Computing

作　　者：何炎祥[1] 范清风[1] 张力飞 

机构地区：[1]武汉大学计算机学院,软件工程国家重点实验室,武汉430072

出　　处：《计算机工程》2004年第3期94-95,98,共3页Computer Engineering

摘　　要：网格计算是新型的分布计算技术,是解决复杂度越来越高的新应用的重要方法。该文简述了网格计算的定义、特点和基本结构。 着重讨论了其中大数据量的全局共享和广泛分布问题。介绍的基于网格环境的动态复制技术,可以减少带宽消耗,扩大存储潜力。对3种不同存储模式的6种复制策略的特性作了评价。Grid computing is growing more successful in distributed computing. It is a important method to solve complex application. This paper outlines the definition of grid computing, its specialty and fundamental structure, it specially debates large amounts of data to be able to share and distributed. The paper introduces dynamic replication in a grid scenario, which can be used as a technique to reduce bandwidth consumption and enhance access latency. The performance of six different replication strategies for three different kinds of access patterns is evaluated.

关 键 词：网格计算 动态复制 模式 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]