
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Kemal Efe, Antonio Fernández, "MeshConnected Trees: A Bridge Between Grids and Meshes of Trees," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 12, pp. 12811291, December, 1996.  
BibTex  x  
@article{ 10.1109/71.553283, author = {Kemal Efe and Antonio Fernández}, title = {MeshConnected Trees: A Bridge Between Grids and Meshes of Trees}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {7}, number = {12}, issn = {10459219}, year = {1996}, pages = {12811291}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.553283}, 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  MeshConnected Trees: A Bridge Between Grids and Meshes of Trees IS  12 SN  10459219 SP1281 EP1291 EPD  12811291 A1  Kemal Efe, A1  Antonio Fernández, PY  1996 KW  Parallel architectures KW  interconnection networks KW  parallel algorithms KW  product networks KW  graph embedding KW  binary tree KW  grids KW  hypercubes KW  mesh of trees. VL  7 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—The grid and the mesh of trees (or MOT) are among the bestknown parallel architectures in the literature. Both of them enjoy efficient VLSI layouts, simplicity of topology, and a large number of parallel algorithms that can efficiently execute on them. One drawback of these architectures is that algorithms that perform best on one of them do not perform very well on the other. Thus there is a gap between the algorithmic capabilities of these two architectures.
We propose a new class of parallel architectures, called the
We also present an interesting variant of the MCT architecture that admits both the MOT and the torus as its subgraphs. While most of the discussion in this paper is focused on the MCT architecture itself, these analyses can be easily extended to the variant of the MCT presented here.
[1] M. Baumslag and F. Annexstein, "A Unified Framework for OffLine Permutation Routing in Parallel Networks," Math. Systems Theory, vol. 24, no. 4, pp. 233251, 1991.
[2] S.N. Bhatt, F.R.K. Chung, J.W. Hong, F.T. Leighton, B. Obrenic, A.L. Rosenberg, and E.J. Schwabe, “Optimal Emulations by ButterflyLike Networks,” J. ACM, vol. 43, pp. 293330, 1996.
[3] S.N. Bhatt and I.C.F. Ipsen, "How to Embed Trees in Hypercubes," Technical Report RR443, Department of Computer Science, Yale Univ., New Haven, Conn., 1985.
[4] K. Efe,“Embedding mesh of trees in the hypercube,” J. Parallel and Distributed Computing, vol. 11, no. 3, pp. 222230, Mar. 1991.
[5] K. Efe and A. Fernández, "Products of Networks with Logarithmic Diameter and Fixed Degree," IEEE Trans. Parallel and Distributed Systems, vol. 6, pp. 963975, Sept. 1995.
[6] K. Efe and A. Fernández, "Meshconnected Trees: A Bridge Between Grids and Meshes of Trees," Technical Report 9487, Center for Advanced Computer Studies, University of Southwestern Louisiana (also available from the first author).
[7] A. Fernández, "Homogeneous Product Networks for Processor Interconnection," PhD Thesis, Center for Advanced Computer Studies, Univ. of Southwestern Louisiana, Dec. 1994.
[8] A. Fernández, N.A. Eleser, and K. Efe, "Generalized Algorithm for Parallel Sorting on Product Networks," Proc. 1995 Int'l Conf. Parallel Processing, vol. III, pp. 155  159, Aug.1418 1995.
[9] T. ElGhazawi and A. Youssef, "A General Framework for Developing Adaptive FaultTolerant Routing Algorithms," IEEE Trans. Reliability, vol. 42, pp. 250258, June 1993.
[10] I. Havel and P. Liebl, "Embedding the Polytomic Tree into the Ncube," $\mathord{\buildrel{\lower3pt\hbox{$\scriptscriptstyle\smile$}}\over C} aspios\ pro \ P\mathord{\buildrel{\lower3pt\hbox{$\scriptscriptstyle\smile$}}\over e} stov{\buildrel\, '\over a}n\ i\ Matematiky$, vol. 98, pp. 307314, 1973.
[11] R. Heckmann, R. Klasing, B. Monien, and W. Unger, "Optimal Embeddings of Complete Binary trees into Lines and Grids," Proc. 17th Int'l Workshop, WG'91, GraphTheoretic Concepts in Computer Science, G. Schmidt and R. Berghammer, eds., vol. 570of Lecture Notes in Computer Science, pp. 2535.Fischbachau, Germany: Springer Verlag, June 1991.
[12] R.E. Ladner and M.J. Fischer, "Parallel Prefix Computation," J. ACM, vol. 27, no. 4, pp. 831838, Oct. 1980.
[13] F.T. Leighton, Complexity Issues in VLSI.Cambridge, Mass.: MIT Press, 1983.
[14] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[15] C.E. Leiserson, "AreaEfficient graph Layout (for VLSI)," Proc. 21st Annual Symp. Foundations of Computer Science, pp. 270281, Oct. 1980.
[16] FaultTolerant Computing: Theory and Techniques, D.K. Pradhan ed., vol. 2, c. 7. Englewood Cliffs, N.J.: Prentice Hall, 1986.
[17] A.L. Rosenberg,“Productshuffle networks: Toward reconciling shuffles and butterflies,” Discrete Applied Mathematics, vol. 37/38, pp. 465488, July 1992.
[18] C.D. Thompson,“A complexity theory for VLSI,” PhD thesis, CarnegieMellon Univ., Aug. 1980.
[19] J.D. Ullman, Computational Aspects of VLSI.Rockville, Md.: Computer Science Press, 1984.
[20] A. Youssef, "Product Networks: A Unified Theory of Fixed Interconnection Networks," Technical Report GWUIIST9038, Inst. Information Science and Technology, Dept. Electrical Engineering and Computer Science, School of Eng. and Applied Science, George Washington Univ., Washington, D.C. 20052, Dec. 1990.