Randomized routing, selection, and sorting on the OTIS-mesh

Author

Rajasekaran, Sanguthevar ; Sahni, Sartaj

Author_Institution

Dept. of Comput. & Inf. Sci., Florida Univ., Gainesville, FL, USA

Volume

9

Issue

9

fYear

1998

fDate

9/1/1998 12:00:00 AM

Firstpage

833

Lastpage

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 N²-processor OTIS-Mesh is 4√N-3. We present an algorithm for routing any partial permutation in 4√N+o(√N) time. Our selection algorithm runs in time 6√N+o(√N) and our sorting algorithm runs in 8√N+o(√N) 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

Keywords

multiprocessor interconnection networks; optical computing; parallel algorithms; randomised algorithms; sorting; OTIS-Mesh; Optical Transpose Interconnection System; mesh-connected computers; optical computing; packet routing; parallel algorithms; partial permutation; randomized algorithms; selection algorithm; sorting; Computer Society; Concurrent computing; Hypercubes; Optical computing; Optical fiber communication; Optical interconnections; Parallel algorithms; Partitioning algorithms; Routing; Sorting;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.722217

Filename

722217