4.7 Article

Policy-Aware Service Composition: Predicting Parallel Execution Performance of Composite Services

Journal

IEEE TRANSACTIONS ON SERVICES COMPUTING
Volume 11, Issue 4, Pages 602-615

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TSC.2015.2467330

Keywords

Service policy; service composition; parallel execution; degree of parallelism; performance prediction

Funding

  1. Japan Society for Promotion of Science (JSPS) [24220002]

Ask authors/readers for more resources

With the increasing volume of data to be analysed, one of the challenges in Service Oriented Architecture (SOA) is to make web services efficient in processing large-scale data. Parallel execution and cloud technologies are the keys to speed-up the service invocation. In SOA, service providers typically employ policies to limit parallel execution of the services based on arbitrary decisions. In order to attain optimal performance improvement, users need to adapt to the services policies. A composite service is a combination of several atomic services provided by various providers. To use parallel execution for greater composite service efficiency, the degree of parallelism (DOP) of the composite services need to be optimized by considering the policies of all atomic services. We propose a model that embeds service policies into formulae to calculate composite service performance. From the calculation, we predict the optimal DOP for the composite service, where it attains the best performance. Extensive experiments are conducted on real-world translation services. We use several measures such as mean prediction error (MPE), mean absolute deviation (MAD) and tracking signal (TS) to evaluate our model. The analysis results show that our proposed model has good prediction accuracy in identifying optimal DOPs for composite services.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available