Permutation Routing on Reconfigurable Meshes

@inproceedings{Cogolludo1993PermutationRO,
  title={Permutation Routing on Reconfigurable Meshes},
  author={J. C. Cogolludo and Sanguthevar Rajasekaran},
  booktitle={ISAAC},
  year={1993}
}
In this paper we present efficient algorithms for packet routing on the reconfigurable linear array and the reconfigurable two dimensional mesh. We introduce algorithms that are efficient in the worst case 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… CONTINUE READING

References

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

Meshes with reconfigurable buses Rajasekaran , k − k routing , k − k sorting , and cut through routing on the mesh

  • D. Reisis
  • Journal of Algorithms
  • 1995

Routing and Sorting Fixed Topologies

  • T. Suel
  • Ph.D. Thesis,
  • 1994
3 Excerpts

A fast algorithm for computing histograms on a reconfigurable mesh

  • J. Jang, H. Park, V. K. Prasanna
  • Proc. Frontiers of Massively Parallel Computation…
  • 1992
2 Excerpts

Introduction to Parallel Algorithms and Architectures: Arrays–Trees– Hypercubes, Morgan-Kaufmann Publishers

  • T. Leighton
  • San Mateo, California,
  • 1992
2 Excerpts

Tsantilas, Optimal routing algorithms for mesh-connected processor

  • S. Rajasekaran, Th
  • arrays, Algorithmica
  • 1992
1 Excerpt

Similar Papers

Loading similar papers…