Search NASA⌕ Search

SEARCH · Search NASA

Results for “computer system benchmarking”

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 1,513 records · Page 84

Use of mathematical modeling in nuclear measurements projects

Mathematical modeling of nuclear measurement systems is not a new concept. The response of the measurement system is described using a pre-defined mathematical model that depends on a set of parameters. These parameters are determined using a limited set of experimental measurement points e.g. efficiency curve, dose rates... etc. The model that agrees with the few experimental points is called an experimentally validated model. Once these models have been validated, we use mathematical interpolation to find the parameters of interest. Sometimes, when measurements are not practical or are impossible extrapolation is implemented but with care. CANBERRA has been extensively using mathematical modeling for the design and calibration of large and sophisticated systems to create and optimize designs that would be prohibitively expensive with only experimental tools. The case studies that will be presented here are primarily performed with MCNP, CANBERRA's MERCURAD/PASCALYS and ISOCS (In Situ Object Counting Software). For benchmarking purposes, both Monte Carlo and ray-tracing based codes are inter-compared to show models consistency and add a degree of reliability to modeling results. (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Development of a CFD code for casting simulation

The task of developing a computational fluid dynamics (CFD) code to accurately model the mold filling phase of a casting operation was accomplished in a systematic manner. First the state-of-the-art was determined through a literature search, a code search, and participation with casting industry personnel involved in consortium startups. From this material and inputs from industry personnel, an evaluation of the currently available codes was made. It was determined that a few of the codes already contained sophisticated CFD algorithms and further validation of one of these codes could preclude the development of a new CFD code for this purpose. With industry concurrence, ProCAST was chosen for further evaluation. Two benchmark cases were used to evaluate the code's performance using a Silicon Graphics Personal Iris system. The results of these limited evaluations (because of machine and time constraints) are presented along with discussions of possible improvements and recommendations for further evaluation.

Murph, Jesse E.↗

xSim: The Extreme-Scale Simulator

Investigating parallel application performance properties at scale is becoming an important part of high-performance computing (HPC) application development and deployment. The Extreme-scale Simulator (xSim) is a performance investigation toolkit that permits running an application in a controlled environment at extreme scale without the need for a respective extreme-scale HPC system. Using a lightweight parallel discrete event simulation, xSim executes a parallel application with a virtual wall clock time, such that performance data can be extracted based on a processor model and a network model. This paper presents significant enhancements to the xSim toolkit prototype that provide a more complete Message Passing Interface (MPI) support and improve its versatility. These enhancements include full virtual MPI group, communicator and collective communication support, and global variables support. The new capabilities are demonstrated by executing the entire NAS Parallel Benchmark suite in a simulated HPC environment.

99 GENERAL AND MISCELLANEOUS↗

NEA HTTR LOFC Project Test#3 Benchmark Results

In the second half of FY23, the High Temperature Engineering Test Reactor (HTTR) Loss Of Forced Cooling (LOFC)#3 data for the 9 MW test case with Vessel Cooling System (VCS) off were made available through the Nuclear Energy Agency (NEA) LOFC project framework; the neutronic model developed for the initial test (LOFC#1) achieved a satisfactory level of maturity, demonstrating its accuracy in predicting power evolution and core re-criticality, but LOFC#3 should be used primarily to investigate thermal hydraulic phenomena, as the reactor was shut down prematurely due to overheating in the upper reactor components, which prevented re-criticality; this report focuses on advancing the HTTR thermal hydraulic model to accurately simulate the LOFC#3 scenario, including simulating the LOFC#3 benchmark and generating the corresponding benchmark specifications, aiming to ensure consistency across participant models and provide essential data for future participants, including private industry stakeholders seeking to validate their computational tools.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Neutron Leakage Spectra Sensitivities for ICSBEP Benchmarks

