Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
The network architecture of the Connection Machine CM-5 (extended abstract)
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Effective Strategy to Compute Forwarding Tables for InfiniBand Networks
ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
DiP: A Parallel Program Development Environment
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Improving Routing Performance in Myrinet Networks
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
Scalable Hardware-Based Multicast Trees
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Level-wise scheduling algorithm for fat tree interconnection networks
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Randomized routing on fat-tress
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Application Specific Routing Algorithms for Networks on Chip
IEEE Transactions on Parallel and Distributed Systems
Trace-driven co-simulation of high-performance computing systems using OMNeT++
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Nonblocking, repackable, and rearrangeable Clos networks: fifty years of the theory evolution
IEEE Communications Magazine
Reducing complexity in tree-like computer interconnection networks
Parallel Computing
Proceedings of the first international workshop on Network-aware data management
Indirect cube: A power-efficient topology for compute clusters
Optical Switching and Networking
Fast pattern-specific routing for fat tree networks
ACM Transactions on Architecture and Code Optimization (TACO)
| Hi-index | 0.00 |
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fat-tree networks and their slimmed versions. The evaluation of such proposals and their comparison against currently used routing mechanisms have been driven by realistic traffic generated by HPC applications. Our experimental framework is based on the integration of two existing simulators, one replaying an MPI application and another simulating the network details. The resulting simulation platform has been fed with traces from real executions. We have obtained several interesting findings: (i) contrary to the widely accepted belief, random static routing in k-ary n-trees (which is the default option for InfiniBand and Myrinet technologies) is not a good solution for HPC applications; (ii) some existing oblivious routing techniques can be very good for certain communication patterns present on applications, but clearly fail for some others and (iii) one of the proposed pattern-aware routing algorithms could be used to better utilize network resources and thus achieve higher performance, particularly for the case of cost-effective networks.