Order statistics on optically interconnected multiprocessor systems

Abstract Processor arrays with an optical bus are introduced for parallel computation in this paper. 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 with an electronic bus. The initial results are 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.

[1]  Rami G. Melhem,et al.  Pipelined Communications in Optically Interconnected Arrays , 1991, J. Parallel Distributed Comput..

[2]  J Shamir,et al.  High-efficiency rapidly programmable optical interconnections. , 1987, Applied optics.

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

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

[5]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[6]  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.

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

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

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

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

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

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

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

[14]  Stephan Olariu,et al.  Selection on rectangular meshes with multiple broadcasting , 1993, BIT Comput. Sci. Sect..

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

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

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

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

[19]  Kai Hwang,et al.  Computer architecture and parallel processing , 1984, McGraw-Hill Series in computer organization and architecture.

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

[21]  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..

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

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

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

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

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

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