Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer software”

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,207 records · Page 67

Resilience Through Data-Driven, Intelligent Designed Control: A Formal Methods Approach

The PNNL and GTRI team developed a strategy to integrate temporal logic rule specification for detection of cyber-intrusion in the source code and control algorithms of CPS using advanced cyber-data. The GTRI team utilized its capabilities in rule synthesis and temporal logic specifications for software assurance and verification to detect and predict impact of cyber-intrusions and malware in the computational and control algorithms of cyber-physical systems. The team also developed a testing and verification approach that could be used to validate the suggested approach against a realistic use-case CPS showcasing improvements in system impact prediction performance. Temporal logic offers a compact expression of events in absolute and relative time and has a formalized translation to state machines. As such, temporal logic rules can feasibly be synthesized to any system as a rule engine, with the process being formally verified to be correct. The goal here is to utilize temporal logic rules to detect cyber-attacks and manipulations in the computational algorithms and provide real-time software assurance and verification guarantees.

97 MATHEMATICS AND COMPUTING↗

Increasing Software Testing Coverage and Portability with Spack

Adequate testing coverage is critical for successful scientific software development. For numerically intensive codes, the test matrix should cover a variety of machines, compilers, third-party library dependencies, as well as possible other features such as memory testing, parallelization paradigms, and application options that may be enabled or disabled, as some examples. Such coverage can be a major burden on developers without powerful methods for managing the matrix. Spack is a great tool developed by Lawrence Livermore National Lab for managing software on a Unix-based system and in addition to this, we are leveraging Spack to simplify application testing development and management. Here we demonstrate exploiting many of Spack's features to orchestrate the test coverage for the Nalu-Wind application we are developing under the Exascale Computing Project. By using Spack underneath our testing infrastructure, we have increased our testing coverage, portability, robustness, and software quality. While we use our Nalu-Wind application as an example, the benefits of exploiting Spack for application testing can be had for other applications as well.

97 MATHEMATICS AND COMPUTING↗

Mastering HPC Runtime Prediction: From Observing Patterns to a Methodological Approach

The continual expansion of high-performance computing (HPC) brings with it an increasing need for efficiency. Heavy investment in energy, hardware, and software infrastructure to support peta- and exascale computing requires the optimization of existing systems and, wherever possible, the discernment and adoption of best-practices towards these goals. Such is the case for runtime prediction. When a job is submitted to an HPC system, an estimate of its runtime is provided by the user in the form of "requested wallclock". Error in this user-provided estimate can lead to jobs being prematurely killed by the scheduler, increased wait time on the queue, and decreased system utilization. More than fifteen years of research has been directed at mitigating these effects by using data-driven runtime predictions. Codified here is a set of commonalities and insights emerging from this body of work, which we present as recommendations and best practices. These practices are combined into a methodological approach described and evaluated on an 11-million-job dataset from the National Renewable Energy Laboratory's petascale HPC system, Eagle. This dataset and the accompanying codebase have been released to the public domain for the benefit of the wider HPC research community.

high performance computing↗

Mastering HPC Runtime Prediction: From Observing Patterns to a Methodological Approach: Preprint

The continual expansion of high-performance computing (HPC) brings with it an increasing need for efficiency. Heavy investment in energy, hardware, and software infrastructure to support peta- and exascale computing requires the optimization of existing systems and, wherever possible, the discernment and adoption of best-practices towards these goals. Such is the case for runtime prediction. When a job is submitted to an HPC system, an estimate of its runtime is provided by the user in the form of "requested wallclock''. Error in this user-provided estimate can lead to jobs being prematurely killed by the scheduler, increased wait time on the queue, and decreased system utilization. More than fifteen years of research has been directed at mitigating these effects by using data-driven runtime predictions. Codified here is a set of commonalities and insights emerging from this body of work, which we present as recommendations and best practices. These practices are combined into a methodological approach described and evaluated on an 11-million-job dataset from the National Renewable Energy Laboratory's petascale HPC system, Eagle. This dataset and the accompanying codebase have been released to the public domain for the benefit of the wider HPC research community.

high performance computing↗

Computer application for design activity in power plants

