Optimal Average Case Sorting on Arrays

  title={Optimal Average Case Sorting on Arrays},
  author={Manfred Kunde and Rolf Niedermeier and Klaus Reinhardt and Peter Rossmanith},
We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then we asymptotically halve the up to now best running times. For a load of one optimal algorithms are known for the mesh. We improve this to a load of eight without increasing the running time. For tori no optimal algorithms were known even for a load of one. Our algorithm is optimal for every load. Other architectures we… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 15 references

oder, and J

  • M. Kaufmann, H. Schr
  • F. Sibeyn. Routing and sorting on recon g urable…
  • 1994
Highly Influential
4 Excerpts

Parallel computa tion on recon gurable meshes

  • R. Miller, V. K. Prasanna-Kumar, D. I. Reisis, Q. F. Stout
  • IEEE Transactions on Computers, 42(6):678{692…
  • 1993
1 Excerpt

Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes

  • T. Leighton
  • Morgan Kaufmann,
  • 1992
1 Excerpt

A guided tour of Cherno bounds

  • M. Hofri.
  • Information Processing Letters
  • 1990

Similar Papers

Loading similar papers…