BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-86-1129
       ENTRY:: May 01, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Beta Operations: Efficient Implementation of a Primitive
               Parallel Operation
        TYPE:: Technical Report
      AUTHOR:: Cohn, Evan R.
      AUTHOR:: Haddad, Ramsey W.
        DATE:: August 1986
       PAGES:: 20
    ABSTRACT:: We will consider the primitive parallel operation of the
               Connection Machine, the Beta Operation. Let the imput size of
               the problem be N and output size M. We will show how to
               perforrn the Beta Operation on an N-node hypercube in O(log N
               + $log^2$ M) time. For a $\sqrt{N} x \sqrt{M}$ mesh-of-trees,
               we require O(log N + $\sqrt{M}$) time.
       NOTES:: [Adminitrivia V1/Prg/19950501]
         END:: STAN//CS-TR-86-1129