Software for Design Activity in Power Plants' helps the Power Plant engineers and managers to manage the development and design activities of equipments in the field of power plants. This paper is basically concerned with the computerization of the design activity of Condenser, vital equipment in Heat Exchanger Unit of Thermal Power Plant required for condensing the steam and for further reclaimable purposes to achieve economy. This software will also provide facilities to maintain user profile and the respective work details.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

SU-G-BRC-04: Collimator Angle Optimization in Volumetric Modulated Arc Therapy

Purpose: Volumetric modulated arc therapy (VMAT) has revolutionized radiation treatment by decreasing treatment time and monitor units, thus reducing scattered and whole body radiation dose. As the collimator angle changes the apparent leaf gap becomes larger which can impact plan quality, organ at risk (OAR) sparing as well as IMRT QA passing rate which is investigated. Methods: Two sites (prostate and head and neck) that have maximum utilization of VMAT were investigated. Two previously treated VMAT patients were chosen. For each patient 10 plans were created by maintaining constant optimization constraints while varying collimator angles from 0-90 deg at an interval of 10 degrees for the first arc and the appropriate complimentary angle for the second arc. Plans were created with AAA algorithm using 6 MV beam on a Varian IX machine with Millennium 120 MLC. The dose-volume histogram (DVH) for each plan was exported and dosimetric parameters (D98, D95, D50, D2) as well homogeneity index (HI) and conformity index (CI) were computed. Each plan was validated for QA using ArcCheck with gamma index passing criteria of 2%/2 mm and 3%/3 mm. Additionally, normal tissue complication probability (NTCP) for each OAR was computed using Uzan-Nahum software. Results: The CI values for both sites had no impact as target volume coverage in every collimator angle were the same since it was optimized for adequate coverage. The HI which is representative of DVH gradient or dose uniformity in PTV showed a clear trend in both sites. The NTCP for OAR (brain and cochlea) in H&N plan and (bladder and rectum) in prostate plan showed a distinct superiority for collimator angles between 15-30 deg. The gamma passing rates were not correlated with angle. Conclusion: Based on CI, HI, NTCP and gamma passing index, it can be concluded that collimator angles should be maintained within 15–30 deg.

60 APPLIED LIFE SCIENCES↗

Development of a semi-adiabatic isoperibol solution calorimeter

A semi-adiabatic isoperibol solution calorimeter has been indigenously developed. The measurement system comprises modules for sensitive temperature measurement probe, signal processing, data collection, and joule calibration. The sensitivity of the temperature measurement module was enhanced by using a sensitive thermistor coupled with a lock-in amplifier based signal processor. A microcontroller coordinates the operation and control of these modules. The latter in turn is controlled through personal computer (PC) based custom made software developed with LabView. An innovative summing amplifier concept was used to cancel out the base resistance of the thermistor. The latter was placed in the dewar. The temperature calibration was carried out with a standard platinum resistance (PT100) sensor coupled with an 8½ digit multimeter. The water equivalent of this calorimeter was determined by using electrical calibration with the joule calibrator. The experimentally measured values of the quantum of heat were validated by measuring heats of dissolution of pure KCl (for endotherm) and tris (hydroxyl methyl) amino-methane (for exotherm). The uncertainity in the measurements was found to be within ±3%.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

SU-E-T-373: A Motorized Stage for Fast and Accurate QA of Machine Isocenter

Purpose: Precision delivery of radiation dose relies on accurate knowledge of the machine isocenter under a variety of machine motions. This is typically determined by performing a Winston-Lutz test consisting of imaging a known object at multiple gantry/collimator/table angles and ensuring that the maximum offset is within specified tolerance. The first step in the Winston-Lutz test is careful placement of a ball bearing at the machine isocenter as determined by repeated imaging and shifting until accurate placement has been determined. Conventionally this is performed by adjusting a stage manually using vernier scales which carry the limitation that each adjustment must be done inside the treatment room with the risks of inaccurate adjustment of the scale and physical bumping of the table. It is proposed to use a motorized system controlled outside of the room to improve the required time and accuracy of these tests. Methods: The three dimensional vernier scales are replaced by three motors with accuracy of 1 micron and a range of 25.4mm connected via USB to a computer in the control room. Software is designed which automatically detects the motors and assigns them to proper axes and allows for small shifts to be entered and performed. Input values match calculated offsets in magnitude and sign to reduce conversion errors. Speed of setup, number of iterations to setup, and accuracy of final placement are assessed. Results: Automatic BB placement required 2.25 iterations and 13 minutes on average while manual placement required 3.76 iterations and 37.5 minutes. The average final XYZ offsets is 0.02cm, 0.01cm, 0.04cm for automatic setup and 0.04cm, 0.02cm, 0.04cm for manual setup. Conclusion: Automatic placement decreased time and repeat iterations for setup while improving placement accuracy. Automatic placement greatly reduces the time required to perform QA.

