Publication 1995 Issue No. 2 - February Abstract - Prefix Computations on a Generalized Mesh-Connected Computer with Multiple Buses
Prefix Computations on a Generalized Mesh-Connected Computer with Multiple Buses
February 1995 (vol. 6 no. 2)
pp. 196-199
 ASCII Text x Kuo-Liang Chung, "Prefix Computations on a Generalized Mesh-Connected Computer with Multiple Buses," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 2, pp. 196-199, February, 1995.
 BibTex x @article{ 10.1109/71.342133,author = {Kuo-Liang Chung},title = {Prefix Computations on a Generalized Mesh-Connected Computer with Multiple Buses},journal ={IEEE Transactions on Parallel and Distributed Systems},volume = {6},number = {2},issn = {1045-9219},year = {1995},pages = {196-199},doi = {http://doi.ieeecomputersociety.org/10.1109/71.342133},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Parallel and Distributed SystemsTI - Prefix Computations on a Generalized Mesh-Connected Computer with Multiple BusesIS - 2SN - 1045-9219SP196EP199EPD - 196-199A1 - Kuo-Liang Chung, PY - 1995VL - 6JA - IEEE Transactions on Parallel and Distributed SystemsER -

Abstract—The mesh-connected computer with multiple buses (MCCMB) is a well-known parallel organization, providing broadcast facilities in each row and each column. In this paper, we propose a 2-D generalized MCCMB (2-GMCCMB) for the purpose of increasing the efficiency of executing some important applications of prefix computations such as solving linear recurrences and tridiagonal systems, etc. A $k_1n_1 \times k_1n_2$ 2-GMCCMB is constructed from a $k_1n_1\times k_1n_2$ mesh organization by enhancing the power of each disjoint $n_1\times n_2$ submesh with multiple buses (sub-2-MCCMB). Given $n$ data, a prefix computation can be performed in $O\left(n^\left\{1/10\right\}\right)$ time on an $n^\left\{3/5\right\}\times n^\left\{2/5\right\}$ 2-GMCCMB, where each disjoint sub-2-MCCMB is of size $n^\left\{1/2\right\}\times n^\left\{3/10\right\}$. This time bound is faster than the previous time bound of $O\left(n^\left\{1/8\right\}\right)$ for the same computation on an $n^\left\{5/8\right\}\times n^\left\{3/8\right\}$ 2-MCCMB. Furthermore, the time bound of our parallel prefix algorithm can be further reduced to $O\left(n^\left\{1/11\right\}\right)$ if fewer processors are used. Our result can be extended to the $d$-dimensional GMCCMB, giving a time bound of $O\left(n^\left\{1/\left(d2^d+d\right)\right\}\right)$ for any constant $d$; here, we omit the constant factors. This time bound is less than the previous time bound of $O\left(n^\left\{1/\left(d2^d\right)\right\}\right)$ on the $d$-dimensional MCCMB.

Index Terms—Broadcasting, mesh-connected computers, mesh-connected computers with multiple buses, parallel algorithms, prefix computation, rectangular meshes.

[1] A. Aggarwal,“Optimal bounds for finding maximum on array of processors with$k$global buses,”IEEE Trans. Comput., vol. C-35, no. 1, pp. 62–64, Jan. 1986.
[2] M.J. Atallah and S.R. Kosaraju, "Graph Problems on a Mesh Connected Processor Array," J. ACM, vol. 2, pp. 238-249, July 1985.
[3] A. Bar-Noy and D. Peleg,“Square meshes are not always optimal,”IEEE Trans. Comput., vol. C-40, no. 2, pp. 196–204, Feb. 1991.
[4] G. H. Barneset al.,“The Illiac IV computer,”IEEE Trans. Comput., vol. C-17, pp. 746–757, 1968.
[5] D. Bhagavathiet al.,“Selection on rectangular meshes with multiple broadcasting,”BIT, vol. 33, no. 1, pp. 7–14, 1993.
[6] G. E. Blelloch,“Scans as primitive operations,”IEEE Trans. Comput., vol. C-38, no. 11, pp. 1526–1538, Nov. 1989.
[7] ——,“Prefix sums and their applications,”inSynthesis of Parallel Algorithms, J. H. Reif, Ed. San Mateo, CA: Morgan Kaufmann, 1993, Chapter 1, pp. 35–60.
[8] S. H. Bokhari,“MAX: An algorithm for finding maximum in an array processor with a global bus,”IEEE Trans. Comput., vol. C-33, no. 2, pp. 133–139, Feb. 1984.
[9] D. A. Carlson,“Modified mesh-connected parallel computers,”IEEE Trans. Comput., vol. C-37, no. 10, pp. 1315–1321, Oct. 1988.
[10] ——,“Solving linear recurrence systems on mesh-connected computers with multiple global buses,”J. Parallel and Distribut. Comput., vol. 8, pp. 89–95, 1990.
[11] Y.C. Chen,W.T. Chen,G.-H. Chen,, and J.P. Sheu,“Designing efficient parallel algorithms on mesh connected computers with multiple broadcasting,” IEEE Trans. Parallel and Distributed Systems, vol. 1, 1990.
[12] Y.C. Chen, W.T. Chen, and G.-H. Chen, "Efficient Median Finding and Its Application to Two-Variable Linear Programming on Mesh-Connected Computers with Multiple Broadcasting," J. Parallel and Distributed Computing, vol. 15, pp. 79-84, 1992.
[13] K. L. Chung,“Fast selection algorithms on generalized mesh-connected computers with multiple buses,”unpublished manuscript.
[14] K. Hwang and F.A. Briggs,Computer Architecture and Parallel Processing.New York: McGraw Hill, 1984.
[15] P. M. Kogge and H. S. Stone,“A parallel algorithm for the efficient solution of a general class of recurrence equations,”IEEE Trans. Comput., vol. C-22, no. 8, pp. 786–793, Aug. 1973.
[16] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[18] R. Miller and Q. F. Stout,“Geometric algorithms for digitized pictures on a mesh-connected computer,”IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-7, pp. 216–228, Mar. 1985.
[19] ——,“Mesh computer algorithms for computational geometry,”IEEE Trans. Comput., vol. C-38, no. 3, pp. 321–340, Mar. 1989.
[20] D. Nassimi and S. Sahni,“Bitonic sort on a mesh-connected parallel computer,”IEEE Trans. Comput., vol. C-28, no. 1, pp. 2–7, Jan. 1979.
[21] ——,“Finding connected components and connected ones on a mesh-connected parallel computer,”SIAM J. Comput., vol. 9, pp. 744–757, Nov. 1980.
[22] ——,“Data broadcasting in SIMD computers,”IEEE Trans. Comput., vol. C-30, no. 2, pp. 101–107, Feb. 1981.
[23] D. Parkinson, D. J. Hunt and K. S. MacQueen,“The AMT DAP 500,”inProc. 33rd IEEE Comput. Conf., San Francisco, CA, 1988, pp. 196–199.
[24] V.K. Prasanna Kumar, and C.S. Raghavendra,“Array processor with multiple broadcasting,” J. of Parallel and Distributed Computing, vol. 4, pp. 173-190, 1987.
[25] I. N. Robinson and W. R. Moore,“A parallel processing array architecture and its implementation in silicon,”inProc. IEEE Custom Integrated Circuits Conf., (Rochester, NY), 1982.
[26] H.S. Stone, “An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations,” J. ACM, vol. 20, pp. 27, 1973.
[27] H. Stone, “Parallel Tridiagonal Equation Solvers,” ACM Trans. Math. Software, vol. 1, pp. 289-307, 1975.
[28] Q. F. Stout,“Mesh-connected computers with broadcasting,”IEEE Trans. Comput., vol. C-32, no. 9, pp. 826–830, Sept. 1983.
[29] ——,“Meshes with multiple buses,”inProc. 27th IEEE Symp. Foundations Comput. Sci., pp. 264–273, 1986.
[30] C. Thompson and H. Kung,“Sorting on a mesh connected parallel computer,”Commun. ACM, vol. 20, pp. 263–271, 1977.

Citation:
Kuo-Liang Chung, "Prefix Computations on a Generalized Mesh-Connected Computer with Multiple Buses," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 2, pp. 196-199, Feb. 1995, doi:10.1109/71.342133