Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 1993: Algorithms and Computation pp 157–166Cite as

Permutation routing on reconfigurable meshes

Extended abstract

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 762))

Abstract

In this paper we present efficient algorithms for packet routing on the reconfigurable linear array and the reconfigurable two dimensional mesh. We introduce both worst case algorithms and algorithms that are better on average. The time bounds presented are better than those achievable on the conventional mesh and previously known algorithms.

We present two variants of the reconfigurable mesh. In the first model, Mr, the processors are attached to a reconfigurable bus, the individual edge connections being bidirectional. In the second model, Mmr, the processors are attached to two unidirectional reconfigurable buses. In this paper, we present lower bounds and nearly matching upper bounds for packet routing on these two models. As a consequence, we solve two of the open problems mentioned in [15].

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. Ben-Asher, D. Peleg, R. Ramaswami, and A. Schuster, The Power of Reconfiguration, Journal of Parallel and Distributed Computing, 1991, pp. 139–153.

    Google Scholar 

  2. D.P. Doctor and D. Krizanc, Three Algorithms for Selection on the Reconfigurable Mesh, Manuscript, 1992.

    Google Scholar 

  3. H. ElGindy and P. Wegrowicz, Selection on the reconfigurable Mesh, Proc. International Conference on Parallel Processing, 1991, pp. 26–33.

    Google Scholar 

  4. E. Hao, P.D. McKenzie and Q.F. Stout, Selection on the Reconfigurable Mesh, Proc. Frontiers of Massively Parallel Computation, 1992, pp. 38–45.

    Google Scholar 

  5. J. Jang, H. Park, and V.K. Prasanna, A fast Algorithm for Computing Histograms on a Reconfigurable Mesh, Proc. Frontiers of Massively Parallel Computation, 1992, pp. 244–251.

    Google Scholar 

  6. J. Jang, H. Park, and V.K. Prasanna, An Optimal Sorting Algorithm on the Reconfigurable Mesh, Proc. International Parallel Processing Symposium, 1992, pp. 130–137.

    Google Scholar 

  7. J Jenq and S. Shani, Reconfigurable Mesh Algorithms for Image Shrinking, Expanding, Clustering, and Template Matching, Proc. International Parallel Processing Symposium, 1991, pp. 208–215.

    Google Scholar 

  8. J Jenq and S. Shani, Histogramming on a Reconfigurable Mesh Computer, Proc. International Parallel Processing Symposium, 1992, pp. 425–432.

    Google Scholar 

  9. J Y-T. Leung and S. M. Shende, Packet Routing on Square Meshes with Row and Column Buses, in Proc. IEEE Symposium on Parallel and Distributed Processing, Dallas, Texas, Dec. 1991, pp. 834–837.

    Google Scholar 

  10. J Y-T. Leung and S. M. Shende, On Multi-Dimensional Packet Routing for Meshes with Buses, to appear in Journal of Parallel and Distributed Computing, 1993.

    Google Scholar 

  11. R. Miller, V.K. Prasanna-Kumar, D. Reisis, and Q.F. Stout, Meshes with Reconfigurable Buses, in Proc. 5th MIT Conference on Advanced Research in VSLI, 1988, pp. 163–178.

    Google Scholar 

  12. K. Nakano, D. Peleg, and A. Schuster, Constant Time Sorting on a Reconfigurable Mesh, Manuscript, 1992.

    Google Scholar 

  13. S. Rajasekaran, k-k Routing, k-k Sorting, and Cut Through Routing on the Mesh, Technical Report, Department of CIS, University of Pennsylvania, Philadelphia, PA 19104, October 1991.

    Google Scholar 

  14. S. Rajasekaran, Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection, to be presented in the First Annual European Symposium on Algorithms, October 1993.

    Google Scholar 

  15. S. Rajasekaran and T. McKendall, Permutation Routing and Sorting on the reconfigurable Mesh, Technical Report MS-CIS-92-36, Department of Computer and Information Science, University of Pennsylvania, May 1992.

    Google Scholar 

  16. S. Rajasekaran and Th. Tsantilas, Optimal Routing Algorithms for Mesh-Connected Processor Arrays, Algorithmica 8, 1992, pp. 21–38.

    MathSciNet  Google Scholar 

  17. J.C. Cogolludo and S. Rajasekaran, Packet Routing Algorithms for Meshes with Reconfigurable Buses, Technical Report, Department of CIS, University of Pennsylvania, Philadelphia, PA 19104, June 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of CIS, Univ. of Pennsylvania, USA

    J. C. Cogolludo & S. Rajasekaran

Authors
  1. J. C. Cogolludo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Rajasekaran
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. W. Ng P. Raghavan N. V. Balasubramanian F. Y. L. Chin

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cogolludo, J.C., Rajasekaran, S. (1993). Permutation routing on reconfigurable meshes. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_245

Download citation

  • DOI: https://doi.org/10.1007/3-540-57568-5_245

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57568-9

  • Online ISBN: 978-3-540-48233-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation