skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Advances in Domain Mapping of Massively Parallel Scientific Computations

Abstract

One of the most important concerns in parallel computing is the proper distribution of workload across processors. For most scientific applications on massively parallel machines, the best approach to this distribution is to employ data parallelism; that is, to break the datastructures supporting a computation into pieces and then to assign those pieces to different processors. Collectively, these partitioning and assignment tasks comprise the domain mapping problem.

Authors:
 [1];  [1]
  1. Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Publication Date:
Research Org.:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Org.:
USDOE National Nuclear Security Administration (NNSA)
OSTI Identifier:
1331498
Report Number(s):
SAND2015-8747R
615285
DOE Contract Number:  
AC04-94AL85000
Resource Type:
Technical Report
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING

Citation Formats

Leland, Robert W., and Hendrickson, Bruce A. Advances in Domain Mapping of Massively Parallel Scientific Computations. United States: N. p., 2015. Web. doi:10.2172/1331498.
Leland, Robert W., & Hendrickson, Bruce A. Advances in Domain Mapping of Massively Parallel Scientific Computations. United States. doi:10.2172/1331498.
Leland, Robert W., and Hendrickson, Bruce A. Thu . "Advances in Domain Mapping of Massively Parallel Scientific Computations". United States. doi:10.2172/1331498. https://www.osti.gov/servlets/purl/1331498.
@article{osti_1331498,
title = {Advances in Domain Mapping of Massively Parallel Scientific Computations},
author = {Leland, Robert W. and Hendrickson, Bruce A.},
abstractNote = {One of the most important concerns in parallel computing is the proper distribution of workload across processors. For most scientific applications on massively parallel machines, the best approach to this distribution is to employ data parallelism; that is, to break the datastructures supporting a computation into pieces and then to assign those pieces to different processors. Collectively, these partitioning and assignment tasks comprise the domain mapping problem.},
doi = {10.2172/1331498},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2015},
month = {10}
}

Technical Report:

Save / Share: