Advertisement

Sorting and selection on arrays with diagonal connections

  • Danny Krizanc
  • Lata Narayanan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 805)

Abstract

We examine the problems of sorting and selection on meshes and tori with diagonal connections. We are able to achieve dramatic reductions in time required for selection by making use of the diagonal connections. In particular, on an n × n mesh with diagonal connections, we show how to select the k-th largest of n2 elements in 0.65n steps, and on a torus in 0.59n steps. The best known results for the corresponding networks without diagonal connections are 1.15n and 1.13n respectively. We also give an algorithm for selection that works optimally on a random input on these networks. For the case of sorting, we show the surprising result that there can be no distance-optimal algorithm for sorting on a mesh with diagonal connections, on a model that does not use copies and allows only constant size queues. Combined with results due to Kunde et al. [7], our results imply that routing is easier than sorting on the mesh with diagonal connections when copies are disallowed and queues are restricted to size 10. We believe this is the first result of this type in the fixed connection network model. On a torus with diagonal connections, we show that any algorithm that does not use copies must take at least n-o(n) steps regardless of how large the queue size is. We also show nontrivial lower bounds for selection on meshes with diagonal connections.

Keywords

Mesh torus diagonal connections upper bounds lower bounds sorting selection randomized algorithms parallel algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Agarwal, B. Lim, D. Kranz, and J. Kubiatowicz. APRIL: A processor architecture for multiprocessing. In Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 104–114, 1990.Google Scholar
  2. 2.
    A. Condon and L. Narayanan. Upper and lower bounds for selection on the mesh. Unpublished manuscript, 1993.Google Scholar
  3. 3.
    C. Kaklamanis and D. Krizanc. Optimal sorting on mesh-connected processor arrays. In Symposium on Parallel Algorithms and Architecture, pages 50–59, 1992.Google Scholar
  4. 4.
    C. Kaklamanis, D. Krizanc, L. Narayanan, and A. Tsantilas. Randomized sorting and selection on mesh-connected processor arrays. In Symposium on Parallel Algorithms and Architecture, pages 17–28, 1991.Google Scholar
  5. 5.
    D. Krizanc, L. Narayanan, and R. Raman. A lower bound for sorting on the mesh. Submitted for publication, 1993.Google Scholar
  6. 6.
    M. Kunde. Lower bounds for sorting on mesh-connected architectures. Acta Informatica, 24:121–130, 1987.Google Scholar
  7. 7.
    M. Kunde, R. Niedermeier, and P. Rossmanith. Faster sorting and routing on grids with diagonals. In Symposium on Theoretical Aspects of Computer Science, 1994.Google Scholar
  8. 8.
    F. Leighton, F. Makedon, and I. Tollis. A 2n−2 step algorithm for routing in an n × n array with constant size queues. In Symposium on Parallel Algorithms and Architecture, pages 328–335, 1989.Google Scholar
  9. 9.
    D. Lenoski, J. Laudon, K. Gharachorloo, A. Gupta, and J. Hennessy. The directory-based cache coherence protocol for the DASH multiprocessor. In Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 148–159, 1990.Google Scholar
  10. 10.
    S. L. Lillevik. Touchstone program overview. In Proceedings of the 5th Distributed Memory Computing Conference, Charleston, SC, April 9–12 1990.Google Scholar
  11. 11.
    S. Rajasekaran and T. Tsantilas. Optimal algorithms for routing on the mesh. Algorithmica, 8:21–38, 1992.Google Scholar
  12. 12.
    C. Schnorr and A. Shamir. An optimal sorting algorithm for mesh-connected computers. In Symposium on the Theory of Computation, pages 255–263, 1986.Google Scholar
  13. 13.
    T. Suel. Nearly optimal deterministic sorting on mesh-connected arrays of processors. In preparation, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Danny Krizanc
    • 1
  • Lata Narayanan
    • 2
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada
  2. 2.Dept. of Computer ScienceConcordia UniversityMontrealCanada

Personalised recommendations