Local search to improve coordinate-based task mapping

Balzuweit, Evan; Bunde, David P.; Leung, Vitus J.; Finley, Austin; Lee, Alan C. S.

doi:10.1016/j.parco.2015.10.012

Local search to improve coordinate-based task mapping

Journal Article · Sat Oct 31 00:00:00 EDT 2015 · Parallel Computing

DOI:https://doi.org/10.1016/j.parco.2015.10.012· OSTI ID:1238587

Balzuweit, Evan ^[1]; Bunde, David P. ^[2]; Leung, Vitus J. ^[3]; Finley, Austin ^[2]; Lee, Alan C. S. ^[2]

Washington Univ., St. Louis, MO (United States)
Knox College, Galesburg, IL (United States)
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

We present a local search strategy to improve the coordinate-based mapping of a parallel job’s tasks to the MPI ranks of its parallel allocation in order to reduce network congestion and the job’s communication time. The goal is to reduce the number of network hops between communicating pairs of ranks. Our target is applications with a nearest-neighbor stencil communication pattern running on mesh systems with non-contiguous processor allocation, such as Cray XE and XK Systems. Utilizing the miniGhost mini-app, which models the shock physics application CTH, we demonstrate that our strategy reduces application running time while also reducing the runtime variability. Furthermore, we further show that mapping quality can vary based on the selected allocation algorithm, even between allocation algorithms of similar apparent quality.

Research Organization:: Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)

Sponsoring Organization:: USDOE National Nuclear Security Administration (NNSA)

Grant/Contract Number:: AC04-94AL85000

OSTI ID:: 1238587

Alternate ID(s):: OSTI ID: 1251777

Report Number(s):: SAND--2015-8243J; PII: S0167819115001441

Journal Information:: Parallel Computing, Journal Name: Parallel Computing Journal Issue: C Vol. 51; ISSN 0167-8191

Publisher:: ElsevierCopyright Statement

Country of Publication:: United States

Language:: English

References (12)

Parallel static and dynamic multi-constraint graph partitioning Schloegel, Kirk; Karypis, George; Kumar, Vipin Concurrency and Computation: Practice and Experience, Vol. 14, Issue 3 https://doi.org/10.1002/cpe.605	journal	January 2002
Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance Bender, Michael A.; Bunde, David P.; Demaine, Erik D. Algorithmica, Vol. 50, Issue 2 https://doi.org/10.1007/s00453-007-9037-2	journal	September 2007
Genetic algorithm based heuristics for the mapping problem Chockalingam, T.; Arunkumar, S. Computers & Operations Research, Vol. 22, Issue 1 https://doi.org/10.1016/0305-0548(94)P2435-7	journal	January 1995
Compact location problems Krumke, S. O.; Marathe, M. V.; Noltemeier, H. Theoretical Computer Science, Vol. 181, Issue 2 https://doi.org/10.1016/S0304-3975(96)00304-0	journal	July 1997
Heuristic technique for processor and link assignment in multicomputers Bollinger, S. W.; Midkiff, S. F. IEEE Transactions on Computers, Vol. 40, Issue 3 https://doi.org/10.1109/12.76410	journal	March 1991
Noncontiguous processor allocation algorithms for mesh-connected multicomputers Lo, V.; Windisch, K. J. IEEE Transactions on Parallel and Distributed Systems, Vol. 8, Issue 7 https://doi.org/10.1109/71.598346	journal	July 1997
PReMAS: Simulator for Resource Management Bunde, David P.; Leung, Vitus J. 2014 43nd International Conference on Parallel Processing Workshops (ICCPW), 2014 43rd International Conference on Parallel Processing Workshops https://doi.org/10.1109/ICPPW.2014.39	conference	September 2014
Navigating an Evolutionary Fast Path to Exascale Barrett, R. F.; Hammond, S. D.; Vaughan, C. T. 2012 SC Companion: High Performance Computing, Networking, Storage and Analysis (SCC), 2012 SC Companion: High Performance Computing, Networking Storage and Analysis https://doi.org/10.1109/SC.Companion.2012.55	conference	November 2012
On the Mapping Problem No authors listed IEEE Transactions on Computers, Vol. C-30, Issue 3 https://doi.org/10.1109/TC.1981.1675756	journal	March 1981
Benefits of Topology Aware Mapping for Mesh Interconnects Bhatelé, Abhinav; Kalé, Laxmikant V. Parallel Processing Letters, Vol. 18, Issue 04 https://doi.org/10.1142/S0129626408003569	journal	December 2008
Reducing the bulk in the bulk Synchronous Parallel Model Barrett, R. F.; Vaughan, C. T.; Hammond, S. D. Parallel Processing Letters, Vol. 23, Issue 04 https://doi.org/10.1142/S0129626413400100	journal	December 2013
Resource allocation and utilization in the Blue Gene/L supercomputer Aridor, Y.; Domany, T.; Goldshmidt, O. IBM Journal of Research and Development, Vol. 49, Issue 2.3 https://doi.org/10.1147/rd.492.0425	journal	March 2005

Cited By (1)

On the effects of allocation strategies for exascale computing systems with distributed storage and unified interconnects Pascual, Jose A.; Lant, Joshua; Concatto, Caroline Concurrency and Computation: Practice and Experience, Vol. 31, Issue 21 https://doi.org/10.1002/cpe.4784	journal	July 2018

Similar Records

Geometric Mapping of Tasks to Processors on Parallel Computers with Mesh or Torus Networks

Journal Article · Mon Mar 11 20:00:00 EDT 2019 · IEEE Transactions on Parallel and Distributed Systems · OSTI ID:1502119

Exploiting Geometric Partitioning in Task Mapping for Parallel Computes

Technical Report · Sun Apr 01 00:00:00 EDT 2018 · OSTI ID:1436057

Task mapping for non-contiguous allocations.

Technical Report · Thu Jan 31 23:00:00 EST 2013 · OSTI ID:1093699

Related Subjects

97 MATHEMATICS AND COMPUTING
local search
non-contiguous allocation
stencil communication pattern
task mapping

Local search to improve coordinate-based task mapping

Citation Formats

References (12)

Cited By (1)

Similar Records

Related Subjects