Research On Semantic Grid Services Match Technology

As a new model of Web applications and distributed computing model, semantic grid resources have been modeling for Services, which have fundamentally solved interoperability and communication problems between enterprises and enterprises heterogeneous systems. The objective of research on Grid Services is to improve its precision and recall rate. With the development of grid services, how to find out resources from a large group of service to meet the users'request by semantic grid will be to restrict the development of grid. And the advantages and disadvantages of service match directly determine the efficiency of grid resources.It made a research on the theory of grid service match and related algorithms thoroughly in this paper. And it mainly includes three aspects below:1. It introduced concepts relating to the ontology. At the same time, it elaborated on the modeling methods and modeling language, the description of logic, and OWL-S language technology. In this paper, it designed an experimental body with Protégé4.0.2 This paper analyzed the current situation and problems of Semantic Grid services research. It put forward a match model founding on semantic on the basis of Massimo Paolucci flexibility in matching algorithm. The matching algorithm can be mainly divided into the following three points: First, the match of the general concept of services, on the basis of which type of concept model their respective value belongs to, which includes the major service category, service name and text description in the match. Second, the match relating to the degree of semantic services, which is mainly to match the functional properties of the service, including input, output, and precondition and effect .Last, the match of quality of service, which is mainly to match the non-functional properties of the service, including service response time, the cost of services as well as the reliability.3. In order to verify the feasibility and effectiveness of semantic-based match algorithm, it designed prototype system named SGSM (Semantic Grid Service Matcher). It also made a research on the structure of the system model in this paper, which shows that the semantic-based match algorithm is practical. Compared to the traditional keyword-based matching services, semantic-based match has made a big progress in precision and recall rate.