Analysis and Optimization of the HPCC Randomaccess Benchmark on Blue Gene/L Supercomputer : Extended Version

The performance of supercomputers has traditionally been evaluated using the LINPACK benchmark, which stresses only the floating point units without significantly loading the memory or the network subsystems.

The HPC Challenge (HPCC) benchmark suite is being proposed as an alternative to evaluate the performance of supercomputers. The HPCC benchmark suite consists of seven 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 study the performance of this benchmark on the Blue Gene/L supercomputer. We describe the optimizations made to get optimal performance and discuss the inherent limits in scaling this benchmark to massively parallel systems.

By: Rahul Garg, Yogish Sabharwal

Published in: RI05010 in 2006


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .