DocumentCode :
2776034
Title :
Query planning for the grid: adapting to dynamic resource availability
Author :
Zhang, Kai ; Andrade, Henrique ; Raschid, Louiqa ; Sussman, Alan
Author_Institution :
UMIACS, Maryland Univ., College Park, MD, USA
Volume :
2
fYear :
2005
fDate :
9-12 May 2005
Firstpage :
751
Abstract :
The availability of massive datasets, comprising sensor measurements or the results of scientific simulations, has had a significant impact on the methodology of scientific reasoning. Scientists require storage, bandwidth and computational capacity to query and analyze these datasets, to understand physical phenomena or to test hypotheses. This paper addresses the challenge of identifying and selecting resources to develop an evaluation plan for large scale data analysis queries when data processing capabilities and datasets are dispersed across nodes in one or more computing and storage clusters. We show that generating an optimal plan is hard and we propose heuristic techniques to find a good choice of resources. We also consider heuristics to cope with dynamic resource availability; in this situation we have stale information about reusable cached results (datasets) and the load on various nodes.
Keywords :
cache storage; data analysis; distributed databases; grid computing; query processing; resource allocation; very large databases; data analysis queries; dynamic resource availability; grid computing; query planning; reusable cache storage; storage cluster; Analytical models; Availability; Computer science; Data analysis; Data processing; Drives; Educational institutions; Memory; Query processing; Sensor phenomena and characterization;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Cluster Computing and the Grid, 2005. CCGrid 2005. IEEE International Symposium on
Print_ISBN :
0-7803-9074-1
Type :
conf
DOI :
10.1109/CCGRID.2005.1558638
Filename :
1558638
Link To Document :
بازگشت