07 ISOTOPE AND RADIATION SOURCES↗

Event Reconstruction for Many-core Architectures using Java

Although Moore's Law remains technically valid, the performance enhancements in computing which traditionally resulted from increased CPU speeds ended years ago. Chip manufacturers have chosen to increase the number of core CPUs per chip instead of increasing clock speed. Unfortunately, these extra CPUs do not automatically result in improvements in simulation or reconstruction times. To take advantage of this extra computing power requires changing how software is written. Event reconstruction is globally serial, in the sense that raw data has to be unpacked first, channels have to be clustered to produce hits before those hits are identified as belonging to a track or shower, tracks have to be found and fit before they are vertexed, etc. However, many of the individual procedures along the reconstruction chain are intrinsically independent and are perfect candidates for optimization using multi-core architecture. Threading is perhaps the simplest approach to parallelizing a program and Java includes a powerful threading facility built into the language. We have developed a fast and flexible reconstruction package (org.lcsim) written in Java that has been used for numerous physics and detector optimization studies. In this paper we present the results of our studies on optimizing the performance of this toolkit using multiple threads on many-core architectures.

99 GENERAL AND MISCELLANEOUS↗

GridPACK Toolkit for Developing Power Grid Simulations on High Performance Computing Platforms

This paper describes the GridPACK™ framework, which is designed to help power grid engineers develop modeling software capable of running on todays high performance computers. The framework contains modules for setting up distributed power grid networks, assigning buses and branches with arbitrary behaviors to the network, creating distributed matrices and vectors, using parallel linear and non-linear solvers to solve algebraic equations, and mapping functionality to create matrices and vectors based on properties of the network. In addition, the framework contains additional functionality to support IO and to manage errors.

Palmer, Bruce J.↗

Response Surface Methodology: An Extensive Potential to Optimize in vivo Photodynamic Therapy Conditions

Purpose: Photodynamic therapy (PDT) is based on the interaction of a photosensitizing (PS) agent, light, and oxygen. Few new PS agents are being developed to the in vivo stage, partly because of the difficulty in finding the right treatment conditions. Response surface methodology, an empirical modeling approach based on data resulting from a set of designed experiments, was suggested as a rational solution with which to select in vivo PDT conditions by using a new peptide-conjugated PS targeting agent, neuropilin-1. Methods and Materials: A Doehlert experimental design was selected to model effects and interactions of the PS dose, fluence, and fluence rate on the growth of U87 human malignant glioma cell xenografts in nude mice, using a fixed drug-light interval. All experimental results were computed by Nemrod-W software and Matlab. Results: Intrinsic diameter growth rate, a tumor growth parameter independent of the initial volume of the tumor, was selected as the response variable and was compared to tumor growth delay and relative tumor volumes. With only 13 experimental conditions tested, an optimal PDT condition was selected (PS agent dose, 2.80 mg/kg; fluence, 120 J/cm{sup 2}; fluence rate, 85 mW/cm{sup 2}). Treatment of glioma-bearing mice with the peptide-conjugated PS agent, followed by the optimized PDT condition showed a statistically significant improvement in delaying tumor growth compared with animals who received the PDT with the nonconjugated PS agent. Conclusions: Response surface methodology appears to be a useful experimental approach for rapid testing of different treatment conditions and determination of optimal values of PDT factors for any PS agent.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

CSPlib: A performance portable parallel software toolkit for analyzing complex kinetic mechanisms

