Search NASA⌕ Search

SEARCH · Search NASA

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.

At least 145 records · Page 8

Decentralized Distributed Proximal Policy Optimization (DD-PPO) for High Performance Computing Scheduling on Multi-User Systems

Resource allocation in High Performance Computing (HPC) environments presents a complex and multifaceted challenge for job scheduling algorithms. Beyond the efficient allocation of system resources, schedulers must account for and optimize multiple performance metrics, including job wait time and system throughput. Traditional heuristic-based scheduling algorithms increasingly struggle and lack the efficiency needed to meet the demands and address the complexity and scale of modern HPC systems. Consequently, recent research efforts have focused on leveraging advancements in Artificial Intelligence (AI) and Deep Learning (DL), particularly Reinforcement Learning (RL), to develop more adaptable and intelligent scheduling strategies. Previous RL-based scheduling approaches have explored a range of algorithms, from Deep Q-Networks (DQN) to Proximal Policy Optimization (PPO), and more recently, hybrid methods that integrate Graph Neural Networks (GNNs) with RL techniques. However, a common limitation across these methods is their reliance on relatively small datasets, with few methods being evaluated using large-scale, multi-million-job trace datasets representative of real-world HPC workloads. Moreover, existing RL schedulers face scalability issues due to centralized policy updates, which hinder training efficiency and performance when applied to large datasets. This study introduces a novel RL-based scheduler utilizing Decentralized Distributed Proximal Policy Optimization (DD-PPO) algorithm, which supports large-scale distributed training across multiple workers without requiring parameter synchronization at every step. By eliminating reliance on centralized updates to a shared policy, the DD-PPO scheduler enhances scalability, training efficiency, and sample utilization. Experimental validation using a large real-world dataset containing over 11.5 million job traces collected from petascale HPC systems over six years assesses the influence of dataset scale on training effectiveness and compares DD-PPO performance to traditional and advanced scheduling approaches. The experimental results demonstrate improved scheduling performance in comparison to both heuristic-based schedulers and existing RL-based scheduling algorithms.

AI↗

3D Characterization and Time-Lapse Imaging of the Desiccation Treatability Test at the Hanford BC-Cribs and Trenches Site using High Performance Computing applied to Electrical Resistivity Imaging - 12271

Contaminated vadose zone materials are a potential source of long-term groundwater contamination at many sites across the Department of Energy (DOE) complex. Deep vadose zone contamination presents a particularly challenging remedial problem due to the difficultly of locating contaminants and the expense of access and ex situ treatment. In situ remediation techniques, whereby remedial amendments must be delivered to contaminated soils, have been identified as a potential alternative. However, amendment delivery is typically uncertain and post delivery remedial performance is often not well understood due to limited information available from sparsely spaced boreholes. Recent advancements in electrical resistivity tomography (ERT) are being used to address these challenges at the Hanford site by providing remote, three-dimensional images of contaminant distribution and four-dimensional (three spatial dimensions plus the time dimension) images of in-situ vadose zone remediation processes. These capabilities were recently demonstrated with a large scale surface characterization effort and during a smaller scale desiccation treatability test at the Hanford BC-Cribs area. The results of these efforts demonstrate the utility of leveraging high-performance computing resources to process ERT data for 3D reconnaissance mapping of subsurface contaminants and for detailed 3D monitoring of vadose zone remediation efforts. Two examples of ERT imaging at a former waste disposal facility have been demonstrated at different scales; a large scale reconnaissance survey spanning many hundreds of meters and a detailed monitoring application spanning a few tens of meters. Although ERT is applicable at many scales, resolution is generally governed by proximity to electrodes. For instance, the BCCT reconnaissance survey demonstrated herein lost resolution with depth (i.e. away from surface electrodes), and was unable to detect a high conductivity anomaly at approximately 75 m below ground surface in the cribs area; the deep anomalies were detected during highly focused borehole sampling. Conversely, the desiccation site characterization and monitoring demonstrated high resolution at a small scale, but only because of close proximity to survey electrodes. Although proximity to electrodes is not the only factor governing ERT resolution, it is often the primary factor for determining how an ERT system should be effectively deployed for a given application. Regardless of resolution limitations, the utility of ERT for remotely detecting wastes and monitoring subsurface processes is evident. ERT imaging is not a final detection or monitoring solution alone, but provides a necessary capability to remotely detect subsurface conditions and understand subsurface processes. Such a capability can significantly increase the efficacy and reduce the cost of remediation by guiding sampling efforts and informing remedial system design and operation. However, given the computational demands of 3D ERT characterization and monitoring inversions, the full imaging capability enabled by contemporary ERT survey systems can generally only be realized with high performance computing resources, both hardware and software. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Pattern-based Modeling of High-Performance Computing Resilience

