Engineering Papers⌕ Search

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.

At least 163 records · Page 9

Geant4 Computing Performance Benchmarking and Monitoring

Performance evaluation and analysis of large scale computing applications is essential for optimal use of resources. As detector simulation is one of the most compute intensive tasks and Geant4 is the simulation toolkit most widely used in contemporary high energy physics (HEP) experiments, it is important to monitor Geant4 through its development cycle for changes in computing performance and to identify problems and opportunities for code improvements. All Geant4 development and public releases are being profiled with a set of applications that utilize different input event samples, physics parameters, and detector configurations. Results from multiple benchmarking runs are compared to previous public and development reference releases to monitor CPU and memory usage. Observed changes are evaluated and correlated with code modifications. Besides the full summary of call stack and memory footprint, a detailed call graph analysis is available to Geant4 developers for further analysis. The set of software tools used in the performance evaluation procedure, both in sequential and multi-threaded modes, include FAST, IgProf and Open|Speedshop. In conclusion, the scalability of the CPU time and memory performance in multi-threaded application is evaluated by measuring event throughput and memory gain as a function of the number of threads for selected event samples.

97 MATHEMATICS AND COMPUTING↗

Experimental Evaluation and Workload Characterization for High-Performance Computer Architectures

This research is conducted in the context of the Joint NSF/NASA Initiative on Evaluation (JNNIE). JNNIE is an inter-agency research program that goes beyond typical.bencbking to provide and in-depth evaluations and understanding of the factors that limit the scalability of high-performance computing systems. Many NSF and NASA centers have participated in the effort. Our research effort was an integral part of implementing JNNIE in the NASA ESS grand challenge applications context. Our research work under this program was composed of three distinct, but related activities. They include the evaluation of NASA ESS high- performance computing testbeds using the wavelet decomposition application; evaluation of NASA ESS testbeds using astrophysical simulation applications; and developing an experimental model for workload characterization for understanding workload requirements. In this report, we provide a summary of findings that covers all three parts, a list of the publications that resulted from this effort, and three appendices with the details of each of the studies using a key publication developed under the respective work.

El-Ghazawi, Tarek A.↗

The Improved Simple Corner Balance Method and Efforts to Enhance its Computational Performance

The diamond difference (DD) spatial discretization has long been a work horse of the neutron transport community. For nearly as long as DD has been used in neutron transport, it has been observed that DD produces undamped, non-physical angular fluxes in spatially under resolved problems and can fail in the thick diffusion limit. A long list of alternative spatial discretizations, all with better physics properties: accuracy, robustness, and/or preservation of the thick diffusion limit, have been proposed as alternatives to DD. Unfortunately, these alternative spatial discretizations also require significantly more floating point operations (FLOPs) per unknown compared to DD. Historically, neutron transport problems of interest have been able to be resolved sufficiently that DD is accurate enough and FLOPs have been the computational performance bottleneck controlling time to solution. Thus, in practice DD has been and remains a preferred spatial discretization for neutron transport simulations. Trends in computing architecture are leading to a new paradigm where data movement, not FLOPs will control time to solution. This presents an opportunity to improve neutron transport physics by reconsidering more FLOP intensive spatial discretization than DD without incurring a time to solution penalty. In this work, we consider the improved simple corner balance (ISCB) spatial discretization, a unique alternative to DD that has the same memory footprint as DD, and detail efforts to improve its computational performance. The ISCB spatial discretization is a more FLOP intensive spatial discretization than DD with the same memory footprint as DD. Though designed to maximize FLOP intensity, third party libraries such as LAPACK are not tuned for the unique, frequent, small linear algebra needs of neutron transport problems. While hand coding a sparse Gauss elimination is likely to be faster than a dense matrix solve (CM vs. HGE), were LAPACK suitable for small linear algebra problems, we would not have seen a performance increase with decreased numbers of LAPACK calls for the Schur complement solve (SC4 vs. SC1). Significant effort has reduced the relative compute time of ISCB to DD, but on current computer architectures DD is still faster than ISCB. Future work comparing the overall efficiency of ISCB to DD may reveal that while ISCB is slower than DD on current computers, ISCB is more accurate than DD by a factor greater than the compute time slowdown. As new computer architectures become available, we will test our hypothesis that neutron transport simulations will be bandwidth limited, ideally rendering the additional FLOPs required by ISCB to be 'free' [in terms of time to solution]. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

High Performance Computing to Enable Next-Generation Low-Temperature Waste Heat Recovery