Neutron leakage spectra have been measured, simulated, and investigated by many groups. These spectra have many uses, including determining shielding requirements and calculating dose for radiation protection purposes, validating nuclear data, and determining material composition. It has even been proposed to use measurements of neutron leakage spectra to determine the soil composition of Mars. As part of the Los Alamos National Laboratory (LANL) Experiments Underpinned by Computational Learning for Improvements in nuclear Data (EUCLID) Laboratory Directed Research Development (LDRD) project, the authors are working on developing methods to calculate sensitivities to neutron leakage spectra. This may allow nuclear data evaluators to better use neutron leakage spectra data to constrain or adjust nuclear data. This may also be particularly useful as many neutron leakage spectra measurements do not require fissile material and can be performed with well characterized neutron sources. Neutron leakage spectra measurements are usually performed by placing a detector at the outside of a nuclear system. This may be a reactor, a neutron generator, or a neutron source. Certain detection systems can use pulse height data to infer neutron energies, other detector systems rely on other ways of determining neutron energy (for example, a Bonner sphere with multiple moderator thicknesses can be used to measure neutron spectrum). These measurements typically rely on some unfolding of the measured results. For pulsed systems like the "Livermore Pulsed Spheres," time-of-flight information can also help to constrain the neutron energy spectra data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Simulation of radiation damping in rings, using stepwise ray-tracing methods

The ray-tracing code Zgoubi computes particle trajectories in arbitrary magnetic and/or electric field maps or analytical field models. It includes a built-in fitting procedure, spin tracking many Monte Carlo processes. The accuracy of the integration method makes it an efficient tool for multi-turn tracking in periodic machines. Energy loss by synchrotron radiation, based on Monte Carlo techniques, had been introduced in Zgoubi in the early 2000s for studies regarding the linear collider beam delivery system. However, only recently has this Monte Carlo tool been used for systematic beam dynamics and spin diffusion studies in rings, including eRHIC electron-ion collider project at the Brookhaven National Laboratory. Some beam dynamics aspects of this recent use of Zgoubi capabilities, including considerations of accuracy as well as further benchmarking in the presence of synchrotron radiation in rings, are reported here.

43 PARTICLE ACCELERATORS↗

IRIS-DMEM: Efficient Memory Management for Heterogeneous Computing

This paper proposes an efficient data memory management approach for the Intelligent RuntIme System (IRIS) heterogeneous computing framework along with new data transfer policies. IRIS provides a task-based programming model for extreme heterogeneous computing (e.g., CPU, GPU, DSP, FPGA) with support for today's most important programming languages (e.g., OpenMP, OpenCL, CUDA, HIP, OpenACC). However, the IRIS framework either forces the programmer to introduce data transfer commands for each task or relies on suboptimal memory management for automatic and transparent data transfers. The work described here extends IRIS with novel heterogeneous memory handling and introduces novel data transfer policies by employing the Distributed data MEMory handler (DMEM) for efficient and optimal movement of data among the various computing resources. The proposed approach achieves performance gains of up to 7× for tiled LU factorization and tiled DGEMM (i.e., matrix multiplication) benchmarks. Moreover, this approach also reduces data transfers by up to 71% when compared to previous IRIS heterogeneous memory management handlers. This work compares the performance results of the IRIS framework's novel DMEM with the StarPU runtime and MAGMA math library for GPUs. Experiments show a performance gain of up to 1.95× over StarPU and 2.1× over MAGMA.

Miniskar, Narasinga Rao↗

MO-F-16A-06: Implementation of a Radiation Exposure Monitoring System for Surveillance of Multi-Modality Radiation Dose Data

