支持多集群数据并行的On-demand文件传输算法 |
| |
引用本文: | 魏晓辉,周芹芹,李洪亮. 支持多集群数据并行的On-demand文件传输算法[J]. 计算机科学, 2013, 40(3): 77-78 |
| |
作者姓名: | 魏晓辉 周芹芹 李洪亮 |
| |
作者单位: | (吉林大学计算机科学与技术学院 长春130012) |
| |
摘 要: | 数据密集型应用通常需要在广域网分布式共享计算环境中高效地传输海量数据。并行处理中,大量的数据需要在生成集群、存储集群、处理集群间进行传输。针对该传输问题提出了一个支持多集群数据并行传输的按需文件传输算法(On-demand File Transfer),该算法以批量传输请求的整体完成时间最小为目的,根据集群内部快速传输的特点,实现目的端并行,分散单个节点的传输负载;在传输路径上,采用多重路径和多跳路径分割方法实现并行传输。对于批量传输请求,依据每个请求的传输负载,全局按需分配带宽,以解决传输路径的带宽冲突,从而充分利用当前网络带宽,快速传输批量传输请求。
|
关 键 词: | 多集群,目的端并行,按需,文件传输 |
On-demand File Transfer Algorithm Supporting Data-parallel over Multi-cluster |
| |
Abstract: | Data-intensive applications often require the efficient transfer of large amounts of data over wide-area distribirted computing environments. In parallel processing, such data transmissions usually happen between data generation clusters and the data storage or processing clusters from time to time. This paper presented an on-demand file transfer algorithm,which aims at minimizing the makespan of overall file transfer rectuests. Taking advantage of the high transfer performance within a single cluster, the algorithm performs simultaneous transfer of different pieces of files to multiple nodes of a cluster when one node of the cluster requests the files. It employs multi-hop path splitting and multi patking methods in[1]to improve the transfer performance of a single source-destination pair. When several requests compete for the physical links, the algorithm evenly allocates the bandwidth resources upon the transmission load of each request, to make full use of the network bandwidth. |
| |
Keywords: | Multi-clusters Data intensive On-demand schedule File transfer |
|
|
点击此处可从《计算机科学》下载全文 |