Software Routing and Aggregation of Messages to Optimize the Performance of HPCC Randomaccess Benchmark
Authors:
- 1 November 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 15
Abstract
The HPC challenge (HPCC) benchmark suite is increasingly being used to evaluate the performance of supercomputers. It augments the traditional LINPACK benchmark by adding six more benchmarks, each designed to measure a specific aspect of the system performance. In this paper, we analyze the HPCC randomaccess benchmark which is designed to measure the performance of random memory updates. We show that, on many systems, the bisection bandwidth of the network may be the performance bottleneck of this benchmark. We suggest an aggregation and software routing based technique that may be used to optimize this benchmark. We report the performance results obtained using this technique on the Blue Gene/L supercomputerKeywords
This publication has 8 references indexed in Scilit:
- Optimization of MPI collective communication on BlueGene/L systems2005
- Overview of the Blue Gene/L system architectureIBM Journal of Research and Development, 2005
- Blue Gene/L compute chip: Memory and Ethernet subsystemIBM Journal of Research and Development, 2005
- Expander flows, geometric embeddings and graph partitioning2004
- The LINPACK Benchmark: past, present and futureConcurrency and Computation: Practice and Experience, 2003
- ARMCI: A portable remote memory copy library for distributed array libraries and compiler run-time systems1999
- Deadlock-Free Message Routing in Multiprocessor Interconnection NetworksIEEE Transactions on Computers, 1987
- Gprof1982