Service matchmaking with rough sets
Citations Over TimeTop 10% of 2006 papers
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.
Related Papers
- → A Lightweight Grid Middleware Based on OPENSSH - SCE(2007)11 cited
- Survey: Grid Computing and Semantic Web(2010)
- → Architectural model for grid resources discovery(2008)3 cited
- Scientific applications of grid computing : First International Workshop, SAG 2004 Beijing, China, September 20-24, 2004 : revised selected and invited papers(2005)
- → Adopting the Grid Computing & Semantic Web Hybrid for Global Knowledge Sharing(2012)