Computational singular perturbation (CSP) is a method to analyze dynamical systems. It targets the decoupling of fast and slow dynamics using an alternate linear expansion of the right-hand side of the governing equations based on eigenanalysis of the associated Jacobian matrix. This representation facilitates diagnostic analysis, detection and control of stiffness, and the development of simplified models. For this work, we have implemented CSP in a C++ open-source library CSPlib using the Kokkos parallel programming model to address portability across diverse heterogeneous computing platforms, i.e., multi/many-core CPUs and GPUs. We describe the CSPlib implementation and present its computational performance across different computing platforms using several test problems. Specifically, we test the CSPlib performance for a constant pressure ignition reactor model on different architectures, including IBM Power 9, Intel Xeon Skylake, and NVIDIA V100 GPU. The size of the chemical kinetic mechanism is varied in these tests. As expected, the Jacobian matrix evaluation, the eigensolution of the Jacobian matrix, and matrix inversion are the most expensive computational tasks. When considering the higher throughput characteristic of GPUs, GPUs performs better for small matrices with higher occupancy rate. CPUs gain more advantages from the higher performance of well-tuned and optimized linear algebra libraries such as OpenBLAS.

97 MATHEMATICS AND COMPUTING↗

A Clock Synchronization Strategy for Minimizing Clock Variance at Runtime in High-end Computing Environments

We present a new software-based clock synchronization scheme designed to provide high precision time agreement among distributed memory nodes. The technique is designed to minimize variance from a reference chimer during runtime and with minimal time-request latency. Our scheme permits initial unbounded variations in time and corrects both slow and fast chimers (clock skew). An implementation developed within the context of the MPI message passing interface is described and time coordination measurements are presented. Among our results, the mean time variance among a set of nodes improved from 20.0 milliseconds under standard Network Time Protocol (NTP) to 2.29 secs under our scheme.

clock synchronization↗

Optimizing branch re-wiring in a software instruction cache

A method includes a computer device receiving a branch instruction; the computer device managing two tables, where a first table relates to application blocks and a second table relates to available address slots; and the computer device calculating a target of the branch instruction using a branch-to-link register, the computer device optimizes re-wiring in a cache using the calculation and the managed two tables.

97 MATHEMATICS AND COMPUTING↗

SU-E-J-269: Tracking of Tumor Regression for Stage III Lung Cancer Using CBCT

Purpose: This study is to evaluate the tumor regression over the course of EBRT treatment and to determine the difference of tumor reduction for stage III lung squamous cell cancer (SCC) and adenocarcinoma using CBCT. Methods: Twenty three stage III lung cancer patients treated in our clinic who had daily cone beam CT (CBCT) were selected for this study (16 adenocarcinoma and 7 SCC cases). Patients received prescription dose in the range of 50Gy–71.4Gy (mean =60.3Gy, median =50Gy) at 1.8Gy or 2Gy per fraction. Treatments spanned over a minimum of five weeks. Initial mean volume of the gross tumor volume (GTV) was 123cc (range = 14.7cc–353.3cc). For this study, we choose six sets of CBCTs at an interval of one week, starting from the first fraction of treatment. Daily CBCTs from treatment linac computer were transferred to MIM Software version 6.0. An experienced physician contoured the primary GTV on each slices of the CBCT for these patients. Results: A consistent regression of the GTVs was observed in all patients, except in one patient (adeno case) where GTV did not change. Weekly volumetric reduction was in the range of 11.2%–16.6%. Maximum reductions were noticed in the first two weeks of the treatment cycle; mean overall (for adeno+SCC) reductions were 16.6%, 14.2% in week-1 and week-2, respectively. Mean reduction over five weeks of treatment was 49.8% (range = 0.1%–75.5%). Higher reduction was observed in SCC patients as compare to adenocarcinoma cases (54.9% vs. 47.6%); however, the difference was not statistically significant (p-value > 0.05). Conclusion: Large regression of tumors over the course of EBRT for stage III lung cancer patients was observed. Both SCC and adenocarcinoma responded well; overall reduction for SCC cases was higher. A future study is warranted for determining the co-relation between tumor volume reduction and treatment outcome.

60 APPLIED LIFE SCIENCES↗

Leveraging 3D CAD and Virtual Reality in Design of the Calcine Disposition Project - 20512

