title: TRANSFORMATION OF SORTING NETWORKS FOR DIFFERENT DEGREES OF PARALLELISM
abstract: Some well-known sorting algorithms may be more efficient than others according to any of themain criteria: the number of performed operations, the execution time of elementary operations, theused memory capacity, the parallelism degree, the functional regularity of connections in the informationgraph of algorithm, etc. At the same time, it is possible to choose such sorting algorithm, whichwill take up a minimum hardware resource after performance reducing operation of computationalstructure. Th
journal: Izvestiâ ÛFU. Tehničeskie nauki