The week's pick
Random Articles
Reseach Article
Performance Analysis of Overcoming Far-end Congestion in Large-Scale Networks
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 171 - Number 10 |
| Year of Publication: 2017 |
| Authors: Zaheeruddin, Sanjeev Gupta |
10.5120/ijca2017915215
|
Zaheeruddin, Sanjeev Gupta . Performance Analysis of Overcoming Far-end Congestion in Large-Scale Networks. International Journal of Computer Applications. 171, 10 ( Aug 2017), 40-43. DOI=10.5120/ijca2017915215
Abstract
Interconnection networks modify fast data communication between components of a digital system. Today, interconnections networks are utilized during a vary of applications like switch and router materials, processor-memory interconnect, I/O interconnects, and on-chip networks, to call a couple of. The design of an interconnection network has three aspects—the topology, the routing rule used, and additionally the flow management mechanism used. Though, earlier work doesn’t significance the impact of far-end congestion or the congestion beginning the high channel latency between the routers. Due to the long inter-router latency, the in-flight packets (and credits) result in inaccurate congestion data and might cause inaccurate adaptive routing selections. We tend to propose a history window based approach to remove the impact of phantom congestion. We’ve a trend to mutually show but using the standard of native queue occupancies and adding together an offset extensively eradicate the impact of transient congestion.
References
- Jongmin Won, Gwangsun Kim, John Kim, S. K., anTed Jiang, Mike Parker, Steve Scott. “Overcoming Far-end Congestion in Large-Scale Networks” IEEE 2015
- Camarero, Cristóbal, Enrique Vallejo, and Ramón Beivide. “Topological characterization of hamming and dragonfly networks and its implications on routing” ACM Trans. on Arch. and Code Optimization (TACO) 11, no. 4 (2015): 39.
- F. Pablo, E. Vallejo, C. Camarero, R. Beivide, and M. Valero. “Throughput unfairness in dragonfly networks under realistic traffic patterns” In Cluster Computing (CLUSTER), 2015 IEEE Inte. Conf. on, pp. 801-808. IEEE, 2015.
- G. Marina, E. Vallejo, R. Beivide, M. Odriozola, and M. Valero. “Efficient routing mechanisms for dragonfly networks” In Inter. Conf. on Parallel Processing (ICPP), 2013 42nd on, pp. 582-592. IEEE, 2013.
- Dorier, Matthieu, Misbah Mubarak, Rob Ross, Jianping Kelvin Li, Christopher D. Carothers, and Kwa-Liu Ma. “Evaluation of Topology-Aware Broadcast Algorithms for Dragonfly Networks” In Cluster Computing (CLUSTER), 2016 IEEE Inter. Conf. on, pp. 40-49. IEEE, 2016.
- Prisacari, Bogdan, German Rodriguez, Cyriel Minkenberg, Marina Garcia, Enrique Vallejo, and Ramon Beivide. “Performance optimization of load imbalanced workloads in large scale Dragonfly systems” In High Performance Switching and Routing (HPSR), 2015 IEEE 16th Inter. Conf. on, pp. 1-6. IEEE, 2015.
- Xiang, Dong, and Xiaowei Liu. “Deadlock-free broadcast routing in dragonfly networks without virtual channels” IEEE Trans. on Parallel and Distributed Syst. 27, no. 9 (2016): 2520-2532.
- Hastings, Emily, David Rincon-Cruz, Marc Spehlmann, Sofia Meyers, Anda Xu, David P. Bunde, and Vitus J. Leung. “Comparing global link arrangements for Dragonfly networks” In Cluster Computing (CLUSTER), 2015 IEEE Inter. Conf. on, pp. 361-370. IEEE, 2015.
- Faanes, Greg, Abdulla Bataineh, Duncan Roweth, Edwin Froese, Bob Alverson, Tim Johnson, Joe Kopnick, Mike Higgins, and James Reinhard. “Cray cascade: a scalable HPC system based on a Dragonfly network” p. 103. IEEE Computer Society Press, 2012.
- Bhatele, Abhinav, Nikhil Jain, Yarden Livnat, Valerio Pascucci, and Peer-Timo Bremer. “Analyzing network health and congestion in dragonfly-based supercomputers” IEEE International, pp. 93-102. IEEE, 2016.
- B. Arimilli, Ravi Arimilli, Vicente Chung Scott Clark, Wolfgang Denzel, Ben Drerup , Torsten Hoef “The percs high-performance interconnect” in High Performance Interconnects (HOTI), 2010 IEEE 18th Annual Symposium on, Mountain View, CA, August 2010, pp. 75–82.
- S. Scott et al., “The black widow high-radix clos network” in Proceedings of ISCA’06, Boston, MA, June 2006, pp. 16–28.
- P. Gratz et al., “Regional congestion awareness for load balance in networks-on-chip” in Proceedings of HPCA’08, Salt Lake City, UT, Feb 2008, pp. 203–214.
- N. Jiang et al., “Indirect adaptive routing on large scale interconnection networks” in Proceedings of ISCA’09, Austin, TX, June 2009, pp. 220– 231.
- W. Dally, “Virtual-channel flow control” Parallel and Distributed Systems, IEEE Trans. on, vol. 3, no. 2, pp. 194–205, 1992
- D. Helbing, “Traffic and related self-driven many-particle systems” Rev. Mod. Phys., vol. 73, pp. 1067–1141, Dec 2001.
- J. Bell et al., “Boxlib users guide” 2013, Center for Computational Sciences and Engineering, Lawrence Berkeley National Laboratory.
- H. Dong et al., “Quasi diffusion accelerated monte carlo” 2011, Los Alamos National Laboratory.
- D. F. Richards et al., “Beyond homogeneous decomposition: Scaling long-range forces on massively parallel systems” in Proceedings of SC’09, Portland, Oregon, November 2009, Article 60.
- P. F. Fischer et al., 2008, http://nek5000.mcs.anl.gov. H. Adalsteinsson et al., “A simulator for large-scale parallel computer architectures” Int. J. Distrib. Syst. Technol., vol. 1, no. 2, pp. 57–73, Apr. 2010.
Index Terms
Keywords