Abdullah, Azizol and Othman, Mohamed and Sulaiman, Md. Nasir and Ibrahim, Hamidah and Othman, Abu Talib (2005) Data discovery algorithm for scientific data grid environment. Journal of Parallel and Distributed Computing, 65 (11). pp. 1429-1434. ISSN 0743-7315
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1016/j.jpdc.2005.05.006
In modern scientific computing communities, scientists are involved in managing massive amounts of very large data collections in a geographically distributed environment. Research in the area of grid computing has given us various ideas and solutions to address these requirements. Data grid mostly deals with large computational problems and provides geographically distributed resources for large-scale data-intensive applications that generate large data sets. Peer-to-peer (P2P) networks have also become a major research topic over the last few years. In a distributed P2P system, a discovery algorithm is required to locate specific information, applications, or users within the system. In this research work, we present our scientific data grid as a large P2P-based distributed system model. By using this model, we study various discovery algorithms for locating data sets in a data grid system. The algorithms we studied are based on the P2P architecture. We investigate these algorithms using our Grid Simulator developed using PARSEC. In this paper, we illustrate our scientific data grid model and our Grid Simulator. We then analyze the performance of the discovery algorithms relative to their average number of hop, success rates and bandwidth consumption. © 2005 Elsevier Inc. All rights reserved.
|Keyword:||Data grid; Discovery algorithm; Grid computing|
|Subject:||Computational grids (Computer systems)|
|Faculty or Institute:||Faculty of Computer Science and Information Technology|
|Deposited By:||Azwana Abdul Rahman|
|Deposited On:||30 Oct 2011 10:08|
|Last Modified:||30 Oct 2011 10:08|
Repository Staff Only: item control page