Replica selection on co-allocation data grids

14Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Data Grid supports data-intensive applications in a large scale grid environment. It makes use of storage systems as distributed data stores by replicating contents. On the co-allocation architecture, the client can divide a file into k blocks of equal size and download the blocks dynamically from multiple servers by GridFTP in parallel. But the drawback is that faster servers must wait for the slowest server to deliver the final block. Therefore, designing efficient strategies for accessing a file from multiple copies is very import. In this paper, we propose two replica retrieval approaches, abort-and-retransfer and one by one co-allocation, to improve the performance of the data grids. Our schemes decrease the completion time of data transfer and reduce the workload of slower serves. Experiment results are also done to demonstrate its performances. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Chang, R. S., Wang, C. M., & Chen, P. H. (2004). Replica selection on co-allocation data grids. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3358, 584–593. https://doi.org/10.1007/978-3-540-30566-8_70

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free