Advertisement

Routing problems on the mesh of buses

  • Kazuo Iwama
  • Eiji Miyano
  • Yahiko Kambayashi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 650)

Abstract

The mesh of buses (MBUSs) is a parallel computation model which consists of n×n processors, n row buses and n column buses. Upper and lower bounds for the routing problem over MBUSs are discussed. We first show elementary upper and lower bounds, 2n and 0.5n, respectively, for its parallel time complexity. The gap between 2n and 0.5n is then narrowed to 1.5n and n1 which is the main theme of the paper. The n lower bound might seem to be trivial but is actually not. Three counter examples will be shown against this kind of easy intuition.

Keywords

Processor Array Restricted Domain Regular Order Original Input Data Saving Zone 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A. Borodin and J. Hoporoft. Routing, merging and sorting on parallel models of computations. In Proc. 14th ACM Symposium on Theory of Computing, pp. 338–344, 1982.Google Scholar
  2. [2]
    K. Iwama and Y. Kambayashi. An o(logn) parallel connectivity algorithm on the mesh of buses. In Proc. 11th IFIP World Computer Congress, pp. 305–310, 1989.Google Scholar
  3. [3]
    K. Iwama, E. Miyano, and Y. Kambayashi. A parallel sorting algorithm on the mesh-bus machine. Information Processing Society of Japan SIGAL Reports, No. 18-2,, 1990.Google Scholar
  4. [4]
    K. Iwama, E. Miyano, and Y. Kambayashi. Mesh-buses vs. mesh-connections. Technical Report 91-C07, Kyushu Univ., Kyushu, Japan, 1991.Google Scholar
  5. [5]
    D. Krizanc, S. Rajasekaran, and T. Tsantilas. Optimal routing algorithms for meshconnected processor arrays. LNCS, Vol. 319, pp. 411–422, 1988.Google Scholar
  6. [6]
    M. Kunde. Routing and sorting on mesh-connected arrays. LNCS, Vol. 319, pp. 423–433, 1988.Google Scholar
  7. [7]
    Y. Ma, S. Sen, and I. Scherson. The distance bound for sorting on mesh-connected processor arrays is tight. In Proc. 27th IEEE Symp. on Foundations of Computer Science, pp. 255–263, 1986.Google Scholar
  8. [8]
    K. Nakano, T. Masuzawa, and N. Tokura. Optimal parallel sorting algorithms on processor arrays with multiple buses, 1991. manuscript.Google Scholar
  9. [9]
    C. Schnorr and A. Shamir. An optimal sorting algorithms for mesh connected computers. In Proc. 18th ACM Symposium on Theory of Computing, pp. 255–263, 1986.Google Scholar
  10. [10]
    Q. Stout. Meshes with multiple buses. In Proc. 27th IEEE Symp. on Foundations of Computer Science, pp. 264–273, 1986.Google Scholar
  11. [11]
    Q. F. Stout. Mesh-connected computers with broadcasting. IEEE Trans. Comput., Vol. C-32, 9, pp. 826–830, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Kazuo Iwama
    • 1
  • Eiji Miyano
    • 1
  • Yahiko Kambayashi
    • 2
  1. 1.Department of Computer Science and Communication EngineeringKyushu UniversityFukuokaJapan
  2. 2.Integrated Media Environment Experimental Lab.Kyoto UniversityKyotoJapan

Personalised recommendations