DocumentCode :
2237262
Title :
Multidimensional Replica Selection in the Data Grid
Author :
Ramakrishnan, Sridhar ; Rhodes, Philip J.
Author_Institution :
Dept. of Comput. & Inf. Sci., Mississippi Univ., MS
fYear :
0
fDate :
0-0 0
Firstpage :
373
Lastpage :
374
Abstract :
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
Keywords :
disc storage; file organisation; grid computing; application access pattern; data grid; dataset storage organization; disk latency; file downloading; multidimensional replica selection; network latency cost reduction; Collaborative software; Costs; Delay; Grid computing; Information science; Instruments; Measurement; Multidimensional systems; Performance gain; Prefetching;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
High Performance Distributed Computing, 2006 15th IEEE International Symposium on
Conference_Location :
Paris
ISSN :
1082-8907
Print_ISBN :
1-4244-0307-3
Type :
conf
DOI :
10.1109/HPDC.2006.1652190
Filename :
1652190
Link To Document :
بازگشت