|
Published Articles >> Table of Contents >> Abstract
Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2
pp. 751-758
Query planning for the grid: adapting to dynamic resource availability
K. Zhang, UMIACS, Maryland Univ., College Park, MD, USA
H. Andrade, Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
L. Raschid, COPPE, Univ. Fed. do Rio de Janeiro, Brazil
A. Sussman, COPPE, Univ. Fed. do Rio de Janeiro, Brazil
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CCGRID.2005.1558638
Send link to a friend
| 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.
|
 Additional Information
|
Citation:
K. Zhang, H. Andrade, L. Raschid, A. Sussman,
"Query planning for the grid: adapting to dynamic resource availability,"
ccgrid,
pp. 751-758,
Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2,
2005
|
|
