Browse

There is carried out the analysis of parallel methods of binary numbers sorting, which allows to represent the algorithm in a graphical form. Particular attention is paid to the methods of binary numbers sorting, which are subject to hardware implementation, namely: the Batcher?s method, the method of "even-odd" permutation, the merging method, the method of "ideal shuffling" and the modified "bubbles" method. The theory of data flow graph of algorithm is studied, which is the basis of graphically specified sortin...