Research Optimal Size Sorting Networks

Paper: Research Optimal Size Sorting Networks

Instructions

Arguments that should be used when executing the code.
('argName' : arg : comment)

SortingNetworksParallel:

<n> <k> <innerSize> <ThreadPercentage>
n : #channels (e.g. 8)
k : #comparator : The maximum amount of comparators to calculate to, the upperBound. (e.g. 19)
innerSize : :The amount of networks a thread takes to generate on. (e.g. 256)
ThreadPercentage : : The percentage of threads used, [0-1]. Used with the Java getAvailableProcessors(). (e.g. 1)

Using the input it will output a comparator network. This network will be a sorting network of optimal size when the comparator upperBound is high enough. Any output will be in a bit format. (e.g. 5 = 0..0101 = comparator (1 3))

SortingNetworksGenerator:

JFileChooser : <n> <k>
n : #channels
k : #comparators
path : <n> <k> <path>
n : #channels
k : #comparators
path : path to output saveFile

SortingNetworksTester:

File : -f <path>
path : path to input loadFile (results append behind each network line.)
Network Arg : -n <n> comp1,comp2,comp3,...
n : #channels
k : #comparators,
comp1 : first comparator. (e.g. 5 = 0...0101 = (1 3))
comp2 : second comparator.
JFileChooser : : Chose file to test using FileChooser

Will output true if the given network is a sorting network, false otherwise.

SortingNetworksVisualizer:

File : -fp <path> / -f <path>
path : path to input loadFile, the p is optional = save image.
Network Arg : -n(p) <n> <k> (<channel1_1>, <channel2_1>)(<channel1_2>,<channel2_2>)...
n : #channels
k : #comparators
channel1_1 : first channel of comparator 1
channel2_1 : second channel of comparator 1
Again, the p is optional = save image