Minimizing Message Complexity of Partially Replicated Data on
                         Hypercubes



      Keith Humenik, Peter Matthews, A.B. Stephens, Yelena Yesha




     Within the framework of distribued and parallel computing, we consider
partially replicated data on a hypercube. We address the problem of placing
copies on the hypercube in order to minimize message complexity. With 
realistic restrictions on read/write ratio and the number of copies, we find
the unique optimal configuration of copies. We compute the communication
cost of the configuration. The optimal configuration is a linear array
satisfying certain properties.