Purpose: We have implemented a commercially available Radiation Exposure Monitoring System (REMS) to enhance the processes of radiation dose data collection, analysis and alerting developed over the past decade at our sites of practice. REMS allows for consolidation of multiple radiation dose information sources and quicker alerting than previously developed processes. Methods: Thirty-nine x-ray producing imaging modalities were interfaced with the REMS: thirteen computed tomography scanners, sixteen angiography/interventional systems, nine digital radiography systems and one mammography system. A number of methodologies were used to provide dose data to the REMS: Modality Performed Procedure Step (MPPS) messages, DICOM Radiation Dose Structured Reports (RDSR), and DICOM header information. Once interfaced, the dosimetry information from each device underwent validation (first 15–20 exams) before release for viewing by end-users: physicians, medical physicists, technologists and administrators. Results: Before REMS, our diagnostic physics group pulled dosimetry data from seven disparate databases throughout the radiology, radiation oncology, cardiology, electrophysiology, anesthesiology/pain management and vascular surgery departments at two major medical centers and four associated outpatient clinics. With the REMS implementation, we now have one authoritative source of dose information for alerting, longitudinal analysis, dashboard/graphics generation and benchmarking. REMS provides immediate automatic dose alerts utilizing thresholds calculated through daily statistical analysis. This has streamlined our Closing the Loop process for estimated skin exposures in excess of our institutional specific substantial radiation dose level which relied on technologist notification of the diagnostic physics group and daily report from the radiology information system (RIS). REMS also automatically calculates the CT size-specific dose estimate (SSDE) as well as provides two-dimensional angulation dose maps for angiography/interventional procedures. Conclusion: REMS implementation has streamlined and consolidated the dosimetry data collection and analysis process at our institutions while eliminating manual entry error and providing immediate alerting and access to dosimetry data to both physicists and physicians. Brent Stewart has funded research through GE Healthcare.

60 APPLIED LIFE SCIENCES↗

Advection of Microphysical Scalars in Terminal Area Simulation System (TASS)

The Terminal Area Simulation System (TASS) is a large eddy scale atmospheric flow model with extensive turbulence and microphysics packages. It has been applied successfully in the past to a diverse set of problems ranging from prediction of severe convective events (Proctor et al. 2002), tracking storms and for simulating weapons effects such as the dispersion and fallout of fission debris (Bacon and Sarma 1991), etc. More recently, TASS has been used for predicting the transport and decay of wake vortices behind aircraft (Proctor 2009). An essential part of the TASS model is its comprehensive microphysics package, which relies on the accurate computation of microphysical scalar transport. This paper describes an evaluation of the Leonard scheme implemented in the TASS model for transporting microphysical scalars. The scheme is validated against benchmark cases with exact solutions and compared with two other schemes - a Monotone Upstream-centered Scheme for Conservation Laws (MUSCL)-type scheme after van Leer and LeVeque's high-resolution wave propagation method. Finally, a comparison between the schemes is made against an incident of severe tornadic super-cell convection near Del City, Oklahoma.

Ahmad, Nashat N.↗

Assessment of ORIGEN Reactor Library Development for Pebble-Bed Reactors Based on the PBMR-400 Benchmark

This report provides an evaluation of present SCALE capabilities for modeling depletion of pebble-bed reactor systems, using the PBMR-400 benchmark as a test case. A specific aim of this work is to understand the system characteristics required to generate production-quality reactor data libraries for rapid depletion calculations with ORIGEN. This report includes a discussion of present SCALE capabilities for modeling doubly heterogeneous fuels, prior SCALE work modeling pebble bed–type reactors, and a detailed neutronic analysis of the PBMR-400 core for both fresh and equilibrium-composition core conditions.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Evaluating interaction energies of weakly bonded systems using the Buckingham-Hirshfeld method

