Towards a scalable Scientific Data Grid model and services

被引:3
作者
Abdullah, Azizol [1 ]
Othman, Mohamed [1 ]
Sulaiman, Md Nasir [1 ]
Ibrahim, Hamidah [1 ]
Othman, Abu Talib [2 ]
机构
[1] Univ Putra Malaysia, Fac Comp Sci & Informat Technol, Serdang 43400, Selangor, Malaysia
[2] Univ Kuala Lumpur, Kuala Lumpur 50250, Malaysia
来源
2008 INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATION ENGINEERING, VOLS 1-3 | 2008年
关键词
D O I
10.1109/ICCCE.2008.4580561
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Scientific Data Grid mostly deals with large computational problems. It provides geographically distributed resources for large-scale data-intensive applications that generate large scientific data sets. This required the scientist in modern scientific computing communities involve in managing massive amounts of a very large data collections that geographically distributed Research in the area of grid has given various ideas and solutions to address these requirements. However, nowadays the number of participants (scientists and institutes) that involve in this kind of environment is increasing tremendously. This situation has leads to a problem of scalability. In order to overcome this problem we need a data grid model that can scale well with the increasing of user. Peer-to-peer (P2P) is one of the architecture that promising scale and dynamism environment. In this paper, we present a P2P model for Scientific Data Grid that utilizes the P2P services to address the scalability problem. By using this model, we study and propose various decentralized discovery strategies that intend to address the problem of scalability. We also investigate the impact of data replication that addressing the data distribution and reliability problem for our Scientific Data Grid model on the propose discovery strategies. For the purpose of this study, we have developed and used our own data grid simulation written using PARSEC In this paper, we illustrate our P2P Scientific Data Grid model and our data grid simulation which is used in this study. We then analyze the performance of the discovery strategies with and without the existence of replication strategies relative to their success rates, bandwidth consumption and average number of hop.
引用
收藏
页码:20 / +
页数:2
相关论文
共 19 条
[1]  
[Anonymous], P COMP HIGH EN NUCL
[2]  
CHERVENAK A, 2000, J NETWORK COMPUTER A
[3]  
CRESPO A, 2002, P INT C DISTR COMP S
[4]   Globus: A metacomputing infrastructure toolkit [J].
Foster, I ;
Kesselman, C .
INTERNATIONAL JOURNAL OF SUPERCOMPUTER APPLICATIONS AND HIGH PERFORMANCE COMPUTING, 1997, 11 (02) :115-128
[5]  
FREY J, 2001, P 10 IEEE S HIGH PER
[6]  
GKANTSIDIS C, 2005, P IEEE INFOCOM 05 MI
[7]  
GONG L, 2001, PROJECT JXTA TECHNOL
[8]  
GRIMSHAW AS, 2000, P 2000 NETW DISTR SY
[9]  
IAMNITCHI A, 2002, 1 INT WORKSH PEER TO
[10]  
Johnston W., 1998, P COMP HIGH EN PHYS