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 5: 5(a) specifies that one processor broadcast initial pivot to all processors. 5(b) each processor in the upper half swaps with a partner in the lower half. 5(c) specifies recursion on each half. 5(d) shows the swapping among partners in each half. In 5(e) each process uses quick sort to sort elements locally.