Sorting on a mesh-connected parallel computer
Communications of the ACM
Bitonic Sort on a Mesh-Connected Parallel Computer
IEEE Transactions on Computers
Generalized Connection Networks for Parallel Processor Intercommunication
IEEE Transactions on Computers
The cube-connected-cycles: A versatile network for parallel computation
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Pyramidal thinning algorithm for SIMD parallel machines
Pattern Recognition
| Hi-index | 14.98 |
This paper 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 our algorithm is 0(q22n) on a q-dimensional nq PE mesh-connected computer and 0(log2 N) on an N PE cube-connected or perfect shuffle computer. For tbe case of a RAW, the complexity of our algorithm is 0(q2n + dqn) on a q-dimensional MCC and 0(log2 N + d log N) on an N PE cube-connected or perfect sbuffle computer; d is the maximum number of data items written into anyone PE.