On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
An Evaluation of Alternative Designs for a Grid Information Service
Cluster Computing
Matchmaking: Distributed Resource Management for High Throughput Computing
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
Resource Management through Multilateral Matchmaking
HPDC '00 Proceedings of the 9th IEEE International Symposium on High Performance Distributed Computing
A Performance Study of Monitoring and Information Services for Distributed Systems
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Grid Information Services for Distributed Resource Sharing
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
Nondeterministic Queries in a Relational Grid Information Service
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Synthesizing Realistic Computational Grids
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Realistic Modeling and Svnthesis of Resources for Computational Grids
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Nondeterministic Queries in a Relational Grid Information Service
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Automatic resource specification generation for resource selection
Proceedings of the 2007 ACM/IEEE conference on Supercomputing
| Hi-index | 0.00 |
We are developing a grid information service, RGIS, that isbased on the relational data model. RGIS supports complexqueries written in SQL that search for compositions (using joins)of resources. For example, we might ask it to find a Linux clusterwith a certain bisection bandwidth and total memory. Such queriescan be expensive to execute, however, and so we have developedseveral approaches that leverage our GIS schema to let us tradeoff between the number of results returned and the execution time.In this paper, we describe two of them: scoped queries and approximatequeries. Scoped queries constrain search to a networkneighborhood, returning all matching results in the neighborhood.Approximate queries reduce the number of joins done by replacingcollective constraints with constraints on individual resources,returning a subset of all the possible results in the grid. Scoping,approximation, and nondeterminism (described elsewhere),can be combined. In this paper, we describe scoped and approximatequeries, how they are implemented, and present performanceevaluations for two examples. The evaluation suggests that scopingand approximation can greatly reduce query times while stillreturning a useful number of results.