User:Oskar Sigvardsson/Sorting network
From Wikipedia, the free encyclopedia
A sorting network is an abstract mathematical model of a network of wires and comparator modules that is used to sort a sequence of numbers. Each comparator connects two wires and sort the values by outputting the smaller value to one wire, and a larger value to the other. The main difference between sorting networks and comparison sorting algorithms is that the sequence of comparisons is set in advance, regardless of the outcome of previous comparisons. Despite the simplicity of the model, sorting network theory is surprisingly deep and complex. Recent attempts at using genetic algorithms to optimise sorting networks have given results which have improved on decades of work by mathematicians and engineers.
Contents |
[edit] Introduction
A sorting network consists of two things, comparators and wires. Each wire carries with it a value, and each comparator takes two wires as input and output. When two values enter a comparator, the comparator emits the lower value from the top wire, and the higher value from the bottom wire. A network of wires and comparators that will correctly sort all possible inputs into ascending order is called a sorting network.
The full operation of a simple sorting network is shown below. It is easy to see why this sorting network will correctly sort the inputs; note that the first four comparators will "sink" the largest value to the bottom and "float" the smallest value to the top. The final comparator simply sorts out the middle two wires.
[edit] Insertion and Selection networks
We can easily construct a network of any size recursively using the principles of insertion and selection. Assuming we have have a sorting network of size n, we can construct a network of size n+1 by "inserting" an additional number into the already sorted subnet (using the principle behind insertion sort). We can also accomplish the same thing by first "selecting" the lowest value from the inputs and then sort the remaining values recursively (using the principle behind bubble sort).
|
|
The structure of these two sorting networks are very similar. A construction of the two different variants that collapses together comparators that can be performed simultaneously shows that, in fact, they are identical.
|
|
|
[edit] Zero-one principle
While it is easy to prove the validity of some sorting networks (like the insertion/bubble sorter), it is not always so easy. There are n! permutations of numbers in an n-wire network, and to test all of them would take a significant amount of time, especially on larger networks. However, because of the so-called Zero-one principle, far fewer trials are in fact needed to test the validity of a sorting network.
The Zero-one principle states that a sorting network is valid if it can sort all 2n sequences of of 0s and 1s. This drastically cuts down on the number tests needed to ascertain the validity of a network, as well is of great use in creating many constructions of sorting networks.
The proof is a special case of Bouricius's Theorem, proved by W. G. Bouricius in 1954.
[edit] Optimal sorting
The efficiency of a sorting network can be measured by its total size (the number of comparators used), or by its depth (the maximum number of comparators along any path from an input to an output). The asymptotically best sorting network, discovered by Ajtai, Komlós, and Szemerédi, achieves depth O(log n) and size O(n log n) for n inputs, which is asymptotically optimal. While an important theoretical discovery, the AKS network has little or no practical application because of the large linear constants hidden by the Big-O notation. These are partly due to a construction of an expander graph. Finding sorting networks with depth (c n log n) for small c remains a fundamental open problem.
[edit] See also
[edit] References
- O. Angel, A.E. Holroyd, D. Romik, B. Virag, Random Sorting Networks, Adv. in Math., 215(2):839--868, 2007.
- K.E. Batcher, Sorting networks and their applications, Proceedings of the AFIPS Spring Joint Computer Conference 32, 307--314 (1968)
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 1990. ISBN 0-262-03293-7. Chapter 27: Sorting Networks, pp.704–724.
- D.E. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching, Third Edition. Addison-Wesley, 1997. ISBN 0-201-89685-0. Section 5.3.4: Networks for Sorting, pp. 219–247.
- Ajtai, M.; Komlós, J. & Szemerédi, E. (1983), “Sorting in c log n parallel steps”, Combinatorica 3 (1): 1-19, DOI 10.1007/BF02579338
[edit] External links
|
||||||||||||||||||||||||||||
