Service matchmaking with rough sets

Li, Maozhen, Yu, Bin, Huang, Chang, Song, Yong-Hua and Rana, Omer Farooq ORCID: https://orcid.org/0000-0003-3597-2646 2006. Service matchmaking with rough sets. Presented at: CCGrid06: Sixth IEEE International Symposium on Cluster Computing and the Grid, Singapore, 16-19 May 2006. Published in: Turner, Stephen John, Lee, Bu Sung and Cai, Wientong eds. Proceedings of the Sixth International Symposium on Cluster Computing and the Grid (CCGrid 06). , vol.1 Piscataway, NJ: IEEE, p. 130. 10.1109/CCGRID.2006.91

Full text not available from this repository.

Abstract

With the wide adoption of open grid services architecture (OGSA) and Web services resource framework (WSRF), the grid is emerging as a service-oriented computing infrastructure for engineers and scientists to solve data and computationally intensive problems. It is envisioned that computing resources in a future grid environment will be exposed as services. Service discovery becomes an issue of vital importance for a wider uptake of the grid. This paper presents RSSM, a rough sets based service matchmaking algorithm for service discovery with an aim to tolerate uncertainty in identifying service properties. The evaluation results show that the RSSM algorithm is more effective in service discovery compared with other mechanisms such as UDDI and OWLS.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Uncontrolled Keywords:	Web services resource framework, grid environment, open grid services architecture, rough sets, service discovery, service matchmaking, service-oriented computing infrastructure
Publisher:	IEEE
ISBN:	9780769525853
Related URLs:	Organisation
Last Modified:	24 Oct 2022 10:59
URI:	https://orca.cardiff.ac.uk/id/eprint/46612

Citation Data

Cited 13 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item