Randomized Routing, Selection, and Sorting on the OTIS-Mesh

  • Authors:

  • Sanguthevar Rajasekaran;Sartaj Sahni

  • Affiliations:

  • Univ. of Florida, Gainesville;Univ. of Florida, Gainesville

  • Venue:
  • IEEE Transactions on Parallel and Distributed Systems
  • Year:
  • 1998

Quantified Score

Hi-index 0.01

Visualization

Abstract

The Optical Transpose Interconnection System (OTIS) is a recently proposed model of computing that exploits the special features of both electronic and optical technologies. In this paper we present efficient algorithms for packet routing, sorting, and selection on the OTIS-Mesh. The diameter of an N2-processor OTIS-Mesh is $4\sqrt N-3.$ We present an algorithm for routing any partial permutation in $4\sqrt N+o\left( {\sqrt N} \right)$ time. Our selection algorithm runs in time $6\sqrt N+o\left( {\sqrt N} \right)$ and our sorting algorithm runs in $8\sqrt N+o\left( {\sqrt N} \right)$ time. All these algorithms are randomized and the stated time bounds hold with high probability. Also, the queue size needed for these algorithms is O(1) with high probability.