
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Debasish Das, Mallika De, Bhabani P. Sinha, "A New Network Topology with Multiple Meshes," IEEE Transactions on Computers, vol. 48, no. 5, pp. 536551, May, 1999.  
BibTex  x  
@article{ 10.1109/12.769436, author = {Debasish Das and Mallika De and Bhabani P. Sinha}, title = {A New Network Topology with Multiple Meshes}, journal ={IEEE Transactions on Computers}, volume = {48}, number = {5}, issn = {00189340}, year = {1999}, pages = {536551}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.769436}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A New Network Topology with Multiple Meshes IS  5 SN  00189340 SP536 EP551 EPD  536551 A1  Debasish Das, A1  Mallika De, A1  Bhabani P. Sinha, PY  1999 KW  Mesh KW  multimesh KW  diameter KW  Hamiltonian cycle KW  pointtopoint communication KW  onetoall broadcast KW  multicast KW  faultdiameter KW  Lagrange's interpolation KW  matrix transpose KW  matrix multiplication KW  DFT. VL  48 JA  IEEE Transactions on Computers ER   
Abstract—This paper introduces a new network topology, called MultiMesh (MM), which uses multiple meshes as the basic building blocks interconnected in a suitable manner. The proposed network consists of
[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. 238249, July 1985.
[3] S.H. Bokhari, “Finding Maximum on an Array Processor with a Global Bus,” IEEE Trans. Computers, vol. 33, no. 2, pp. 133139, Feb. 1984.
[4] M. De, “Design of Efficient Parallel Algorithms and Architectures for Some Numeric and NonNumeric Problems,” PhD thesis, J.U., Calcutta, 1997.
[5] M. De, B. Kundu, and B.P. Sinha, “Wormhole Routing for Complete Exchange in MultiMesh,” Proc. Fourth Int'l Conf. HighPerformance Computing, pp. 432437, Bangalore, India, 1821 Dec. 1997.
[6] M. De, D. Das, M. Ghosh, and B.P. Sinha, “An Efficient Sorting Algorithm on the MultiMesh Network,” IEEE Trans. Computers, vol. 46, no. 10, pp. 1,1321,137, Oct. 1997.
[7] M. De, D. Das, M. Ghosh, and B.P. Sinha, “Efficient Sorting on the MultiMesh Topology,” Proc. Second Int'l Conf. HighPerformance Computing, pp. 707712, New Delhi, India, 230 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. 112115, 1978.
[10] F.B. Hildebrand, Introduction to Numerical Analysis. New York: McGrawHill, 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. 3860, 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. 569581, June 1983.
[14] V.K. PrasannaKumar and M. Eshaghian, “Parallel Geometric Algorithms for Digitized Pictures on Mesh of Tree Organization,” Proc. Int'l Conf. Parallel Processing, pp. 270273, Aug. 1986.
[15] V.K. PrasannaKumar and D. Reisis, “Parallel Image Processing on Enhanced Arrays,” Proc. Int'l Conf. Parallel Processing, pp. 909912, Aug. 1987.
[16] C. Savage, J. Jájá, “Fast Efficient Parallel Algorithms for Some Graph Problems,” SIAM J. Computing, vol. 10, pp. 682691, 1981.
[17] Q.F. Stout, “Mesh Connected Computers with Broadcasting,” IEEE Trans. Computers, vol. 32, pp. 826830, 1983.
[18] C. Thompson and H. Kung,“Sorting on a mesh connected parallel computer,”Commun. ACM, vol. 20, pp. 263–271, 1977.