A Framework for an Integrated Co-allocator for Data Grid in Multi-Sender Environment

Raghuvel S. BHUVANESWARAN; Yoshiaki KATAYAMA; Naohisa TAKAHASHI

doi:10.1093/ietcom/e90-b.4.742

A Framework for an Integrated Co-allocator for Data Grid in Multi-Sender Environment

Raghuvel S. BHUVANESWARAN, Yoshiaki KATAYAMA, Naohisa TAKAHASHI

Full Text Views

0

Cite this

Summary :

Data grid consists of scattered computing and storage resources located dispersedly in the grid network. These large sized data sets are replicated in more than one site for the better availability to the other nodes in a grid. Downloading the dataset from these replicated locations have practical difficulties and we find interest in a co-allocated download framework, which enables parallel download of replicated data from multiple servers. In this paper, we proposed a dynamic co-allocation scheme for parallel data transfer in grid environment, which copes up with highly inconsistent network and server performance. The model comprises of co-allocator, monitor and control mechanisms. The scheme initially obtains the bandwidth parameter from the monitor module to fix the partition size and the data transfer tasks are allocated onto the servers in duplication. In this way, the process of data transfer can neither be interrupted nor paralyzed, even when the network link is broken or server crash. We used Globus toolkit for our framework by making use of grid information and GridFTP services. We compared our scheme with the existing schemes and the results show notable improvement in overall completion time of data transfer.

Publication: IEICE TRANSACTIONS on Communications Vol.E90-B No.4 pp.742-749

Publication Date: 2007/04/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e90-b.4.742

Type of Manuscript: Special Section PAPER (Special Section on Networks Software)

Category

Cite this

Copy

Raghuvel S. BHUVANESWARAN, Yoshiaki KATAYAMA, Naohisa TAKAHASHI, "A Framework for an Integrated Co-allocator for Data Grid in Multi-Sender Environment" in IEICE TRANSACTIONS on Communications, vol. E90-B, no. 4, pp. 742-749, April 2007, doi: 10.1093/ietcom/e90-b.4.742.
Abstract: Data grid consists of scattered computing and storage resources located dispersedly in the grid network. These large sized data sets are replicated in more than one site for the better availability to the other nodes in a grid. Downloading the dataset from these replicated locations have practical difficulties and we find interest in a co-allocated download framework, which enables parallel download of replicated data from multiple servers. In this paper, we proposed a dynamic co-allocation scheme for parallel data transfer in grid environment, which copes up with highly inconsistent network and server performance. The model comprises of co-allocator, monitor and control mechanisms. The scheme initially obtains the bandwidth parameter from the monitor module to fix the partition size and the data transfer tasks are allocated onto the servers in duplication. In this way, the process of data transfer can neither be interrupted nor paralyzed, even when the network link is broken or server crash. We used Globus toolkit for our framework by making use of grid information and GridFTP services. We compared our scheme with the existing schemes and the results show notable improvement in overall completion time of data transfer.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e90-b.4.742/_p

Copy

@ARTICLE{e90-b_4_742,
author={Raghuvel S. BHUVANESWARAN, Yoshiaki KATAYAMA, Naohisa TAKAHASHI, },
journal={IEICE TRANSACTIONS on Communications},
title={A Framework for an Integrated Co-allocator for Data Grid in Multi-Sender Environment},
year={2007},
volume={E90-B},
number={4},
pages={742-749},
abstract={Data grid consists of scattered computing and storage resources located dispersedly in the grid network. These large sized data sets are replicated in more than one site for the better availability to the other nodes in a grid. Downloading the dataset from these replicated locations have practical difficulties and we find interest in a co-allocated download framework, which enables parallel download of replicated data from multiple servers. In this paper, we proposed a dynamic co-allocation scheme for parallel data transfer in grid environment, which copes up with highly inconsistent network and server performance. The model comprises of co-allocator, monitor and control mechanisms. The scheme initially obtains the bandwidth parameter from the monitor module to fix the partition size and the data transfer tasks are allocated onto the servers in duplication. In this way, the process of data transfer can neither be interrupted nor paralyzed, even when the network link is broken or server crash. We used Globus toolkit for our framework by making use of grid information and GridFTP services. We compared our scheme with the existing schemes and the results show notable improvement in overall completion time of data transfer.},
keywords={},
doi={10.1093/ietcom/e90-b.4.742},
ISSN={1745-1345},
month={April},}

Copy

TY - JOUR
TI - A Framework for an Integrated Co-allocator for Data Grid in Multi-Sender Environment
T2 - IEICE TRANSACTIONS on Communications
SP - 742
EP - 749
AU - Raghuvel S. BHUVANESWARAN
AU - Yoshiaki KATAYAMA
AU - Naohisa TAKAHASHI
PY - 2007
DO - 10.1093/ietcom/e90-b.4.742
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E90-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2007
AB - Data grid consists of scattered computing and storage resources located dispersedly in the grid network. These large sized data sets are replicated in more than one site for the better availability to the other nodes in a grid. Downloading the dataset from these replicated locations have practical difficulties and we find interest in a co-allocated download framework, which enables parallel download of replicated data from multiple servers. In this paper, we proposed a dynamic co-allocation scheme for parallel data transfer in grid environment, which copes up with highly inconsistent network and server performance. The model comprises of co-allocator, monitor and control mechanisms. The scheme initially obtains the bandwidth parameter from the monitor module to fix the partition size and the data transfer tasks are allocated onto the servers in duplication. In this way, the process of data transfer can neither be interrupted nor paralyzed, even when the network link is broken or server crash. We used Globus toolkit for our framework by making use of grid information and GridFTP services. We compared our scheme with the existing schemes and the results show notable improvement in overall completion time of data transfer.
ER -