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.
- R. Barrett et al. Summary of Work for ASC L2 Milestone 4465: Characterize the Role of the Mini-Application in Predicting Key Performance Characteristics of Real Applications. Tech. Report SAND2012-4667, Sandia National Laboratories, 2012.Google Scholar
- R. Barrett et al. Navigating an evolutionary fast path to exascale. In Proc. PMBS, 2012. Google Scholar
Digital Library
- A. Bhatele et al. Automated mapping of regular communication graphs on mesh interconnects. In Proc. HiPC, 2010.Google Scholar
Cross Ref
- M. Deveci et al. Exploiting geometric partitioning in task mapping for parallel computers. In Proc. IPDPS, to appear.Google Scholar
- F. Gygi et al. Large-scale electronic structure calculations of high-Z metals on the BlueGene/L platform. In Proc. SC, 2006. Google Scholar
Digital Library
- T. Hoefler and M. Snir. Generic topology mapping strategies for large-scale parallel architectures. In Proc. ICS, 2011. Google Scholar
Digital Library
Index Terms
Task mapping stencil computations for non-contiguous allocations
Recommendations
Task mapping stencil computations for non-contiguous allocations
PPoPP '14: Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programmingWe 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 ...
Local search to improve coordinate-based task mapping
Local search algorithm that improves on task mapping algs for stencil patterns.Algorithm shown to reduce total running time and running time variability.Improvement shown to depend on the allocation algorithm used.Number of swaps made shown to be ...
A static mapping heuristics to map parallel applications to heterogeneous computing systems: Research Articles
In order to minimize the execution time of a parallel application running on a heterogeneously distributed computing system, an appropriate mapping scheme is needed to allocate the application tasks to the processors. The general problem of mapping ...







Comments