Randomized routing on meshes with buses

  • Jop F. Sibeyn
  • Michael Kaufmann
  • Rajeev Raman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 726)


We give algorithms and lower bounds for the problem of routing k-permutations on d-dimensional MIMD meshes with row and column buses We prove a lower bound for routing permutations (the case k=1) on d-dimensional meshes. For d=2, 3 and 4 the lower bound is respectively 0.69·n, 0.72·n and 0.76·n steps; the bound increases monotonically with d and is at least (1−1/dn steps for all d≥5. Previously, a bisection argument had been used to show that for all d≥1, 0.66·n steps axe required for this problem (i.e., the lower bound did not increase with increasing d). These lower bounds hold for off-line routing as well. We give a general algorithm that routes k-permutations on d-dimensional meshes in min{(2−1/d) · k · n, max{4/3 · d · n, k · n/3}} + o(d · k · n) steps, for all k, d≥1. This improves considerably on previous results for many values of k and d. In particular, the routing time for permutations is bounded by 2 · n, for all 1≤d<n1/3, and the routing time is optimal for all k≥4 · d. More specialized algorithms have better performance for routing on 2-dimensional meshes. A simple algorithm routes 2-permutations in 1.39 · n steps, and a more sophisticated one routes permutations in 0.78 · n steps. This is the first algorithm that routes permutations on the 2-dimensional mesh in less than n steps. The algorithms are randomized, on-line and achieve the given routing times with high probability.


parallel computation algorithms packet routing meshes buses lower bounds randomization coloring 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. Angluin and L. G. Valiant. Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. Comput. Sys. Sc., 18 (1979), pp. 155–193.Google Scholar
  2. 2.
    S. H. Bokhari, Finding maximum on an array processor with a global bus, IEEE Trans. Comput., 33 (1984), pp. 133–139.Google Scholar
  3. 3.
    S. Cheung and F. C. M. Lau, A lower bound for permutation routing on two-dimensional bused meshes, IPL, 45 (1993), pp. 225–228.Google Scholar
  4. 4.
    W. M. Gentleman, Some complexity results for matrix computations on parallel processors, J. ACM, 25 (1978), pp. 112–115.Google Scholar
  5. 5.
    M. Kaufmann, S. Rajasekaran and J. F. Sibeyn, Matching the bisection bound for routing and sorting on the mesh, in Proc. 4th ACM SPAA (1992), pp. 31–40.Google Scholar
  6. 6.
    M. Kaufmann and J. F. Sibeyn, Optimal multi-packet routing on the torus, In Proc. 3rd Scandinavian Workshop on Algorithm Theory (1992), LNCS 621, pp. 118–129.Google Scholar
  7. 7.
    M. Kunde, Routing and sorting on mesh connected processor arrays, in Proc. 3rd Aegean Workshop on Computing (1988), LNCS 319, pp. 423–433.Google Scholar
  8. 8.
    M. Kunde and T. Tensi, Multi-packet routing on mesh connected processor arrays, in Proc. 2nd ACM SPAA (1989), pp. 336–343.Google Scholar
  9. 9.
    F. T. Leighton, F. Makedon, I. G. Tollis, A 2n-2 step algorithm for routing in an n × n array with constant size queues, in Proc. 2nd ACM SPAA (1989), pp. 328–335.Google Scholar
  10. 10.
    J. Leung and S. M. Shende, On multi-dimensional packet routing for meshes with buses, in Proc. 3rd IEEE SPDP (1991), pp. 834–837. J. Parl. Dist. Comp., to appear.Google Scholar
  11. 11.
    S. Rajasekaran and T. Tsantilas, Optimal routing algorithms for mesh-connected processor arrays, Algorithmica, 8 (1992), pp. 21–38.Google Scholar
  12. 12.
    J. F. Sibeyn and M. Kaufmann, k-k sorting on meshes, manuscript, 1992.Google Scholar
  13. 13.
    L. G. Valiant and G. J. Brebner, Universal schemes for parallel communication, in Proc. 13th ACM STOC (1981), pp. 263–277.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Jop F. Sibeyn
    • 1
  • Michael Kaufmann
    • 2
  • Rajeev Raman
    • 3
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany
  2. 2.Wilhelm-Schickard-Institut für InformatikUniversität TübingenTübingenGermany
  3. 3.UMIACSUniversity of MarylandCollege ParkUSA

Personalised recommendations