With the growing scale and complexity of high-performance computing (HPC) systems, resilience solutions that ensure continuity of service despite frequent errors and component failures must be methodically designed to balance the reliability requirements with the overheads to performance and power. Design patterns enable a structured approach to the development of resilience solutions, providing hardware and software designers with the building block elements for the rapid development of novel solutions and for adapting existing technologies for emerging, extreme-scale HPC environments. In this paper, we develop analytical models that enable designers to evaluate the reliability and performance characteristics of the design patterns. These models are particularly useful in building a unified framework that analyzes and compares various resilience solutions built using a combination of patterns.

Hukerikar, Saurabh↗

Pattern-based Modeling of Multiresilience Solutions for High-Performance Computing

Resiliency is the ability of large-scale high-performance computing (HPC) applications to gracefully handle errors, and recover from failures. In this paper, we propose a pattern-based approach to constructing resilience solutions that handle multiple error modes. Using resilience patterns, we evaluate the performance and reliability characteristics of detection, containment and mitigation techniques for transient errors that cause silent data corruptions and techniques for fail-stop errors that result in process failures. We demonstrate the design and implementation of the multiresilience solution based on patterns instantiated across multiple layers of the system stack. The patterns are integrated to work together to achieve resiliency to different error types in a performance-efficient manner.

Ashraf, Rizwan↗

Guide to Performing Computational Analysis of Criticality Accident Alarm Systems

This document provides guidance on performing computational analyses of Criticality Accident Alarm Systems (CAAS). A brief overview of ANSI/ANS-8.3-1997 (R2012), the standard that the United States Department of Energy uses to guide the placement of CAAS detectors, is provided with a focus on the parts of the standard that are most applicable to calculating CAAS detector responses and evaluating CAAS detector coverage. This is followed by a brief discussion of how CAAS detector response calculations differ from eigenvalue calculations that criticality safety practitioners perform regularly. The remainder of the document provides computational examples of how to determine the minimum accident of concern according to ANSI/ANS-8.3-1997 (R2012), how to calculate the response of a CAAS detector due to a specific criticality accident, and how to evaluate the coverage of a CAAS detector for criticality accidents. These practical examples are solved applying SCALE 6.1 and MCNP5, but the methodologies can be applied to other radiation transport codes with similar capabilities, including deterministic codes.

Miller, Thomas Martin↗

High-performance Computing Applied to Semantic Databases

To-date, the application of high-performance computing resources to Semantic Web data has largely focused on commodity hardware and distributed memory platforms. In this paper we make the case that more specialized hardware can offer superior scaling and close to an order of magnitude improvement in performance. In particular we examine the Cray XMT. Its key characteristics, a large, global shared-memory, and processors with a memory-latency tolerant design, offer an environment conducive to programming for the Semantic Web and have engendered results that far surpass current state of the art. We examine three fundamental pieces requisite for a fully functioning semantic database: dictionary encoding, RDFS inference, and query processing. We show scaling up to 512 processors (the largest configuration we had available), and the ability to process 20 billion triples completely in-memory.

99 GENERAL AND MISCELLANEOUS↗

The COVID-19 High-Performance Computing Consortium

In March of 2020, recognizing the potential of High Performance Computing (HPC) to accelerate understanding and the pace of scientific discovery in the fight to stop COVID-19, the HPC community assembled the largest collection of worldwide HPC resources to enable COVID-19 researchers worldwide to advance their critical efforts. Amazingly, the COVID-19 HPC Consortium was formed within one week through the joint effort of the Office of Science and Technology Policy (OSTP), the U.S. Department of Energy (DOE), the National Science Foundation (NSF), and IBM to create a unique public–private partnership between government, industry, and academic leaders. This article is the Consortium's story–how the Consortium was created, its founding members, what it provides, how it works, and its accomplishments. We will reflect on the lessons learned from the creation and operation of the Consortium and describe how the features of the Consortium could be sustained as a National Strategic Computing Reserve to ensure the nation is prepared for future crises.

97 MATHEMATICS AND COMPUTING↗

Future High Performance Computing Capabilities: Summary Report of the Advanced Scientific Computing Advisory Committee (ASCAC) Subcommittee

The ASCAC Subcommittee on Future High Performance Computing (HPC) Capabilities has reviewed opportunities and challenges related to the most promising technologies that are currently planned for the post-exascale (2020's) and post-Moore (2030's and beyond) timeframes. We briefly summarize in this report the key findings and recommendations from this review, from the perspective of planning and research directions that need to be given priority to prepare for the very significant challenges that await us in the post-Moore computing era. An overarching concern that emerged from the subcommittee's deliberations is that DOE has lost considerable momentum in funding and sustaining a research pipeline in the applied math and computer science areas that should have been the "seed corn" for preparing for these future challenges, and it is therefore critical to correct this gap as soon as possible. While the subcommittee understands the paramount importance of DOE's commitment to deliver exascale capabilities, we believe that it is essential for DOE ASCR to fund research and development that looks beyond the Exascale Computing Project (ECP) horizon so as to ensure our nation's continued leadership in HPC and we were glad to learn about the ASCAC exascale transition subcommittee in this regard.

97 MATHEMATICS AND COMPUTING↗