Fluor Idaho's Calcine Disposition Project (CDP) is leveraging the power of three-dimensional (3D) visualization, light detection and ranging (Lidar), and virtual reality to improve designs and worker safety. With the use of computer-aided design (CAD) modeling software, the CDP has created 3D models of the facility and systems to aid in the design, development, and operation of its retrieval and transfer system. This by itself is nothing new and has been done in industry for years. The CDP project however is taking this a few steps farther with the use of Lidar and virtual reality software. The CRP is tasked with removing a radioactive granular material from stainless steel bins located in concrete vaults that were constructed in the late 1950's and early 1960's. While construction drawings are available, it is not certain that the drawings are as-built or how accurate they truly are. Part of the project requires precise placement of equipment on to bins around multiple pipe, electrical lines, and bin stiffeners. Relying solely on the existing drawings and models created from these drawings is highly risky and prone to failure. The first step to determine the precise location and orientation of all obstructions in the vault the project will use a Lidar system to scan the vault structure and precisely locate all vault and bin components. Once this information is obtained, the data will be integrated into the CAD model. The model will then be verified, and a true as-built model developed. Precise component location, size, and orientation will be used for final design and placement of retrieval components. The second step will be to take the verified 3D model and scan data and import it into virtual reality software creating a virtual world. While some work on the project requires all work to be completed remotely due to high radiation fields, some areas have low enough radiation levels that personnel can enter and perform work. With the use of a virtual reality headset, operators and technicians will be able to enter our virtual world and become familiar with the surroundings and perform work prior to ever entering the radiation environment. This training is expected to pay dividends by improving worker efficiency, reducing errors, and improving confidence that the work can be performed as expected. It will play a key aspect in as low as reasonably achievable (ALARA) principles. An additional aspect in using the Lidar scans and virtual environment, is that it will give engineers and managers an opportunity to revisit the facility, especially radiation areas, at any time to obtain design information and measurements that may be costly or impossible to obtain once the facility transitions into radiation operations. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

TuckerMPI: A Parallel C++/MPI Software Package for Large-scale Data Compression via the Tucker Tensor Decomposition

With this study, our goal is compression of massive-scale grid-structured data, such as the multi-terabyte output of a high-fidelity computational simulation. For such data sets, we have developed a new software package called TuckerMPI, a parallel C++/MPI software package for compressing distributed data. The approach is based on treating the data as a tensor, i.e., a multidimensional array, and computing its truncated Tucker decomposition, a higher-order analogue to the truncated singular value decomposition of a matrix. The result is a low-rank approximation of the original tensor-structured data. Compression efficiency is achieved by detecting latent global structure within the data, which we contrast to most compression methods that are focused on local structure. In this work, we describe TuckerMPI, our implementation of the truncated Tucker decomposition, including details of the data distribution and in-memory layouts, the parallel and serial implementations of the key kernels, and analysis of the storage, communication, and computational costs. We test the software on 4.5 and 6.7 terabyte data sets distributed across 100 s of nodes (1,000 s of MPI processes), achieving compression ratios between 100 and 200,000×, which equates to 99--99.999% compression (depending on the desired accuracy) in substantially less time than it would take to even read the same dataset from a parallel file system. Moreover, we show that our method also allows for reconstruction of partial or down-sampled data on a single node, without a parallel computer so long as the reconstructed portion is small enough to fit on a single machine, e.g., in the instance of reconstructing/visualizing a single down-sampled time step or computing summary statistics. The code is available at https://gitlab.com/tensors/TuckerMPI.

97 MATHEMATICS AND COMPUTING↗

Center for Center for Technology for Advanced Scientific Component Software (TASCS)

A resounding success of the Scientific Discovery through Advanced Computing (SciDAC) program is that high-performance computational science is now universally recognized as a critical aspect of scientific discovery [71], complementing both theoretical and experimental research. As scientific communities prepare to exploit unprecedented computing capabilities of emerging leadership-class machines for multi-model simulations at the extreme scale [72], it is more important than ever to address the technical and social challenges of geographically distributed teams that combine expertise in domain science, applied mathematics, and computer science to build robust and flexible codes that can incorporate changes over time. The Center for Technology for Advanced Scientific Component Software (TASCS)1 tackles these these issues by exploiting component-based software development to facilitate collaborative high-performance scientific computing.

97 MATHEMATICS AND COMPUTING↗