A Parallel Algorithm for Solving the Reversal Median Problem
- Cite this paper as:
- Bernt M., Merkle D., Middendorf M. (2006) A Parallel Algorithm for Solving the Reversal Median Problem. In: Wyrzykowski R., Dongarra J., Meyer N., Waśniewski J. (eds) Parallel Processing and Applied Mathematics. PPAM 2005. Lecture Notes in Computer Science, vol 3911. Springer, Berlin, Heidelberg
We present a new algorithm called rEvoluzer II for solving the Reversal Median problem (RMP). Similar to its predecessor rEvoluzer I the new algorithm can preserve conserved intervals but it has the additional property that it is suitable for parallelization. For the parallel version of rEvoluzer II a master-slave parallelization scheme is used and several methods for reducing parallelization overheads have been incorporated. We show experimentally that rEvoluzer achieves very good results compared to other methods for the RMP. It is also shown that the parallel version has good scaling behavior for a not too large number of processors.
Unable to display preview. Download preview PDF.