Data broadcasting in SIMD computers

Considers the data broadcasting problem for single instruction stream, multiple data stream (SIMD) computers. Two versions of this problem, i.e., random access read (RAR) and random access write (RAW) are considered. Efficient data broadcasting algorithms are developed for both cases. For the case of a RAR, the complexity of the algorithm is O(q²n) on a q-dimensional n^q PE mesh-connected computer and 0(log²N) on an N PE cube-connected or perfect shuffle computer. For the case of a RAW, the complexity of the algorithm is 0(q²n+dqn) on a q-dimensional MCC and 0(log²N+d log N) on an N PE cube-connected or perfect shuffle computer; d is the maximum number of data items written into any one PE.