Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses

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/sup /spl epsiv///spl times/n for any constant /spl epsiv/>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.

[1]  Ravi B. Boppana.  The Average-Case Parallel Complexity of Sorting , 1989, Inf. Process. Lett..

[2]  D. Peleg,et al.  The Power of Recon guration , 1998 .

[3]  Viktor K. Prasanna,et al.  An Optimal Sorting Algorithm on Reconfigurable Mesh , 1995, J. Parallel Distributed Comput..

[4]  Russ Miller,et al.  Meshes with reconfigurable buses , 1988 .

[5]  Stephan Olariu,et al.  Reconfigurable Buses with Shift Switching: Concepts and Applications , 1995, IEEE Trans. Parallel Distributed Syst..

[6]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[7]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[8]  Yi Pan.  Order statistics on optically interconnected multiprocessor systems , 1994, First International Workshop on Massively Parallel Processing Using Optical Interconnections.

[9]  Frank Thomson Leighton,et al.  Tight Bounds on the Complexity of Parallel Sorting , 1984, IEEE Transactions on Computers.

[10]  Hossam A. ElGindy,et al.  Selection on the Reconfigurable Mesh , 1991, ICPP.

[11]  Sartaj Sahni,et al.  A Self-Routing Benes Network and Parallel Permutation Algorithms , 1981, IEEE Transactions on Computers.

[12]  Sanguthevar Rajasekaran,et al.  Sorting and selection on interconnection networks , 1994, Interconnection Networks and Mapping and Scheduling Parallel Computations.

[13]  Sartaj Sahni,et al.  Sorting n numbers on n*n reconfigurable meshes with buses , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[14]  Ronald L. Rivest,et al.  Expected time bounds for selection , 1975, Commun. ACM.

[15]  Dionysios I. Reisis,et al.  Parallel Computations on Reconfigurable Meshes , 1993, IEEE Trans. Computers.

[16]  Johan Håstad,et al.  Optimal bounds for decision problems on the CRCW PRAM , 1987, STOC.

[17]  Rami G. Melhem,et al.  Space Multiplexing of Waveguides in Optically Interconnected Multiprocessor Systems , 1989, Comput. J..

[18]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[19]  Sartaj Sahni,et al.  Reconfigurable mesh algorithms for image shrinking, expanding, clustering, and template matching , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

[20]  Ramachandran Vaidyanathan,et al.  On the power of segmenting and fusing buses , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[21]  Richard J. Anderson.  Optical Communication for Pointer Based Algorithms , 1988 .

[22]  Sanguthevar Rajasekaran,et al.  Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection , 1993, ESA.

[23]  Leslie G. Valiant,et al.  General Purpose Parallel Architectures , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[24]  Frank Thomson Leighton,et al.  A doubly logarithmic communication algorithm for the completely connected optical communication parallel computer , 1993, SPAA '93.

[25]  Sartaj Sahni.  Data Manipulation on the Distributed Memory Bus Computer , 1995, Parallel Process. Lett..

[26]  Selim G. Akl,et al.  Matrix Operations Using Arrays with Reconfigurable Optical Buses* , 1996, Parallel Algorithms Appl..

[27]  S.B. Rao,et al.  Optical interprocessor communication protocols , 1994, First International Workshop on Massively Parallel Processing Using Optical Interconnections.

[28]  David Peleg,et al.  The Power of Reconfiguration , 1991, J. Parallel Distributed Comput..

[29]  Thanasis Tsantilas,et al.  Efficient optical communication in parallel computers , 1992, SPAA '92.

[30]  Sanguthevar Rajasekaran,et al.  Derivation of Randomized Sorting and Selection Algorithms , 1993 .