作者: Tao Li , Binghang Yan , Zhongzhi Luan
DOI: 10.1109/ICISS.2010.5655344
关键词: Parallel computing 、 Computer science 、 Reliability (computer networking) 、 Node (networking) 、 Key (cryptography) 、 Transfer (computing) 、 Grid computing 、 Grid file 、 Data grid
摘要: With more and data created by grid computing, large file distribution is a key issue in grid. Current usually style site-to-site this mechanism not efficient wastes bandwidth. In paper, we propose novel algorithm to distribute efficiently We split the into n subfiles transfer each subfile different node. And then node which receives transfers other nodes. The size of network environment. must compute using our simple but before splitting. To verify performance algorithm, build simulation system compare with Multiunicast FastReplica [1]. result shows significantly reduce time.