US manufacturing industry fails to recover an estimated 900 trillion BTUs of low-temperature waste heat from its processes each year. A grand research challenge has been to develop waste heat recovery technology that can be applied to industrial manufacturing processes and vehicle operations. The Oak Ridge National Laboratory (ORNL)/Eaton research team performed computational research and development to design an innovative direct-contact heat exchanger (DCHE) technology to deliver low-cost, compact, longer-lifetime, high-efficiency waste heat recovery that is optimized for a low-temperature organic Rankine cycle. ORNL resources and expertise in high performance computing (HPC) and multiphase flows were utilized to realize this goal while advancing the fundamental understanding of two-phase, two-immiscible-fluid turbulent flow heat transfer for heat exchangers. In the first stage of the project, a computational fluid dynamics (CFD) model of a DCHE was developed. Verification and limited validation of the numerical solution were performed using experimental data from published literature. To support efforts in verification and validation, two-dimensional CFD models were also developed with the objective of investigating different boundary conditions to reach converged, steady-state solutions.Based on benchmarking efforts, a baseline industry-grade design of a DCHE was developed, which consists of two horizontal pipes of different cross-sectional areas – joined by a converging-diverging nozzle in the middle and relies on a three-phase system with co-current flows for operation. Evaporation of the cold liquid (n-pentane or methanol) by the hot liquid water occurs in the first pipe. The first pipe contains two inlets for liquid water and liquid pentane (or liquid methanol). The second pipe with the larger cross-sectional area serves as a gravity-driven phase-separator. It contains two outlets that are staggered to avoid entrainment of the liquid water phase by the gas phase. This baseline design resulted from several trial-and-error evaluations using two-dimensional CFD models. Confirmatory three-dimensional CFD models were also run for different mass flow rates and inlet temperatures (inlet water temperature ranging from 50°C to 90°C), and efficiency plots were produced to fully characterize the proposed industrial-grade design of the DCHE.

97 MATHEMATICS AND COMPUTING↗

iSSH v. Auditd: Intrusion Detection in High Performance Computing

The goal is to provide insight into intrusions in high performance computing, focusing on tracking intruders motions through the system. The current tools, such as pattern matching, do not provide sufficient tracking capabilities. We tested two tools: an instrumented version of SSH (iSSH) and Linux Auditing Framework (Auditd). First discussed is Instrumented Secure Shell (iSSH): a version of SSH developed at Lawrence Berkeley National Laboratory. The goal is to audit user activity within a computer system to increase security. Capabilities are: Keystroke logging, Records user names and authentication information, and Catching suspicious remote and local commands. Strengths for iSSH are: (1) Good for keystroke logging, making it easier to track malicious users by catching suspicious commands; (2) Works with Bro to send alerts; could be configured to send pages to systems administrators; and (3) Creates visibility into SSH sessions. Weaknesses are: (1) Relatively new, so not very well documented; and (2) No capabilities to see if files have been edited, moved, or copied within the system. Second we discuss Auditd, the user component of the Linux Auditing System. It creates logs of user behavior, and monitors systems calls and file accesses. Its goal is to improve system security by keeping track of users actions within the system. Strenghts of Auditd are: (1) Very thorough logs; (2) Wider variety of tracking abilities than iSSH; and (3) Older, so better documented. Weaknesses are: (1) Logs record everything, not just malicious behavior; (2) The size of the logs can lead to overflowing directories; and (3) This level of logging leads to a lot of false alarms. Auditd is better documented than iSSH, which would help administrators during set up and troubleshooting. iSSH has a cleaner notification system, but the logs are not as detailed as Auditd. From our performance testing: (1) File transfer speed using SCP is increased when using iSSH; and (2) Network benchmarks were roughly the same regardless of which tool was running.

99 GENERAL AND MISCELLANEOUS↗

Prediction and characterization of application power use in a high-performance computing environment

Power use in data centers and high-performance computing (HPC) facilities has grown in tandem with increases in the size and number of these facilities. Substantial innovation is needed to enable meaningful reduction in energy footprints in leadership-class HPC systems. In this paper, we focus on characterizing and investigating application-level power usage. We demonstrate potential methods for predicting power usage based on a priori and in situ characteristics. Lastly, we highlight a potential use case of this method through a simulated power-aware scheduler using historical jobs from a real scientific HPC system.

97 MATHEMATICS AND COMPUTING↗

Privacy Preservation from High-Performance Computing to Autonomous Science [Industrial and Governmental Activities]

High-Performance Computing (HPC) and Leadership-Class Supercomputing are driving forces behind scientific advancements, enabling researchers to tackle complex challenges in physics, chemistry, biology, and engineering. These systems power vast simulations and data analyses, fueling discoveries in fields ranging from materials science to climate modeling. However, their use often involves processing sensitive data—such as proprietary industry simulations, biomedical records, and national security computations—posing significant privacy concerns. In conclusion, this issue is amplified in collaborative environments like Department of Energy (DOE) user facilities, where HPC resources are shared across institutions to foster innovation.

Kotevska, Olivera [Oak Ridge National Laboratory (↗

Linear Static Structural and Vibration Analysis on High-Performance Computers

Parallel computers offer the opportunity to significantly reduce the computation time necessary to analyze large-scale aerospace structures. This paper presents algorithms developed for and implemented on a massively-parallel computers hereafter referred to as Scalable High Performance Computers (SHPC) for the most computationally intensive tasks involved in structural analysis, namely, generation and assembly of system matrices, solution of systems of equations and calculation of the eigenvalues and eigenvectors. Results on SHPC are presented for large-scale structural problems (i.e. Models of high speed civil transport). The goal of this research is to develop new efficient technique which extend structural analysis to SHPC and make large-scale structural analyses tractable.

Baddourah, Majdi↗

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↗