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

more »

... 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 816 in parallel processing.The study also aims where the network inputs n=17. Index Terms-Comparators, cost, network optimization, parallel computing, sorting. editor of IJCTE, IJMO, JACN, LNSE and Coeditor of the journals JATIT and International Journal of Reviews in Computing. He is a reviewer of several Journals, including IJCSIT, JIISIT, IJCEE and CEE of Elsevier.