This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Network Topology with Multiple Meshes
May 1999 (vol. 48 no. 5)
pp. 536-551

Abstract—This paper introduces a new network topology, called Multi-Mesh (MM), which uses multiple meshes as the basic building blocks interconnected in a suitable manner. The proposed network consists of $n^4$ processors and is 4-regular with a diameter of $2n$. The network also contains a Hamiltonian cycle. Simple routing algorithms for point-to-point communication, one-to-all broadcast, and multicast have been described for this network. It is shown that a simple $n^2\times n^2$ mesh can also be emulated on this network in O(1) time. Several application examples have been discussed for which this network is found to be more efficient with regard to computational time than the corresponding mesh with the same number of processors. As examples, O$(n)$ time algorithms for finding the sum, average, minimum, and maximum of $n^4$ data values, located at $n^4$ different processors have been discussed. Time-efficient implementations of algorithms for solving nontrivial problems, e.g., Lagrange's interpolation, matrix transposition, matrix multiplication, and Discrete Fourier Transform (DFT) computation have also been discussed. The time complexity of Lagrange's interpolation on this network is O$(n)$ for $n^2$ data points compared to O($n^2$) time on mesh of the same size. Matrix transpose requires O$(n^{0.5}$) time for an $n \times n$ matrix. The time for multiplying two $n\times n$ matrices is O$(n^{0.6})$ with an AT-cost of O$(n^3)$. DFT of $n$ sample points can be computed in O$(n^{0.6})$ time on this network. Papers [6], [7] show that $n^4$ data elements can be sorted on this network in $O(n)$ time.

[1] S.G. Akl, The Design and Analysis of Parallel Algorithms. Orlando, Fl.: Academic Press, 1989.
[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] S.H. Bokhari, “Finding Maximum on an Array Processor with a Global Bus,” IEEE Trans. Computers, vol. 33, no. 2, pp. 133-139, Feb. 1984.
[4] M. De, “Design of Efficient Parallel Algorithms and Architectures for Some Numeric and Non-Numeric Problems,” PhD thesis, J.U., Calcutta, 1997.
[5] M. De, B. Kundu, and B.P. Sinha, “Wormhole Routing for Complete Exchange in Multi-Mesh,” Proc. Fourth Int'l Conf. High-Performance Computing, pp. 432-437, Bangalore, India, 18-21 Dec. 1997.
[6] M. De, D. Das, M. Ghosh, and B.P. Sinha, “An Efficient Sorting Algorithm on the Multi-Mesh Network,” IEEE Trans. Computers, vol. 46, no. 10, pp. 1,132-1,137, Oct. 1997.
[7] M. De, D. Das, M. Ghosh, and B.P. Sinha, “Efficient Sorting on the Multi-Mesh Topology,” Proc. Second Int'l Conf. High-Performance Computing, pp. 707-712, New Delhi, India, 2-30 Dec. 1995.
[8] C.R. Dyer, “A VLSI Pyramid Machine for Hierarchical Parallel Image,” Proc. IEEE Conf. Pattern Recognition and Image Processing, 1981.
[9] W.M. Gentleman, “Some Complexity Results for Matrix Computations on Parallel Processors,” J. ACM, vol. 25, pp. 112-115, 1978.
[10] F.B. Hildebrand, Introduction to Numerical Analysis. New York: McGraw-Hill, 1956.
[11] K. Hwang and F.A. Briggs,Computer Architecture and Parallel Processing.New York: McGraw Hill, 1984.
[12] R. Miller and Q.F. Stout, “Data Movement Techniques for the Pyramid Computer,” SIAM J. Computing, vol. 16, no. 1, pp. 38-60, Feb. 1987.
[13] D. Nath, S.N. Maheshwari, and P.C.P. Bhatt, “Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees,” IEEE Trans. Computers, vol. 32, no. 6, pp. 569-581, June 1983.
[14] V.K. Prasanna-Kumar and M. Eshaghian, “Parallel Geometric Algorithms for Digitized Pictures on Mesh of Tree Organization,” Proc. Int'l Conf. Parallel Processing, pp. 270-273, Aug. 1986.
[15] V.K. Prasanna-Kumar and D. Reisis, “Parallel Image Processing on Enhanced Arrays,” Proc. Int'l Conf. Parallel Processing, pp. 909-912, Aug. 1987.
[16] C. Savage, J. Jájá, “Fast Efficient Parallel Algorithms for Some Graph Problems,” SIAM J. Computing, vol. 10, pp. 682-691, 1981.
[17] Q.F. Stout, “Mesh Connected Computers with Broadcasting,” IEEE Trans. Computers, vol. 32, pp. 826-830, 1983.
[18] C. Thompson and H. Kung,“Sorting on a mesh connected parallel computer,”Commun. ACM, vol. 20, pp. 263–271, 1977.

Index Terms:
Mesh, multimesh, diameter, Hamiltonian cycle, point-to-point communication, one-to-all broadcast, multicast, fault-diameter, Lagrange's interpolation, matrix transpose, matrix multiplication, DFT.
Citation:
Debasish Das, Mallika De, Bhabani P. Sinha, "A New Network Topology with Multiple Meshes," IEEE Transactions on Computers, vol. 48, no. 5, pp. 536-551, May 1999, doi:10.1109/12.769436
Usage of this product signifies your acceptance of the Terms of Use.