SEARCH · Engineering Papers
Results for “Computational Performance”
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.
Energy Based Performance Tuning for Large Scale High Performance Computing Systems.
Abstract not provided.
High Performance Computing for Static and Dynamic Analyses of Heliostats for Concentrating Solar Power (Powerpoint Presentation).
Abstract not provided.
Detection and Correction of Silent Data Corruption for Large-Scale High-Performance Computing.
Abstract not provided.
Advanced SmartGrid Modeling and Simulation using High Performance Computing.
Abstract not provided.
Investigating Real Power Usage on High Performance Computing Platforms.
Abstract not provided.
Measuring and Tuning Energy Efficiency on Large Scale High Performance Computing Platforms.
Abstract not provided.
Adaptive partitioning in high performance computing for scientific simulations using AMR.
Abstract not provided.
Adaptive Partitioning in High-Performance Computing for Scientific Simulations using Adaptive Mesh Techniques.
Abstract not provided.
Sandia National Laboratories Innovates Research & Development and Testing with High-Performance Computing Solution.
Abstract not provided.
ADIOS Visualization Schema: A First Step towards Improving Interdisciplinary Collaboration in High Performance Computing
Explore the source record for details and available documents.
High-Performance Computation of Distributed-Memory Parallel 3D Voronoi and Delaunay Tessellation
Computing a Voronoi or Delaunay tessellation from a set of points is a core part of the analysis of many simulated and measured datasets: N-body simulations, molecular dynamics codes, and LIDAR point clouds are just a few examples. Such computational geometry methods are common in data analysis and visualization; but as the scale of simulations and observations surpasses billions of particles, the existing serial and shared-memory algorithms no longer suffice. A distributed-memory scalable parallel algorithm is the only feasible approach. The primary contribution of this paper is a new parallel Delaunay and Voronoi tessellation algorithm that automatically determines which neighbor points need to be exchanged among the subdomains of a spatial decomposition. Other contributions include periodic and wall boundary conditions, comparison of our method using two popular serial libraries, and application to numerous science datasets.
Virtual Accelerator Support for High Performance Computing Clouds
Explore the source record for details and available documents.
High Performance Computing in Accelerator Science: Past Successes. Future Challenges
Explore the source record for details and available documents.
Towards fully automated high performance computing drug discovery: A massively parallel virtual screening pipeline for docking and MM/GBSA rescoring to improve enrichment
Abstract not provided