Close category search window
 

An efficient parallel storage scheme in data grid environment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Weizhong Lu ; Comput. Network Inf. Center, Chinese Acad. of Sci., Beijing, China ; Zhou, Yuanchun ; Li, Jianhui ; Baoping Yan

It is important to improve data reliability and data accessing efficiency for data-intensive applications in data grid environment. We propose an IDA-based parallel storage scheme in Data Grid environment. The scheme partitions a data file into unrecognizable blocks and distributes them across storage nodes according to user profile and system conditions. A subset of blocks, which could be downloaded in parallel to the remote client, is required to reconstruct the data file. The scheme can be deployed on top of current grid middleware. Experimental results and analysis show that the IDA-based parallel storage scheme has better data reliability and data accessing performance than the existing data replication methods.

Published in:
Future Computer and Communication (ICFCC), 2010 2nd International Conference on  (Volume:3 )

Date of Conference: 21-24 May 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.