We present the finalized Buckingham-Hirshfeld method (BHD-DFT) for the evaluation of interaction energies of non-bonded dimers with Density Functional Theory (DFT). In the method, dispersion energies are evaluated from static multipole polarizabilities, obtained on-the-fly from Coupled Perturbed Kohn-Sham calculations and partitioned into diatomic contributions using the iterative Hirshfeld partitioning method. The dispersion energy expression is distributed over four atoms and has therefore a higher delocalized character compared to the standard pairwise expressions. Additionally, full multipolar polarizability tensors are used as opposed to effective polarizabilities, allowing to retain the anisotropic character at no additional computational cost. A density dependent damping function for the BLYP, PBE, BP86, B3LYP, and PBE0 functionals has been implemented, containing two global parameters which were fitted to interaction energies and geometries of a selected number of dimers using a bi-variate RMS fit. The method is benchmarked against the S22 and S66 data sets for equilibrium geometries and the S22x5 and S66x8 data sets for interaction energies around the equilibrium geometry. Best results are achieved using the B3LYP functional with mean average deviation values of 0.30 and 0.24 kcal/mol for the S22 and S66 data sets, respectively. This situates the BHD-DFT method among the best performing dispersion inclusive DFT methods. Effect of counterpoise correction on DFT energies is discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Online Photometric Calibration of Automatic Gain Thermal Infrared Cameras

Thermal infrared cameras are increasingly being used in various applications such as robot vision, industrial inspection and medical imaging, thanks to their improved resolution and portability. However, the performance of traditional computer vision techniques developed for electro-optical imagery does not directly translate to the thermal domain due to two major reasons: these algorithms require photometric assumptions to hold, and methods for photometric calibration of RGB cameras cannot be applied to thermal-infrared cameras due to difference in data acquisition and sensor phenomenology. In this paper, we take a step in this direction, and introduce a novel algorithm for online photometric calibration of thermalinfrared cameras. Our proposed method does not require any specific driver/hardware support and hence can be applied to any commercial off-the-shelf thermal IR camera. We present this in the context of visual odometry and SLAM algorithms, and demonstrate the efficacy of our proposed system through extensive experiments for both standard benchmark datasets, and real-world field tests with a thermal-infrared camera in natural outdoor environments.

Daftry, Shreyansh↗

OpenACC Profiling Support for Clang and LLVM using Clacc and TAU

Since its launch in 2010, OpenACC has evolved into one of the most widely used portable programming models for accelerators on HPC systems today. Clacc is a project funded by the US Exascale Computing Project (ECP) to bring OpenACC support for C and C++ to the popular Clang and LLVM compiler infrastructure. In this paper, we describe Clacc's support for the OpenACC Profiling Interface, a critical component of the OpenACC specification that standardizes an interface that profiling tools and libraries can depend upon across OpenACC implementations. As part of Clacc's general strategy to build OpenACC support upon OpenMP, we describe how Clacc builds OpenACC Profiling Interface support upon an extended version of OMPT. We then describe how a major profiling and tracing toolkit within ECP, the TAU Performance System, takes advantage of this support. We also describe TAU's selective instrumentation support for OpenACC. Finally, using Clacc and TAU, we present example visualizations for several SPEC ACCEL OpenACC benchmarks running on an IBM AC922 node, and we show that the associated performance overhead is negligible.

Coti, Camille↗

Numerical methods for the inverse problem of density functional theory

Here, the inverse problem of Kohn–Sham density functional theory (DFT) is often solved in an effort to benchmark and design approximate exchange-correlation potentials. The forward and inverse problems of DFT rely on the same equations but the numerical methods for solving each problem are substantially different. We examine both problems in this tutorial with a special emphasis on the algorithms and error analysis needed for solving the inverse problem. Two inversion methods based on partial differential equation constrained optimization and constrained variational ideas are introduced. We compare and contrast several different inversion methods applied to one-dimensional finite and periodic model systems.

97 MATHEMATICS AND COMPUTING↗

Improving Large-scale Storage System Performance via Topology-aware and Balanced Data Placement

With the advent of big data, the I/O subsystems of large-scale compute clusters are becoming a center of focus, with more applications putting greater demands on end-to-end I/O performance. These subsystems are often complex in design. They comprise of multiple hardware and software layers to cope with the increasing capacity, capability and scalability requirements of data intensive applications. The sharing nature of storage resources and the intrinsic interactions across these layers make it to realize user-level, end-to-end performance gains a great challenge. We propose a topology-aware resource load balancing strategy to improve per-application I/O performance. We demonstrate the effectiveness of our algorithm on an extreme-scale compute cluster, Titan, at the Oak Ridge Leadership Computing Facility (OLCF). Our experiments with both synthetic benchmarks and a real-world application show that, even under congestion, our proposed algorithm can improve large-scale application I/O performance significantly, resulting in both the reduction of application run times and higher resolution simulation runs.

