SEARCH · Search NASA
Results for “parallelization”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Highly parallel scanning tunneling microscope based hydrogen depassivation lithography
Not provided.
Toward an Evolutionary Task Parallel Integrated MPI + X Programming Model.
Abstract not provided.
Moment representation in the lattice Boltzmann method on massively parallel hardware
The widely-used lattice Boltzmann method (LBM) for computational fluid dynamics is highly scalable, but also significantly memory bandwidth-bound on current architectures. This paper presents a new regularized LBM implementation that reduces the memory footprint by only storing macroscopic, moment-based data. We show that the amount of data that must be stored in memory during a simulation is reduced by up to 47%. We also present a technique for cache-aware data re-utilization and show that optimizing cache utilization to limit data motion results in a similar improvement in time to solution. These new algorithms are implemented in the hemodynamics solver HARVEY and demonstrated using both idealized and realistic biological geometries. We develop a performance model for the moment representation algorithm and evaluate the performance on Summit.
A Parallel Graph Algorithm for Detecting Mesh Singularities in Distributed Memory Ice Sheet Simulations.
Abstract not provided.
The Minos Computing Library: Efficient Parallel Programming for Extremely Heterogeneous Systems
Hardware specialization has become the silver bullet to achieve efficient high performance, from Systems-on-Chip systems, where hardware specialization can be ``extreme'', to large-scale HPC systems. As the complexity of the systems increases, so does the complexity of programming such architectures in a portable way. This work introduces the Minos Computing Library (MCL), as system software, programming model, and programming model runtime that facilitate programming extremely heterogeneous systems. MCL supports the execution of several multi-threaded applications within the same compute node, performs asynchronous execution of application tasks, efficiently balances computation across hardware resources, and provides performance portability. We show that code developed on a personal desktop automatically scales up to fully utilize powerful workstations with 8 GPUs and down to power-efficient embedded systems. MCL provides up to 17.5x speedup over OpenCL on NVIDIA DGX-1 systems and up to 1.88x speedup on single-GPU systems. In multi-application workloads, MCL dynamically resource allocation provides up to 2.43x performance improvement over manual, static allocation of computing resources.
Silicon Photonic Single-Sideband Generation with Dual-Parallel Mach-Zehnder Modulators.
Abstract not provided.
Reduced as Components in Highly Oxidized Environments: Evidence from Full Spectral XANES Imaging Using the Maia Massively Parallel Detector
N/A
High Performance Parallel Processing Project (HPPP) Advanced Materials Designs for Massively Parallel Environment Final Report CRADA No. TC-0824-94-I
This project was a multi-partner CRADA with nine industrial partners. The CRADA with Xerox PARC made available the advanced quantum-level materials modeling (code name: PCGPP) code developed at LLNL to. the wider industrial community by porting and optimizing these codes for Cray Research supercomputers.
Parallel Programming: From Serial to Massively Parallel in a Morning [Slides]
Abstract not provided.
MCNP6 Parallel Performance Analysis: How to Efficiently Run MCNP6 in Parallel
Explore the source record for details and available documents.
The Parallel Implementation and Accuracy of Matrix Compression in the Method of Moments Code EIGER.
Abstract not provided.
Parallel I/O: A Deployable, Robust File System for Parallel I/O
Explore the source record for details and available documents.
RF Modeling Using Parallel Codes ACE3P for the 400-MHz Parallel-Bar/Ridged-Waveguide Compact Crab Cavity for the LHC HiLumi Upgrade
Abstract Not Provided
Parallel-DFTL: A Flash Translation Layer that Exploits Internal Parallelism in Solid State Drives
Explore the source record for details and available documents.
Parallel Sparse Tensor Decomposition with the Trilinos Parallel Linear Algebra Framework.
Abstract not provided.
DOE SBIR Phase-1 Report on Hybrid CPU-GPU Parallel Development of the Eulerian-Lagrangian Barracuda Multiphase Program
This report gives the result from the Phase-1 work on demonstrating greater than 10x speedup of the Barracuda computer program using parallel methods and GPU processors (General-Purpose Graphics Processing Unit or Graphics Processing Unit). Phase-1 demonstrated a 12x speedup on a typical Barracuda function using the GPU processor. The problem test case used about 5 million particles and 250,000 Eulerian grid cells. The relative speedup, compared to a single CPU, increases with increased number of particles giving greater than 12x speedup. Phase-1 work provided a path for reformatting data structure modifications to give good parallel performance while keeping a friendly environment for new physics development and code maintenance. The implementation of data structure changes will be in Phase-2. Phase-1 laid the ground work for the complete parallelization of Barracuda in Phase-2, with the caveat that implemented computer practices for parallel programming done in Phase-1 gives immediate speedup in the current Barracuda serial running code. The Phase-1 tasks were completed successfully laying the frame work for Phase-2. The detailed results of Phase-1 are within this document. In general, the speedup of one function would be expected to be higher than the speedup of the entire code because of I/O functions and communication between the algorithms. However, because one of the most difficult Barracuda algorithms was parallelized in Phase-1 and because advanced parallelization methods and proposed parallelization optimization techniques identified in Phase-1 will be used in Phase-2, an overall Barracuda code speedup (relative to a single CPU) is expected to be greater than 10x. This means that a job which takes 30 days to complete will be done in 3 days. Tasks completed in Phase-1 are: Task 1: Profile the entire Barracuda code and select which subroutines are to be parallelized (See Section Choosing a Function to Accelerate) Task 2: Select a GPU consultant company and jointly parallelize subroutines (CPFD chose the small business EMPhotonics for the Phase-1 the technical partner. See Section Technical Objective and Approach) Task 3: Integrate parallel subroutines into Barracuda (See Section Results from Phase-1 and its subsections) Task 4: Testing, refinement, and optimization of parallel methodology (See Section Results from Phase-1 and Section Result Comparison Program) Task 5: Integrate Phase-1 parallel subroutines into Barracuda and release (See Section Results from Phase-1 and its subsections) Task 6: Roadmap of Phase-2 (See Section Plan for Phase-2) With the completion of Phase 1 we have the base understanding to completely parallelize Barracuda. An overview of the work to move Barracuda to a parallelized code is given in Plan for Phase-2.