High Performance Computing Application I/O Traces

The dataset comprises trace files from high performance computing (HPC) simulations. The trace files contain records of every I/O operation executed by a simulation application run, including I/O operations from HDF5, MPI-IO, and POSIX and all of the parameters supplied to those operations, e.g. file name, offset, and flags. The traces are generated by executing a simulation application that is linked with the Recorder tracing tool (https://github.com/uiuc-hpc/Recorder). The Recorder trace tool intercepts the I/O calls made by the application, records the I/O trace record, and then calls the intended I/O call so that the operation executes.

Wang, C.↗

High Performance Computing Management: A Sustainable System Software Approach

The demand for high performance computing (HPC) resources continues to grow, driven by the increasing complexity of modeling and simulation, artificial intelligence (AI), and machine learning (ML) workloads [Porter]. The growing energy consumption demand of these HPC systems is a significant concern, both in terms of operational costs and environmental impact. AI hardware accelerators are expected to reach 1.5% of the world’s power consumption by 2029 [Shah].

97 - MATHEMATICS AND COMPUTING↗

High Performance Computing Traffic Simulations for Real-Time Traffic Control of Mobility in Chattanooga Region

In 2019, highway congestion wasted over 3 billion gallons of fuel and caused 8.8 billion hours of lost productivity.1 Research has shown that introducing near-real time traffic controls can significantly reduce congestion. Validated and calibrated traffic simulations enable the modeling of transportation systems and the evaluation of different traffic control actions and schemes given a variety of circumstances that represent likely future scenarios. The developed scenarios can inform the deployment of controls in near real-time to improve freight and passenger vehicle congestion and energy use. In this work, we present simulations used to model the traffic in the Chattanooga, Tennessee, metropolitan area. Simulations were constructed and calibrated using a variety of local, data science enhanced, data sources utilizing open source software including the Simulation of Urban Mobility (SUMO) simulator. High-Performance Computing (HPC) provides a scalable platform with enough computing for the high-fidelity simulation of many scenarios and the application of advance data science especially for large-scale systems. Our simulations include microscopic simulations at a corridor level for traffic signal control, and mesoscopic simulations to evaluate regional operational controls and infrastructure.

97 MATHEMATICS AND COMPUTING↗

Software stewardship and advancement of a high-performance computing scientific application: QMCPACK

Here, we provide an overview of the software engineering efforts and their impact in QMCPACK, a production-level ab-initio Quantum Monte Carlo open-source code targeting high-performance computing (HPC) systems. Aspects included are: (i) strategic expansion of continuous integration (CI) targeting CPUs, using GitHub Actions own runners, and NVIDIA and AMD GPUs used in pre-exascale systems, (ii) incremental reduction of memory leaks using sanitizers, (iii) incorporation of Docker containers for CI and reproducibility, and (iv) refactoring efforts to improve maintainability, testing coverage, and memory lifetime management. We quantify the value of these improvements by providing metrics to illustrate the shift towards a predictive, rather than reactive, maintenance approach. Our goal, in documenting the impact of these efforts on QMCPACK, is to contribute to the body of knowledge on the importance of research software engineering (RSE) for the stewardship and advancement of community HPC codes to enable scientific discovery at scale.

97 MATHEMATICS AND COMPUTING↗

Intro - High Performance Computing for 2015 HPC Annual Report

The recent Executive Order creating the National Strategic Computing Initiative (NSCI) recognizes the value of high performance computing for economic competitiveness and scientific discovery and commits to accelerate delivery of exascale computing. The HPC programs at Sandia –the NNSA ASC program and Sandia’s Institutional HPC Program– are focused on ensuring that Sandia has the resources necessary to deliver computation in the national interest.

Klitsner, Tom↗

Comparing High Performance Computing Accelerator Programming Models

Accelerator devices are becoming a norm in High Performance Computing (HPC). With more systems opting for heterogeneous architectures, portable programming models like OpenMP and OpenACC are becoming increasingly important. The SPEC ACCEL 1.2 benchmark suite consists of comparable benchmarks in OpenCL, OpenMP 4.5, and OpenACC 2.5 that can be used to evaluate the performance and support for programming models and frameworks on heterogeneous platforms. In this paper we go beneath the normative metric of performance times and look at the individual kernels to study the usage, strengths, and weaknesses of the two prevalent portable heterogeneous programming models, OpenMP and OpenACC. From our analysis we identify that benchmarks like MRI-Q, SP and BT have better performance using OpenACC, while benchmarks like MiniGhost, LBM and LBDC do consistently better with the OpenMP programming model across supercomputers like Titan, and Summit.We deep dive into the kernels of select four benchmarks to answer questions like: Where does the benchmark spend most of its cycles? What is the parallelization strategy used? Why is one programming model more performant than the other? By identifying the similarities and dierences we want to contrast between the benchmark implementation strategies in the SPEC ACCEL 1.2 benchmarks and provide more insights into the OpenMP and OpenACC programming models.

Pophale, Swaroop S.↗