Parallel sorting algorithm optimization represents a critical area of research aimed at accelerating the arrangement of large data sets by exploiting modern multi-core and many-core architectures. By ...
In recent years with the advent of programming techniques, parallel programming consumes less execution time as compared to sequential. The odd-even merge sort algorithm was developed by K.E. Batcher.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results