QoS-based services selecting and optimizing algorithms on grid

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

QoS-Based Services Selecting and Optimizing Composition between the peers play an increasingly important role to ensure interoperability on Grid environment. However, the prohibitive cost of selecting, matching, mapping and composing algorithm has now become a key bottleneck hindering the deployment of a wide variety of Grid services. In this paper, we present QoS-Based Services Selecting and Optimizing Composition on Grid. First, it checks requesters' semantic in order to form candidate service graph. Second, it designs service selecting and mapping algorithms for optimizing the model. Third, it creates an executed plan of optimum composition on Grid. We conducted experiments to simulate and evaluate our approach. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Zhu, Q., Wang, S., Li, G., Liu, G., & Du, X. (2007). QoS-based services selecting and optimizing algorithms on grid. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4537 LNCS, pp. 156–167). Springer Verlag. https://doi.org/10.1007/978-3-540-72909-9_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free