The Community for Technology Leaders
Green Image
<p>Semigroup and prefix computations on two-dimensional mesh-connected computers with multiple broadcasting (2-MCCMBs) are studied. Previously, only square 2-MCCMBs with N processing elements were considered for semigroup computations of N data items, andO(N/sup 1/6/) time was required. It is found that square machines are not the best form for semigroup computations, and an O(N/sup 1/8/)-time algorithm is derived on an N/sup 5/8/*N/sup 3/8/ rectangular 2-MCCMB. This time complexity can be further reduced toO(N/sup 1/9/) if fewer processing elements are used. Parallel algorithms for prefix computations with the same time complexities are derived.</p>
Index Termsparallel algorithms; mech-connected computers; multiple broadcasting; prefix computations; multiple broadcasting; 2-MCCMBs; semigroup computations; time complexity; prefix computations; computational complexity; multiprocessorinterconnection networks; parallel algorithms; parallel architectures
J.P. Sheu, G.H. Chen, W.T. Chen, Y.C. Chen, "Designing Efficient Parallel Algorithms on Mech-Connected Computers with Multiple Broadcasting", IEEE Transactions on Parallel & Distributed Systems, vol. 1, no. , pp. 241-246, April 1990, doi:10.1109/71.80135
215 ms
(Ver 3.3 (11022016))