A scalable infrastructure for the performance analysis of passive target synchronization

  • Authors:

  • Marc-André Hermanns;Sriram Krishnamoorthy;Felix Wolf

  • Affiliations:

  • German Research School for Simulation Sciences, 52062 Aachen, Germany and Dept. of Computer Science, RWTH Aachen University, 52056 Aachen, Germany;Computer Science and Mathematics Division, Pacific Northwest National Laboratory, Richland, WA, USA;German Research School for Simulation Sciences, 52062 Aachen, Germany and Dept. of Computer Science, RWTH Aachen University, 52056 Aachen, Germany and Jülich Supercomputing Centre, Forschungs ...

  • Venue:
  • Parallel Computing
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Partitioned global address space (PGAS) languages combine the convenient abstraction of shared memory with the notion of affinity, extending multi-threaded programming to large-scale systems with physically distributed memory. However, in spite of their obvious advantages, PGAS languages still lack appropriate tool support for performance analysis, one of the reasons why their adoption is still in its infancy. Some of the performance problems for which tool support is needed occur at the level of the underlying one-sided communication substrate, such as the Aggregate Remote Memory Copy Interface (ARMCI). One such example is the waiting time in situations where asynchronous data transfers cannot be completed without software intervention at the target side. This is not uncommon on systems with reduced operating-system kernels such as IBM Blue Gene/P where the use of progress threads would double the number of cores necessary to run an application. In this paper, we present an extension of the Scalasca trace-analysis infrastructure aimed at the identification and quantification of progress-related waiting times at larger scales. We demonstrate its utility and scalability using a benchmark running with up to 32,768 processes.