A Parallel Algorithm for Solving the Reversal Median Problem

  • Matthias Bernt
  • Daniel Merkle
  • Martin Middendorf
Conference paper

DOI: 10.1007/11752578_132

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3911)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Matthias Bernt
    • 1
  • Daniel Merkle
    • 1
  • Martin Middendorf
    • 1
  1. 1.Department of Computer ScienceUniversity of LeipzigGermany

Personalised recommendations