Sorting network

Such networks are typically designed to perform sorting on fixed numbers of values, . This video is part of an online course, Intro to Parallel Programming. Jul In general, verifying whether a particular comparison network is indeed a correct sorting network is a Co-NP complete problem. If you want to check by testing, then you need to try exponentially many tests.

The main difference between sorting networks. A network sort, also known as an oblivious sort, is a set of comparators.

Since each comparator has no knowledge of what any other . Each comparator exchanges its inputs if the inputs are out of order. What are sorting networks ? Not general purpose enough for most . A parallel model of computation where comparisons can be made simultaneously. Comparator: x y min(x,y) max(x,y).

Draw the following network, insert data and propagate them. The sequence will be sorted. Argue that four arbitrary numbers are sorted by the network.

Depth is the maximum number of comparators on a. There is a convenient graphical representation of sorting networks. An horizontal line represents each input of the sorting network and a connection between two lines represents each comparator which compares the two elements and exchanges them if the one on the upper line is larger than the one on the lower line. A comparator network is a network composed of comparators. There are input wires, each feeding a single comparator.

Each output of a comparator is either an output wire, or feeds a single comparator. The network must be acyclic. Number of output wires must also be. This paper describes networks that have a fast sort- ing or ordering capability sorting networks or sorting memories.

It has the advantages over a normal crossbar of requiring less. A sorting network can be used as a multiple- input, multiple- output switching network. The running time of a sorting network is just its depth. Consider the sorting circuit. In the quest for fast sorting methods, a number of networks have been designed that sort n elements in time significantly smaller than Q(n log n).

Sorting network based on insertion sort. These sorting networks are based on a comparison network model, in which many comparison operations are performed simultaneously. Oct Abstract: This paper settles the optimality of sorting networks given in The Art of Computer Programming vol.

The book lists efficient sorting networks with n = inputs. In this article, we present a general .