The International Conference for High Performance Computing, Networking, Storage and Analysis
Task Mapping for Non-Contiguous Allocations.
Authors: David P. Bunde (Knox College), Johnathan Ebbers (Knox College), Stefan P. Feer (3M Health Information Systems), Vitus J. Leung (Sandia National Laboratories), Nickolas W. Price (Knox College), Zachary D. Rhodes (Allstate Corporation), Matthew Swank (Knox College)
Abstract: We examine task mapping algorithms for systems that allocate jobs non-contiguously, such as the Cray X series. Several studies have shown that task
placement affects job running time for both contiguously and non-contiguously allocated jobs. Our focus is on jobs with a stencil communication pattern. We 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 running time by as much as 28% over a baseline strategy.