Lower bounds for sorting on mesh-connected architectures

  • Manfred Kunde
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 227)


Lower bounds for sorting on mesh-connected arrays of processors are presented. For sorting N = elements on an n1 × n2 × ... × nr array 2(n1 + ... + nr−1) + nr data interchange steps are needed asymptotically. For two dimensions these bounds are asymptotically best possible provided that n1 and n2 are powers of 2. In this case the generalized s2-way merge sort of Thompson and Kung turns out to be asymptotically optimal. The minimal asymptotic bound of 2√2N interchange steps can be obtained only by sorting algorithms suitable for √N/2 × √2N meshes. For r ≥ 3 dimensions an analysis of aspect-ratios also indicates that there might be mesh-connected architectures which are better suited for sorting than simple r-dimensional cubes.


Index Function Systolic Array Sorting Algorithm Linear Factor Processor Array 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [FK]
    Foster, M.J., Kung, H.T.: The Design of Special-Purpose VLSI-Chips. IEEE Computer (1980), 26–40.Google Scholar
  2. [K]
    Kunde, M.: A General Approach to Sorting on 3-Dimensionally Mesh-Connected Arrays. Submitted to CONPAR 86.Google Scholar
  3. [KL]
    Kung, H.T., Leiserson, C.E.: Systolic Arrays for VLSI. Symposium on Sparse Matrix Computation 1978, Proceedings, eds.: I.S. Duff, C.G. Stewart, (1978).Google Scholar
  4. [KH]
    Kumar, M., Hirschberg, D.S.: An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and its Application in Parallel Sorting Schemes. IEEE Trans. Comptrs., Vol. C-32 (1983), pp 254–264.Google Scholar
  5. [LSSS]
    Lang, H.W., Schimmler, M., Schmeck, H., Schröder, H.: A Fast Sorting Algorithm for VLSI. In: Goos, G., Hartmanis, J. (eds): "Automata, Languages and Programming", LNCS 154, Springer-Verlag (1983), 408–419.Google Scholar
  6. [NS]
    Nassimi, D., Sahni, S.: Bitonic Sort on a Mesh-Connected Parallel Computer. IEEE Trans. Comptrs., Vol.C-28 (1979), pp 2–7.Google Scholar
  7. [S]
    Schimmler, M.: Fast Sorting on a Three Dimensional Cube Grid. Technical Report, University of Kiel, Germany, 1986.Google Scholar
  8. [SI]
    Sado, K., Igarashi, Y.: A Fast Parallel Pseudo-Merge Sort Algorithm. Technical Report, Gunma University, Japan, 1985.Google Scholar
  9. [SSS]
    Schmeck, H., Schröder, H., Starke, C.: Systolic s2-Way Merge Sort is Nearly Optimal. Technical Report, University of Kiel, Germany, 1986.Google Scholar
  10. [TK]
    Thompson, C.D., Kung, H.T.: Sorting on a Mesh-Connected Parallel Computer. CACM, Vol. 20 (1977), pp 263–271.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Manfred Kunde
    • 1
  1. 1.Institut für InformatikTechnische Universität MünchenMünchen 2W. Germany

Personalised recommendations