
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Y.C. Chen, W.T. Chen, G.H. Chen, J.P. Sheu, "Designing Efficient Parallel Algorithms on MechConnected Computers with Multiple Broadcasting," IEEE Transactions on Parallel and Distributed Systems, vol. 1, no. 2, pp. 241246, April, 1990.  
BibTex  x  
@article{ 10.1109/71.80135, author = {Y.C. Chen and W.T. Chen and G.H. Chen and J.P. Sheu}, title = {Designing Efficient Parallel Algorithms on MechConnected Computers with Multiple Broadcasting}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {1}, number = {2}, issn = {10459219}, year = {1990}, pages = {241246}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.80135}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Designing Efficient Parallel Algorithms on MechConnected Computers with Multiple Broadcasting IS  2 SN  10459219 SP241 EP246 EPD  241246 A1  Y.C. Chen, A1  W.T. Chen, A1  G.H. Chen, A1  J.P. Sheu, PY  1990 KW  Index Termsparallel algorithms; mechconnected computers; multiple broadcasting; prefix computations; multiple broadcasting; 2MCCMBs; semigroup computations; time complexity; prefix computations; computational complexity; multiprocessorinterconnection networks; parallel algorithms; parallel architectures VL  1 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Semigroup and prefix computations on twodimensional meshconnected computers with multiple broadcasting (2MCCMBs) are studied. Previously, only square 2MCCMBs 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 2MCCMB. 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.
[1] A. Aggarwal, "Optimal bounds for finding maximum on array of processors withkglobal buses,"IEEE Trans. Comput., vol. C35, pp. 6264, Jan. 1986.
[2] M. Atallah and R. Kosaraju, "Graph problems on a mesh connected processor array,"J. Assoc. Comp. Mach., vol. 31, pp. 649667, 1983.
[3] S. H. Bokhari, "MAX: An algorithm for finding maximum in an array processor with a global bus," inProc. Int. Conf. Parallel Processing, Aug. 1981, pp. 302303.
[4] S. H. Bokhari, "Finding maximum on an array processor with a global bus,"IEEE Trans. Comput., vol. C33, pp. 133139, Feb. 1984.
[5] P. R. Cappello, "A mesh automaton for solving dense linear systems," inProc. Int. Conf. Parallel Processing, Aug. 1985, pp. 418425.
[6] D. A. Carlson, "Performing tree and prefix computations on modified meshconnected parallel computers," inProc. Int. Conf. Parallel Processing, Aug. 1985, pp. 715718.
[7] Y. C. Chen and G. H. Chen, "Parallel algorithms on meshconnected computers with multiple broadcasting," unpublished manuscript.
[8] Y. C. Chen, W. T. Chen, G. H. Chen, and J. P. Sheu, "Reducing time complexties of semigroup computations on meshconnected computers with multiple broadcasting," inProc. Int. Conf. Parallel Processing, Vol. III, Aug. 1989, pp. 234241.
[9] Y. C. Chen, W. T. Chen, and G. H. Chen, "Finding median and median row on meshconnected computers with multiple broadcasting," to be published.
[10] T. Y. Feng, "A survey of interconnection networks,"IEEE Comput. Mag., pp. 1227, Dec. 1981.
[11] K. Hwang and F. A. Briggs,Computer Architecture and Parallel Processing. New York: McGrawHill, 1984.
[12] V. K. Prasanna Kumar and C. S. Raghavendra, "Array processor with multiple broadcasting,"J. Parallel Distributed Comput., vol. 4, pp. 173190, 1987.
[13] S. P. Levitan, "Algorithms for a broadcast protocol multiprocessor," inProc. 3rd Int. Conf. Distribut. Comput. Syst., 1982, pp. 666 671.
[14] R. Miller and Q. F. Stout, "Geometric algorithms for digitized pictures on a meshconnected computer,"IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI7, Mar. 1985.
[15] R. Miller and Q. F. Stout, "Varying diameter and problem size in meshconnected computers," inProc. Int. Conf. Parallel Processing, Aug. 1985, pp. 697699.
[16] D. Nassimi and S. Sahni, "Data broadcasting in SIMD computers,"IEEE Trans. Comput., vol. C30, p. 101107, Feb. 1981.
[17] Q. F. Stout, "Broadcasting in meshconnected computers," inProc. 1982 Conf. Info. Sci. Syst., Princeton Univ., Princeton, NJ, 1982, pp. 8590.
[18] Q. F. Stout, "Meshconnected computers with broadcasting,"IEEE Trans. Comput., vol. C32, pp. 826830, Sept. 1983.
[19] Q. F. Stout, "Meshes with multiple buses," inProc. 27th IEEE Symp. Found. Comput. Sci., 1986, pp. 264273.
[20] C. D. Thompson and H. T. Kung, "Sorting on a mesh connected processor array,"Commun. ACM, pp. 263271, 1972.
[21] L. D. Wittie, "Communication structures for large networks of microcomputers,"IEEE Trans. Comput., vol. C30, no. 4, pp. 264 273, Apr. 1981.