This Article 
 Bibliographic References 
 Add to: 
Randomized Routing, Selection, and Sorting on the OTIS-Mesh
September 1998 (vol. 9 no. 9)
pp. 833-840

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.

[1] D. Angluin and L.G. Valiant, "Fast Probabilistic Algorithms for Hamiltonian Paths and Matchings," J. Computer and Systems Science, vol. 18, pp. 155-193, 1979.
[2] H. Chernoff, "A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations," Annals Math. Statistics, vol. 23, pp. 493-507, 1952.
[3] W.D. Frazer and A.C. McKellar, "Samplesort: A Sampling Approach to Minimal Storage Tree Sorting," J. ACM, vol. 17, no. 3, pp. 496-507, 1970.
[4] W. Hendrick, O. Kibar, P. Marchand, C. Fan, D.V. Blerkom, F. McCormick, I. Cokgor, M. Hansen, and S. Esener, "Modeling and Optimization of the Optical Transpose Interconnection System," Optoelectronic Technology Center, Program Review, Cornell Univ., Sept. 1995.
[5] E. Horowitz, S. Sahni, and S. Rajasekaran, Computer Algorithms. W.H. Freeman, 1998.
[6] C. Kaklamanis and D. Krizanc,"Optimal Sorting on Mesh Connected Processor Arrays," Proc. ACM Symp. Parallel Algorithms and Architectures, pp. 50-59, 1992.
[7] G.C. Marsden, P.J. Marchand, P. Harvey, and S.C. Esener, "Optical Transpose Interconnection System Architectures," Optic Letters, vol. 18, no. 3, pp. 1,083-1,085, July 1993.
[8] S. Rajasekaran, "Sorting and Selection on Interconnection Networks," DIMACS Series Discrete Mathematics and Theoretical Computer Science, vol. 21, pp. 275-296, 1995.
[9] S. Rajasekaran and T. Tsantilas, "Optimal Routing Algorithms for Mesh Connected Processor Arrays," Algorithmica, vol. 8, pp. 21-38, 1992.
[10] S. Rajasekaran and J.H. Reif, "Derivation of Randomized Sorting and Selection Algorithms," Parallel Algorithm Derivation and Program Transformation, R. Paige, J.H. Reif, and R. Wachter, eds., pp. 187-205. Kluwer Academic, 1993.
[11] S. Sahni and C.-F. Wang, “BPC Permutations on the OTIS-Mesh Optoelectronic Computer,” Proc. Fourth Int'l Conf. Massively Parallel Processing Using Optical Interconnections (MPPOI '97), pp. 130-135, 1997.
[12] S. Sahni and C. Wang, "Basic Algorithms on the OTIS-Mesh Optoelectronic Computer," manuscript, 1997.
[13] F. Zane, P. Marchand, R. Paturi, and S. Esener, “Scalable Network Architectures Using the Optical Transpose Interconnection System (OTIS),” Proc. Second Int'l Conf. Massively Parallel Processing Using Optical Interconnections (MPPOI '96), pp. 114-121, 1996.

Index Terms:
Optical computing, mesh-connected computers, parallel algorithms, sorting, packet routing, selection, randomized algorithms.
Sanguthevar Rajasekaran, Sartaj Sahni, "Randomized Routing, Selection, and Sorting on the OTIS-Mesh," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 9, pp. 833-840, Sept. 1998, doi:10.1109/71.722217
Usage of this product signifies your acceptance of the Terms of Use.