Arjona Aroca, Jordi and Fernández Anta, Antonio (2012) Bisection (Band)Width of Product Networks with Application to Data Centers. In: The 9th Annual Conference on Theory and Applications of Models of Computation (TAMC 2012), The Turing Year 2012 in China, May 16-21, 2012, Beijing, China.
Download (318Kb) | Preview
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.
|Item Type:||Conference or Workshop Papers (Paper)|
|Uncontrolled Keywords:||Bisection bandwidth, bisection width, torus, BCube, product graphs, complete binary trees, extended trees, mesh-connected trees.|
|Subjects:||Q Science > Q Science (General)
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
T Technology > T Technology (General)
T Technology > TA Engineering (General). Civil engineering (General)
T Technology > TK Electrical engineering. Electronics Nuclear engineering
|Divisions:||Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science|
|Depositing User:||Jordi Arjona|
|Date Deposited:||05 Jul 2012 11:10|
|Last Modified:||15 Dec 2016 12:06|
Actions (login required)