Order statistics on optically interconnected multiprocessor systems

Processor arrays with an optical bus are introduced as a new computational model. We use the order statistics problem as an example to demonstrate how to design efficient parallel algorithms on such systems. Besides proposing a new algorithm on the model, some basic data movement operations involved in the algorithm are discussed. We believe that these operations can be used to design other parallel algorithms on the same model. Time analysis indicates that order statistics can be done more efficiently on a linear array with a pipelined optical bus than that with an electronic bus. The initial result is promising, and the author believes that optical buses may emerge as a powerful communication mechanism for connecting large parallel computer systems in the near future.<<ETX>>

[1]  Stephan Olariu,et al.  A Simple Selection Algorithm for Reconfigurable Meshes , 1993, Parallel Algorithms Appl..

[2]  Richard Cole,et al.  Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms , 1986, STOC '86.

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

[4]  Harry F. Jordan,et al.  Serial array shuffle-exchange architecture for universal permutation of time-slots , 1990, Photonics West - Lasers and Applications in Science and Engineering.

[5]  Mohammad A. Karim,et al.  Programmable optical perfect shuffle interconnection network using fredkin gates , 1992 .

[6]  Patrick W. Dowd.  Wavelength Division Multiple Access Channel Hypercube Processor Interconnection , 1992, IEEE Trans. Computers.

[7]  Selim G. Akl.  An Optimal Algorithm for Parallel Selection , 1984, Inf. Process. Lett..

[8]  Rami Melhem,et al.  Array processors with pipelined optical busses , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.

[9]  Quentin F. Stout,et al.  Mesh-Connected Computers with Broadcasting , 1983, IEEE Transactions on Computers.

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

[11]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

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

[13]  Stephan Olariu,et al.  A Fast Selection Algorithm for Meshes with Multiple Broadcasting , 1994, IEEE Trans. Parallel Distributed Syst..

[14]  Yi Pan.  The block shift network: interconnection strategies for large parallel systems , 1992 .

[15]  Ahmed Louri,et al.  Three-dimensional optical architecture and data-parallel algorithms for massively parallel computing , 1991, IEEE Micro.

[16]  Alok Aggarwal.  A Comparative Study of X-Tree, Pyramid and Related Machines , 1984, FOCS.

[17]  Rami G. Melhem,et al.  Time-Division Optical Communications in Multiprocessor Arrays , 1993, IEEE Trans. Computers.

[18]  Toshimitsu Masuzawa,et al.  A sub-logarithmic time sorting algorithm on a reconfigurable array , 1991 .

[19]  Wen-Tsuen Chen,et al.  Efficient Medain Finding and Its Application to Two-Variable Linear Programming on Mesh-Connected Computers with Multiple Broadcasting , 1992, J. Parallel Distributed Comput..

[20]  S. L. Tanimoto,et al.  Sorting, Histogramming, and Other Statistical Operations on a Pyramid Machine , 1984 .

[21]  Rami G. Melhem,et al.  Using Coincident Optical Pulses for Parallel Memory Addressing , 1987, Computer.

[22]  D M Chiarulli,et al.  Coincident pulse techniques for multiprocessor interconnection structures. , 1990, Applied optics.

[23]  Zicheng Guo.  Sorting on Array Processors with Pipelined Buses , 1992, ICPP.