A model of service scheduling based on market mechanism and semantic

Authors:
Gang Wang;Yuhui Qiu;Guolin Pu
Affiliations:
Semantic Grid Laboratory, Southwest University, ChongQing, P.R. China;Semantic Grid Laboratory, Southwest University, ChongQing, P.R. China;Computer Science Department, SiChuan University of Arts and Science, DaZhou, P.R. China
Venue:
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
Year:
2008

Citing 5
Cited 0

Semantic Matching of Web Services Capabilities

ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
A software framework for matchmaking based on semantic web technology

WWW '03 Proceedings of the 12th international conference on World Wide Web
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
Hybrid ontology-based matchmaking for service discovery

Proceedings of the 2006 ACM symposium on Applied computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We should do service scheduling in pervasive environments. By comparing some present resource scheduling methods and discussing the importance of combining the market mechanism with semantic, we propose a model of service scheduling based on market mechanism and semantic (Market-Semantic). It includes the similarity measure between ontologies, the ascertaining of utility functions and resource price. By designing a new method to measure the similarity between ontology, and by looking on the ratio of capability and cost as the utility functions, we explore a method of service scheduling by which users not only can get the service satisfied, but also the resource can be allocated efficiently, Finally, the experiment proves that our method is better than the methods of Max-Semantic and Semantic-Cost-Max-Min.