Task mapping stencil computations for non-contiguous allocations

Authors:
Vitus J. Leung;David P. Bunde;Jonathan Ebbers;Stefan P. Feer;Nickolas W. Price;Zachary D. Rhodes;Matthew Swank
Affiliations:
Sandia National Laboratories, Albuquerque, NM, USA;Knox College, Galesburg, IL, USA;Knox College, Galesburg, IL, USA;3M Health Information Systems, Inc., Wallingford, CT, USA;Knox College, Galesburg, IL, USA;Allstate Corporation, Northbrook, IL, USA;Knox College, Galesburg, IL, USA
Venue:
Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming
Year:
2014

Citing 3
Cited 0

Large-scale electronic structure calculations of high-Z metals on the BlueGene/L platform

Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Generic topology mapping strategies for large-scale parallel architectures

Proceedings of the international conference on Supercomputing
Navigating an Evolutionary Fast Path to Exascale

SCC '12 Proceedings of the 2012 SC Companion: High Performance Computing, Networking Storage and Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine task mapping algorithms for systems that allocate jobs non-contiguously. Several studies have shown that task placement affects job running time. We focus on jobs with a stencil communication pattern and use experiments on a Cray XE to evaluate novel task mapping algorithms as well as some adapted to this setting. This is done with the miniGhost miniApp which mimics the performance of CTH, a shock physics application. Our strategies improve average and single-run times by as much as 28% and 36% over a baseline strategy, respectively.