Scalability of parallel sorting on mesh multicomputers

The paper presents two new parallel algorithms QSP1 and QSP2 based on sequential quicksort for sorting data on a mesh multicomputer, and analyzes their scalability using the isoefficiency metric. It shows that QSP2 matches the lower bound on the isoefficiency function for mesh multicomputers. The isoefficiency of QSP1 is also fairly close to optimal. Lang et al. (1985) and Schnorr et al. (1986) have developed parallel sorting algorithms for the mesh architecture that have either optimal (Schnorr) or close to optimal (Lang) run-time complexity for the one-element-per-processor case. Both QSP1 and QSP2 have worse performance than these algorithms for the one-element-per-processor case. But QSP1 and QSP2 have better scalability than the scaled-down variants of these algorithms (for the case in which there are more elements than processors). As a result, the new parallel formulations are better than these scaled-down variants in terms of speedup w.r.t the best sequential algorithms. The paper also presents a different variant of Lang's sort which is asymptotically as scalable as QSP2 (for the multiple-element-per-processor case). It briefly discusses another metric called 'resource consumption metric'. According to this metric, both QSP1 and QSP2 are strictly superior to Lang's sort and its variations.<<ETX>>

[1]  Ming-Deh A. Huang.  Solving some graph problems with optimal or near-optimal speedup on mesh-of-trees networks , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[2]  Robert H. Halstead,et al.  MULTILISP: a language for concurrent symbolic computation , 1985, TOPL.

[3]  William C. Athas,et al.  Fine Grain Concurrent Computations , 1987 .

[4]  Bogdan S. Chlebus,et al.  Parallel Quicksort , 1991, J. Parallel Distributed Comput..

[5]  Sartaj Sahni,et al.  Hypercube algorithms for image processing and pattern recognition , 1990 .

[6]  Sartaj Sahni,et al.  A Hypercube Algorithm for the 0/1 Knapsack Problem , 1988, J. Parallel Distributed Comput..

[7]  Vipin Kumar,et al.  Scalability of Parallel Algorithms for the All-Pairs Shortest-Path Problem , 1991, J. Parallel Distributed Comput..

[8]  Anshul Gupta,et al.  On the scalability of FFT on parallel computers , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.

[9]  Michael J. Quinn,et al.  Designing Efficient Algorithms for Parallel Computers , 1987 .

[10]  Manfred Kunde.  Routing and Sorting on Mesh-Connected Arrays , 1988, AWOC.

[11]  Vipin Kumar,et al.  The Scalability of FFT on Parallel Computers , 1993, IEEE Trans. Parallel Distributed Syst..

[12]  W. Daniel Hillis,et al.  Data parallel algorithms , 1986, CACM.

[13]  Sartaj Sahni,et al.  All Pairs Shortest Paths on a Hypercube Multiprocessor , 1987, ICPP.

[14]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[15]  Hartmut Schmeck,et al.  Systolic Sorting on a Mesh-Connected Network , 1985, IEEE Transactions on Computers.

[16]  Rikio Onai,et al.  Research on Parallel Machine Architecture for Fifth-Generation Computer Systems , 1985, Computer.

[17]  Adi Shamir,et al.  An optimal sorting algorithm for mesh connected computers , 1986, STOC '86.

[18]  J. T. Robinson,et al.  Parallel Quicksort Using Fetch-and-Add , 1990, IEEE Trans. Computers.

[19]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[20]  Luc Devroye,et al.  A note on the height of binary search trees , 1986, JACM.