Efficient algorithm for replanning web service composition

Abstract

Web-service-composition (WSC) workload execution inside a hybrid cloud environment is challenging. A dynamic approach for allocating resources to various tasks, as well as associated sub-tasks having a satisfactory quality-ofservice (QoS) requirement, is necessary for the present real-time demand. As a result of focusing primarily on decreasing processing time as well as cost, current approaches improve latency as well as energy while executing a given workload. This study introduces an efficient re-planning (ERP) algorithm for running many scientific workloads inside a heterogeneous cloud environment, which is designed to address some of the shortcomings of previous approaches. With a changing workload, this study details a technique to improve the WSC's availability as well as robustness. The workload's processing energy requirements are reduced as a result. The montageworkflow has been used to validate the research findings. Comparison with the current heterogeneous earliest finish time (QL-HEFT) algorithm demonstrates that its ERP-WSC approach is much more efficient and reliable.

Proposal for an e-learning system model based on the invocation and semantic discovery of web services

“…These will be used by a matchmaking algorithm [22] which makes it possible to search a service register for services and detect the most relevant services at the functional level. These services must be composable because they will be brought to the composition stage [23]- [25].…”

Quality of Service Aware Task Replanning Algorithm for Web-Service Provisioning in Cloud Environment

“…The cloud enables WSC to be performed on a large scale, by leveraging the vast resources and capabilities of cloud service providers (CSPs). To schedule the tasks of the workload in order to reduce the execution time and energy consumption, the proposed model satisfies the constraints which have been presented in [23], [24].…”