2016 · 55 citations · 24 references
ComputingComputer ScienceComputer SystemsComputer NetworksInterconnection NetworksParallel ComputingAdaptive RoutingCommunication NetworksJob SchedulingLoad BalancingNetwork Performance AnalysisRoutingAdaptive Load BalancingAdaptive Routing In Butterfly NetworksDragonfly NetworksDynamic Load BalancingNetwork SimulationNetwork Traffic ModelingPerformance DegradationPerformance Degradation Detection
High-radix, low-diameter dragonfly networks will be a common choice in next-generation supercomputers. Preliminary studies show that random job placement with adaptive routing should be the rule of thumb to utilize such networks, since it uniformly distributes traffic and alleviates congestion. Nevertheless, in this work we find that while random job placement coupled with adaptive routing is good at load balancing network traffic, it cannot guarantee the best performance for every job. The performance improvement of communication-intensive applications comes at the expense of performance degradation of less intensive ones. We identify this bully behavior and validate its underlying causes with the help of detailed network simulation and real application traces. We further investigate a hybrid contiguous-noncontiguous job placement policy as an alternative. Initial experimentation shows that hybrid job placement aids in reducing the worst-case performance degradation for less communication-intensive applications while retaining the performance of communication-intensive ones.
24
A detailed and flexible cycle-accurate Network-on-Chip simulator
Nan Jiang, James Balfour, Daniel Becker et al. · 2013 · 771 citations
Technology-Driven, Highly-Scalable Dragonfly Topology
John Kim, W.J. Dally, Steve Scott et al. · 2008 · 488 citations