Sorting is among the first of algorithm, than any computer science student encounters during college and it is considered as a simple and well studied problem. With the advancement in parallel processing many parallel sorting algorithms have been investigated. These algorithms are designed for a variety of parallel computer architectures. In this paper, a… CONTINUE READING
Fig. 8 Recursive sorting by using Parallel quick sort 8(a) specifies that complete sequence distributed evenly among the processors (which is in power of 2). 8(b) Process P0 chooses and broadcasts randomly chosen pivot value 8(c) specifies exchanging of “lower half” and “upper half” values” 8(d) shows after the exchange step In 8(e) Processors P0 and P2 choose and broadcast randomly chosen pivots. In 8(f) exchange of values takes place 8(g) Subsequences after the exchange steps. In 8(h) each processor sorts its subsequences by using sequential quick sort.