XcalableMP implementation and performance of NAS Parallel Benchmarks

  • Authors:
  • Masahiro Nakao;Jinpil Lee;Taisuke Boku;Mitsuhisa Sato

  • Affiliations:
  • University of Tsukuba;University of Tsukuba;University of Tsukuba;University of Tsukuba

  • Venue:
  • Proceedings of the Fourth Conference on Partitioned Global Address Space Programming Model
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

XcalableMP is a parallel extension of existing languages, such as C and Fortran, that was proposed as a new programming model to facilitate program parallel applications for distributed memory systems. In order to investigate the performance of parallel programs written in XcalableMP, we have implemented NAS Parallel Benchmarks, specifically, the Embarrassingly Parallel (EP) benchmark, the Integer Sort (IS) benchmark, and the Conjugate Gradient (CG) benchmark, using XcalableMP. The results show that the performance of XcalableMP is comparable to that of MPI. In particular, the performances of IS with a histogram and CG with two-dimensional parallelization achieve almost the same performance. The results also demonstrate that XcalableMP allows a programmer to write efficient parallel applications at a lower programming cost.