Abstract—Sorting network problem seems to be a very simple, yet very complex but still maintains an attractive field for the researchers. The focus of the study is to review relevant work towards migration of smallest value to the uppermost horizontal output, while the largest to the lowest output signal in an iterative manner. The network depth, total number of comparators and the cost of the implementation of algorithm have the definite role in generalizing the solution set. This study illuminates the genuine and cogent arguments addressing the problem nodes in tune of migrating inputs, network efficiency, techniques previously studied optimization and cost constraints. The problem emerges as the input increases from 8<n<16 and becomes invincibly difficult when n>16 in parallel processing.The study also aims where the network inputs n=17.
Index Terms—Comparators, cost, network optimization, parallel computing, sorting.
The authors are with Faculty of Computer Science, Preston University, Islamabad, Pakistan (e-mail: msikandar59@gmail.com).
Cite: S. Ureeb and M. S. H. Khiyal, "Migrating Inputs: A Comparator Based Sorting," International Journal of Machine Learning and Computing vol. 5, no. 1, pp. 31-35, 2015.