Abstract

Many scientific codes consist of memory bandwidth bound kernels. One major advantage of many-core devices such as general purpose graphics processing units (GPGPUs) and the Intel Xeon Phi is their focus on providing increased memory bandwidth over traditional CPU architectures. Peak memory bandwidth is usually unachievable in practice and so benchmarks are required to measure a practical upper bound on expected performance. We augment the standard STREAM kernels with a dot product kernel to investigate the performance of simple reduction operations on large arrays. The choice of programming model should ideally not limit the achievable performance on a device. BabelStream (formally GPU-STREAM) has been updated to incorporate a wide variety of the latest parallel programming models, all implementing the same parallel scheme. As such this tool can be used as a kind of Rosetta Stone which provides both a cross-platform and cross-programming model array of results of achievable memory bandwidth.

Special Issue on Novel Strategies for Programming Accelerators

@article{ijcse18,
  author = {Deakin, Tom and Price, James and Martineau, Matt and McIntosh-Smith, Simon},
  title = {{Evaluating attainable memory bandwidth of parallel programming models via BabelStream}},
  journal = {{International Journal of Computational Science and Engineering}},
  volume = {17},
  number = {3},
  pages = {247--262},
  year = {2018},
  note = {Special Issue on Novel Strategies for Programming Accelerators},
  publisher = {{Inderscience}},
  doi = {10.1504/IJCSE.2018.095847},
  pdf = {https://research-information.bris.ac.uk/en/publications/evaluating-attainable-memory-bandwidth-of-parallel-programming-mo},
  keywords = {Journals}
}