Abstract
The bisection width of interconnection networks has always been important in parallel computing, since it bounds the amount of information that can be moved from one side of a network to another, i.e., the bisection bandwidth. The problem of finding the exact bisection width of the multidimensional torus was posed by Leighton and has remained open for 20 years. In this paper we provide the exact value of the bisection width of the torus, as well as of several d-dimensional classical parallel topologies that can be obtained by the application of the Cartesian product of graphs. To do so, we first provide two general results that allow to obtain upper and lower bounds on the bisection width of a product graph as a function of some properties of its factor graphs. We also apply these results to obtain bounds for the bisection bandwidth of a d-dimensional BCube network, a recently proposed topology for data centers.
This research was supported in part by the Comunidad de Madrid grant S2009TIC-1692, Spanish MICINN grant TEC2011-29688-C02-01, and National Natural Science Foundation of China grant 61020106002.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arjona Aroca, J., Fernández Anta, A.: Bisection (Band)Width of Product Networks with Application to Data Centers. ArXiv e-prints, CoRR abs/1202.6291 (February 2012)
Azizoğlu, M.C., Eğecioğlu, Ö.: The isoperimetric number and the bisection width of generalized cylinders. Electronic Notes in Discrete Mathematics 11, 53–62 (2002)
Azizoğlu, M.C., Eğecioğlu, Ö.: Extremal sets minimizing dimension-normalized boundary in hamming graphs. SIAM J. Discrete Math. 17(2), 219–236 (2003)
Azizoğlu, M.C., Eğecioğlu, Ö.: The bisection width and the isoperimetric number of arrays. Discrete Applied Mathematics 138(1-2), 3–12 (2004)
Dally, W., Towles, B.: Principles and Practices of Interconnection Networks. Morgan Kaufmann Publishers Inc., San Francisco (2003)
Dally, W.J.: Performance analysis of k-ary n-cube interconnection networks. IEEE Trans. Computers 39(6), 775–785 (1990)
Duato, J., Yalamanchili, S., Lionel, N.: Interconnection Networks: An Engineering Approach. Morgan Kaufmann Publishers Inc., San Francisco (2002)
Efe, K., Feng, G.L.: A proof for bisection width of grids. World Academy of Science, Engineering and Technology 27(31), 172–177 (2007)
Efe, K., Fernández, A.: Products of networks with logarithmic diameter and fixed degree. IEEE Trans. Parallel Distrib. Syst. 6(9), 963–975 (1995)
Efe, K., Fernández, A.: Mesh-connected trees: A bridge between grids and meshes of trees. IEEE Trans. Parallel Distrib. Syst. 7(12), 1281–1291 (1996)
Guo, C., Lu, G., Li, D., Wu, H., Zhang, X., Shi, Y., Tian, C., Zhang, Y., Lu, S.: Bcube: a high performance, server-centric network architecture for modular data centers. In: SIGCOMM, pp. 63–74. ACM (2009)
Guo, C., Wu, H., Tan, K., Shi, L., Zhang, Y., Lu, S.: Dcell: a scalable and fault-tolerant network structure for data centers. In: SIGCOMM, pp. 75–86. ACM (2008)
Jayasimha, D.N., Zafar, B., Hoskote, Y.: On chip interconnection networks why they are different and how to compare them. Intel (2006)
Leighton, F.T.: Introduction to parallel algorithms and architectures: array, trees, hypercubes. Morgan Kaufmann Publishers Inc., San Francisco (1992)
Mirza-Aghatabar, M., Koohi, S., Hessabi, S., Pedram, M.: An empirical investigation of mesh and torus noc topologies under different routing algorithms and traffic models. In: 10th Euromicro DSD, pp. 19–26. IEEE Computer Society, Washington, DC, USA (2007)
Nakano, K.: Linear layout of generalized hypercubes. Int. J. Found. Comput. Sci. 14(1), 137–156 (2003)
Pan, Y., Zheng, S.Q., Li, K., Shen, H.: An improved generalization of mesh-connected computers with multiple buses. IEEE Trans. Parallel Distrib. Syst. 12, 293–305 (2001)
Rolim, J.D.P., Sýkora, O., Vrto, I.: Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes. In: Nagl, M. (ed.) WG 1995. LNCS, vol. 1017, pp. 252–264. Springer, Heidelberg (1995)
Salminen, E., Kulmala, A., H, T.D.: Survey of network-on-chip proposals. Simulation, 1–13 (March 2008)
Youssef, A.: Cartesian product networks. In: ICPP, vol. (1), pp. 684–685 (1991)
Youssef, A.: Design and analysis of product networks. In: Frontiers 1995, pp. 521–528. IEEE Computer Society, Washington, DC, USA (1995)
Zydek, D., Selvaraj, H.: Fast and efficient processor allocation algorithm for torus-based chip multiprocessors. Comput. Electr. Eng. 37, 91–105 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arjona Aroca, J., Fernández Anta, A. (2012). Bisection (Band)Width of Product Networks with Application to Data Centers. In: Agrawal, M., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2012. Lecture Notes in Computer Science, vol 7287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29952-0_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-29952-0_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29951-3
Online ISBN: 978-3-642-29952-0
eBook Packages: Computer ScienceComputer Science (R0)