This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Feb. 1981 (vol. 30 no. 2)
pp. 101-107
David Nassimi, Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL 60201
Sartaj Sahni, Department of Computer Science, University of Minnesota, Minneapolis, MN 55455
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(q2 n) on a q-dimensional nq PE mesh-connected computer and 0(log2 N) on an N PE cube-connected or perfect shuffle computer. For the case of a RAW, the complexity of our algorithm is 0(q2 n + dqn) on a g-dimensional MCC and 0(log2 N + d log N) on an TV PE cube-connected or perfect shuffle computer; d is the maximum number of data items written into any one PE.
Index Terms:
SIMD computer,Cube-connected computer,complexity,data broadcasting,mesh-connected computer,parallel algorithm,perfect shuffle computer
Citation:
David Nassimi, Sartaj Sahni, "Data broadcasting in SIMD computers," IEEE Transactions on Computers, vol. 30, no. 2, pp. 101-107, Feb. 1981, doi:10.1109/TC.1981.6312172
Usage of this product signifies your acceptance of the Terms of Use.