A benchmark for the sorting network problem

  • Authors:

  • Michal Bidlo

  • Affiliations:

  • Brno University of Technology, Brno, Czech Republic

  • Venue:
  • GECCO '05 Proceedings of the 7th annual workshop on Genetic and evolutionary computation
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Consider a compare-swap operation that compares and possibly swaps the values of its two operands (a, b), so that we obtain a pair (a, b) satisfying a ≤ b after execution. A sorting network is a sequence of compare-swap operations that depends only on the number of elements to be sorted [1]. Let's call the compare-swap operation as a comparator. An advantage of sorting networks against the classical sorting algorithms is that the number of comparators is fixed for a given number of inputs. Thus they can be easily implemented in hardware. Figure 1 shows an example of a three-input sorting network and its alternative symbol.