Wang, Feiyi↗

Cycle-by-cycle Delay Estimation at Signalized Intersections by using Machine Learning and Simulated Video Detection Data

Accurate estimation of delay is crucial for efficient traffic signal operations. Estimation of delay in the real-time manner using traditional loop detectors requires advanced detectors (in addition to stop-bar detection). In cases when this detection layout is not in place, delay estimates are approximated with a lower accuracy. Video detection is one of the most frequently deployed detection systems at signalized intersections in recent years. In most cases video detection operates in the same way as traditional inductive loops. However, when coupled with computer vision algorithms, video detection systems could be used to retrieve additional information (e.g., vehicular arrivals and departures) that cannot be taken out from the conventional systems (e.g., long stop-bar loop detectors). Although present for several decades, video detection data were not frequently examined for delay estimation purposes. In this study, we proposed a novel delay estimation model which can be developed with only data from stop-bar video detectors. Relevant data were collected from a simulation model of 11 signalized intersections at downtown Chattanooga, TN and processed to create needed inputs for model development. With the use of multigene genetic programming the authors developed a delay model that outperforms accuracy of multi regression model. Furthermore, authors evaluated the developed model by comparison with the other benchmark delay models, such as HCM and approach delay model. It was found that the developed MGGP delay model outperforms benchmark models for a wide range of traffic and signal operation conditions.

Erdagi, Ismet Goksad↗

A Preconditioned Low-Rank Projection Method with a Rank-Reduction Scheme for Stochastic Partial Differential Equations

Herein, we consider the numerical solution of large systems of linear equations obtained from the stochastic Galerkin formulation of stochastic partial differential equations. We propose an iterative algorithm that exploits the Kronecker product structure of the linear systems. The proposed algorithm efficiently approximates the solutions in low-rank tensor format. Using standard Krylov subspace methods for the data in tensor format is computationally prohibitive due to the rapid growth of tensor ranks during the iterations. To keep tensor ranks low over the entire iteration process, we devise a rank-reduction scheme that can be combined with the iterative algorithm. The proposed rank-reduction scheme identifies an important subspace in the stochastic domain and compresses tensors of high rank on-the-fly during the iterations. The proposed reduction scheme is a coarse-grid method in that the important subspace can be identified inexpensively in a coarse spatial grid setting. The efficiency of the present method is displayed by numerical experiments on benchmark problems.

97 MATHEMATICS AND COMPUTING↗

Performance Efficiency and Effectivness of Supercomputers

Our first purpose here is to offer to a general technical and policy audience a perspective on whether the supercomputing community should focus on improving the efficiency of supercomputing systems and their use rather than on building larger and ostensibly more capable systems that are used at low efficiency. After first summarizing our content and defining some necessary terms, we give a concise answer to this question. We then set this in context by characterizing performance of current supercomputing systems on a variety of benchmark problems and actual problems drawn from workloads in the national security, industrial, and scientific context. Along the way we answer some related questions, identify some important technological trends, and offer a perspective on the significance of these trends. Our second purpose is to give a reasonably broad and transparent overview of the related issue space and thereby to better equip the reader to evaluate commentary and controversy concerning supercomputing performance. For example, questions repeatedly arise concerning the Linpack benchmark and its predictive power, so we consider this in moderate depth as an example. We also characterize benchmark and application performance for scientific and engineering use of supercomputers and offer some guidance on how to think about these. Examples here are drawn from traditional scientific computing. Other problem domains, for example, data analytics, have different performance characteristics that are better captured by different benchmark problems or applications, but the story in those domains is similar in character and leads to similar conclusions with regard to the motivating question.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