Task mapping for non-contiguous allocations.
Abstract
This paper examines task mapping algorithms for non-contiguously allocated parallel jobs. Several studies have shown that task placement affects job running time for both contiguously and non-contiguously allocated jobs. Traditionally, work on task mapping either uses a very general model where the job has an arbitrary communication pattern or assumes that jobs are allocated contiguously, making them completely isolated from each other. A middle ground between these two cases is the mapping problem for non-contiguous jobs having a specific communication pattern. We propose several task mapping algorithms for jobs with a stencil communication pattern and evaluate them using experiments and simulations. Our strategies improve the running time of a MiniApp by as much as 30% over a baseline strategy. Furthermore, this improvement increases markedly with the job size, demonstrating the importance of task mapping as systems grow toward exascale.
- Authors:
- Publication Date:
- Research Org.:
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Org.:
- USDOE National Nuclear Security Administration (NNSA)
- OSTI Identifier:
- 1093699
- Report Number(s):
- SAND2013-0962
463332
- DOE Contract Number:
- AC04-94AL85000
- Resource Type:
- Technical Report
- Country of Publication:
- United States
- Language:
- English
Citation Formats
Leung, Vitus Joseph, Bunde, David P., Ebbers, Johnathan, Price, Nicholas W., Swank, Matthew., Feer, Stefan P., and Rhodes, Zachary D. Task mapping for non-contiguous allocations.. United States: N. p., 2013.
Web. doi:10.2172/1093699.
Leung, Vitus Joseph, Bunde, David P., Ebbers, Johnathan, Price, Nicholas W., Swank, Matthew., Feer, Stefan P., & Rhodes, Zachary D. Task mapping for non-contiguous allocations.. United States. https://doi.org/10.2172/1093699
Leung, Vitus Joseph, Bunde, David P., Ebbers, Johnathan, Price, Nicholas W., Swank, Matthew., Feer, Stefan P., and Rhodes, Zachary D. 2013.
"Task mapping for non-contiguous allocations.". United States. https://doi.org/10.2172/1093699. https://www.osti.gov/servlets/purl/1093699.
@article{osti_1093699,
title = {Task mapping for non-contiguous allocations.},
author = {Leung, Vitus Joseph and Bunde, David P. and Ebbers, Johnathan and Price, Nicholas W. and Swank, Matthew. and Feer, Stefan P. and Rhodes, Zachary D.},
abstractNote = {This paper examines task mapping algorithms for non-contiguously allocated parallel jobs. Several studies have shown that task placement affects job running time for both contiguously and non-contiguously allocated jobs. Traditionally, work on task mapping either uses a very general model where the job has an arbitrary communication pattern or assumes that jobs are allocated contiguously, making them completely isolated from each other. A middle ground between these two cases is the mapping problem for non-contiguous jobs having a specific communication pattern. We propose several task mapping algorithms for jobs with a stencil communication pattern and evaluate them using experiments and simulations. Our strategies improve the running time of a MiniApp by as much as 30% over a baseline strategy. Furthermore, this improvement increases markedly with the job size, demonstrating the importance of task mapping as systems grow toward exascale.},
doi = {10.2172/1093699},
url = {https://www.osti.gov/biblio/1093699},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Fri Feb 01 00:00:00 EST 2013},
month = {Fri Feb 01 00:00:00 EST 2013}
}