A doubly logarithmic communication algorithm for the completely connected optical communication parallel computer

In this lem of interprocessor A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer Leslie Ann Goldberg, Sandia National Labs 1 Mark Jerrum, University of Edinburgh 2

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

[2]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

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

[4]  Colin McDiarmid,et al.  Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .

[5]  David E. Muller,et al.  Bounds to Complexities of Networks for Sorting and for Switching , 1975, JACM.

[6]  W. F. McColl,et al.  General purpose parallel computing , 1993 .

[7]  Leslie G. Valiant,et al.  Direct Bulk-Synchronous Parallel Algorithms , 1992, J. Parallel Distributed Comput..

[8]  Uzi Vishkin,et al.  Converting high probability into nearly-constant time—with applications to parallel hashing , 1991, STOC '91.

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