Sciweavers

Share
ICWS
2010
IEEE

Highly Scalable Web Service Composition Using Binary Tree-Based Parallelization

9 years 8 months ago
Highly Scalable Web Service Composition Using Binary Tree-Based Parallelization
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplication of CPU cores, algorithms have to be redesigned to benefit from this evolution. In this paper we present a framework for parallelizing service composition algorithms investigating how to partition the composition problem into multiple parallel threads. But in contrast to intuition, the straightforward parallelization techniques do not lead to superior performance as our baseline evaluation reveals. To harness the full power of multi-core architectures, we propose two novel approaches to evenly distribute the workload in a sophisticated fashion. In fact, our extensive experiments on practical life science data resulted in an impressive speedup of over 300% using only 4 cores. Moreover, we show that our techniques can also benefit from all advanced pruning heuristics used in sequential algorithms. Keywords
Patrick Hennig, Wolf-Tilo Balke
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2010
Where ICWS
Authors Patrick Hennig, Wolf-Tilo Balke
Comments (0)
books