|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing
Simulation of Infiniband Networks and Effciency Calculation on Non-blocking Fully Populated Fat-Tree Topology
Barcelona, Catalonia Spain
October 26-October 28
ISBN: 978-0-7695-4531-8
| ASCII Text | x | ||
| Gitanjali Sachdeva, Abhishek Patel, Henry Kasim, Simon See, "Simulation of Infiniband Networks and Effciency Calculation on Non-blocking Fully Populated Fat-Tree Topology," P2P, Parallel, Grid, Cloud, and Internet Computing, International Conference on, pp. 163-168, 2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, 2011. | |||
| BibTex | x | ||
| @article{ 10.1109/3PGCIC.2011.33, author = {Gitanjali Sachdeva and Abhishek Patel and Henry Kasim and Simon See}, title = {Simulation of Infiniband Networks and Effciency Calculation on Non-blocking Fully Populated Fat-Tree Topology}, journal ={P2P, Parallel, Grid, Cloud, and Internet Computing, International Conference on}, volume = {0}, year = {2011}, isbn = {978-0-7695-4531-8}, pages = {163-168}, doi = {http://doi.ieeecomputersociety.org/10.1109/3PGCIC.2011.33}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - P2P, Parallel, Grid, Cloud, and Internet Computing, International Conference on TI - Simulation of Infiniband Networks and Effciency Calculation on Non-blocking Fully Populated Fat-Tree Topology SN - 978-0-7695-4531-8 SP163 EP168 A1 - Gitanjali Sachdeva, A1 - Abhishek Patel, A1 - Henry Kasim, A1 - Simon See, PY - 2011 KW - Infiniband Architecture (IBA) KW - Fully Populated Fat-Tree (FFT) KW - Infiniband Network KW - Non-blocking Fat-Tree VL - 0 JA - P2P, Parallel, Grid, Cloud, and Internet Computing, International Conference on ER - | |||
In this paper, we have proposed efficient algorithms for simulating Infiniband networks using a non-blocking fully populated Fat-Tree topology. These algorithms successfully model Fat-Tree Infiniband networks and introduce an efficient routing scheme for multi-source multi-destination routing. Our aim is to use maximum/minimum portion of the topology for each instance of routing and calculate efficiency of network used. Initially we find all possible routes for each source-destination pair. Then, one path is selected per pair such that the constraint of minimum/maximum network usage is satisfied. After final paths have been obtained for all pairs, the network efficiency is calculated. We have considered only latency of links assuming that switches in the network do not have any latency. Hence, this paper includes our algorithms for modelling, routing and performance evaluation of Infiniband networks for a Fat-Tree topology.
Index Terms:
Infiniband Architecture (IBA), Fully Populated Fat-Tree (FFT), Infiniband Network, Non-blocking Fat-Tree
Citation:
Gitanjali Sachdeva, Abhishek Patel, Henry Kasim, Simon See, "Simulation of Infiniband Networks and Effciency Calculation on Non-blocking Fully Populated Fat-Tree Topology," 3pgcic, pp.163-168, 2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, 2011
Usage of this product signifies your acceptance of the Terms of Use.