Sorting and Routing on Otis-Mesh of Trees

OTIS (optical transpose interconnection system) is a popular model of optoelectronic parallel computers that has gained enormous attention in the recent years. Several parallel algorithms have been published for many fundamental problems on this architecture. In this paper, first we propose a parallel algorithm for sparse enumeration sort on OTIS-Mesh of Trees (OTIS-MOT). For N (= n2) data elements, our sorting algorithm requires 4 log N electronic moves + 3 OTIS moves. We next present a shortest path routing algorithm that runs also in logarithmic time.