SPARQL-Based Set-Matching for Semantic Grid Resource Selection

Grid is an emerging technology that enables the sharing of a wide variety of resources. However, effective and accurate grid resource matching is difficult because of the dynamic characteristics and heterogeneity of grid resources. Grid resource matching mechanisms that utilize semantic Web technologies have been proposed to deal with this issue, although none support set matching of grid resources based on their semantic description. This paper proposes a novel set-matching algorithm that uses standard RDF query language SPARQL [1] to semantically match a set of grid resources and SPARQL query features to efficiently perform set matching. We evaluated the efficiency and effectiveness of the algorithm by performing a set of experiments and present the results.

[1]  Rajesh Raman,et al.  Matchmaking: distributed resource management for high throughput computing , 1998, Proceedings. The Seventh International Symposium on High Performance Distributed Computing (Cat. No.98TB100244).

[2]  Said Mirza Pahlevi,et al.  Towards Automatic Service Discovery and Monitoring in WS-Resource Framework , 2005, 2005 First International Conference on Semantics, Knowledge and Grid.

[3]  Chuang Liu,et al.  A constraint language approach to matchmaking , 2004, 14th International Workshop Research Issues on Data Engineering: Web Services for e-Commerce and e-Government Applications, 2004. Proceedings..

[4]  Stefan Decker,et al.  Ontology-Based Resource Matching in the Grid - The Grid Meets the Semantic Web , 2003, SEMWEB.

[5]  Rajesh Raman,et al.  Policy driven heterogeneous resource co-allocation with Gangmatching , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.