loading...
Multidimensional Replica Selection in the Data Grid
Paris June 19-June 23
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HPDC.2006.16521902006 15th IEEE International Conferen ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
S. Ramakrishnan, Dept. of Comput.&Inf. Sci., Mississippi Univ., MS
P.J. Rhodes, Dept. of Comput.&Inf. Sci., Mississippi Univ., MS
Downloading an entire file is not practical for very large n-dimensional (n-d) datasets, especially if the region of interest (ROI) is small. It is therefore important to develop methods to allow researchers to remotely access n-d subsets of large datasets. Since researchers often wish to access a series of subsets, an awareness of the relationship between dataset storage organization and the application access pattern is important to guarantee effective performance. In our previous work, we reduced the impact of network latency costs even when efficient n-d access is available. This reduction in network latency costs exposes disk latency as an important performance factor. To address this new bottleneck and other problems, we propose the addition of n-d replicas to the data grid
Index Terms:
disk latency, multidimensional replica selection, data grid, file downloading, dataset storage organization, application access pattern, network latency cost reduction
Citation:
S. Ramakrishnan, P.J. Rhodes, "Multidimensional Replica Selection in the Data Grid," hpdc, pp.373-374, 2006 15th IEEE International Conference on High Performance Distributed Computing, 2006
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions