Sorting and routing on the array with reconfigurable optical buses

In this paper we present efficient algorithms for sorting and packet routing on the AROB (Array with Reconfigurable Optial Buses) model.

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

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

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

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

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

[6]  Quentin F. Stout,et al.  Selection on the reconfigurable mesh , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

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

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

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

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

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

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

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

[14]  Sartaj Sahni,et al.  An optimal routing algorithm for mesh-connected Parallel computers , 1980, JACM.

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

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

[17]  Frank Thomson Leighton,et al.  Tight Bounds on the Complexity of Parallel Sorting , 1985, IEEE Trans. Computers.

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

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

[20]  Sartaj Sahni,et al.  Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses , 1997, IEEE Trans. Parallel Distributed Syst..

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

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

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

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

[25]  Jerry L. Trahan,et al.  Sorting on reconfigurable multiple bus machines , 1993, Proceedings of 36th Midwest Symposium on Circuits and Systems.