Structuring of Algorithms for Data Sorting and New Principles of Their Parallelization

Review of well-known methods and data sorting structures is made. The areas of application of algorithms and software-hardware for sorting binary arrays in various applications are investigated. New principles of the implementation of structures and special processors are developed by deep parallelism of the processes of comparing data codes and realization of selection and multiplexing of the output data by logical processing of bits of the minimax characteristics. There are investigated the system characteristics of time and hardware complexity of the proposed scheme of technical solutions, in which modern advanced technical design solutions of the minimax node of comparison, single-digit incomplete binary adders and multiplexers with a phase paired control signals are used. The perspective directions of further improvement of the proposed principles of parallelization of computational operations in solving the problems of sorting data arrays are determined.