Fundamental Algorithms for the Array with Reconfigurable Optical Buses

In this chapter we present a survey of algorithms that have been developed for packet routing, sorting, and selection on the AROB (Array with Reconfigurable Optical Buses) model. The algorithms to be considered are both randomized and deterministic.

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

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

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

[4]  T. N. Thiele.  XII. Adjustment by Elements , 1931 .

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

[6]  Sanguthevar Rajasekaran,et al.  A Framework for Simple Sorting Algorithms on Parallel Disk Systems (Extended Abstract) , 1998, SPAA.

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

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

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

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

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

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

[13]  Viktor K. Prasanna,et al.  An optimal sorting algorithm on reconfigurable mesh , 1992, Proceedings Sixth International Parallel Processing Symposium.

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

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

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

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

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

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

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

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

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

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

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

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

[26]  Sartaj Sahni,et al.  Determinisitic Routing on the Array with Reconfigurable Optical Buses , 1997, Parallel Process. Lett..

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

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