Adapting wave-front algorithms to efficiently utilize systems with deep communication hierarchies

  • Authors:

  • Darren J. Kerbyson;Michael Lang;Scott Pakin

  • Affiliations:

  • Fundamentals of Computational Sciences, Pacific Northwest National Laboratory, WA 99353, USA;Computer, Computational, and Statistical Sciences, Los Alamos National Laboratory, NM 87544, USA;Computer, Computational, and Statistical Sciences, Los Alamos National Laboratory, NM 87544, USA

  • Venue:
  • Parallel Computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Large-scale systems increasingly exhibit a differential between intra-chip and inter-chip communication performance especially in hybrid systems using accelerators. Processor-cores on the same socket are able to communicate at lower latencies, and with higher bandwidths, than cores on different sockets either within the same node or between nodes. A key challenge is to efficiently use this communication hierarchy and hence optimize performance. We consider here the class of applications that contains wave-front processing. In these applications data can only be processed after their upstream neighbors have been processed. Similar dependencies result between processors in which communication is required to pass boundary data downstream and whose cost is typically impacted by the slowest communication channel in use. In this work we develop a novel hierarchical wave-front approach that reduces the use of slower communications in the hierarchy but at the cost of additional steps in the parallel computation and higher use of on-chip communications. This tradeoff is explored using a performance model. An implementation using the reverse-acceleration programming model on the petascale Roadrunner system demonstrates a 27% performance improvement at full system-scale on a kernel application. The approach is generally applicable to large-scale multi-core and accelerated systems where a differential in communication performance exists.