Title :
Sorting, selection, and routing on the array with reconfigurable optical buses
Author :
Rajasekaran, Sanguthevar ; Sahni, Sartaj
Author_Institution :
Dept. of Comput. & Inf. Sci., Florida Univ., Gainesville, FL, USA
fDate :
11/1/1997 12:00:00 AM
Abstract :
In this paper, we present efficient algorithms for sorting, selection, and packet routing on the AROB (Array with Reconfigurable Optical Buses) model. One of our sorting algorithms sorts n general keys in O(1) time on an AROB of size nε×n for any constant ε>0. We also show that selection from out of n elements can be done in randomized O(1) time employing n processors. Our routing algorithm can route any h-relation in randomized O(h) time. All these algorithms are clearly optimal
Keywords :
optical information processing; optical interconnections; parallel algorithms; parallel architectures; parallel machines; randomised algorithms; reconfigurable architectures; sorting; Array with Reconfigurable Optical Buses; interprocessor communication; mesh-connected computers; optical computing; packet routing; reconfigurable networks; reconfigurable optical buses; selection; sorting; Counting circuits; Delay; Optical arrays; Optical computing; Optical fiber networks; Optical pulses; Optical switches; Optical waveguides; Routing; Sorting;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
