Search NASA⌕ Search

SEARCH · Search NASA

Results for “Memory tool”

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 523 records · Page 29

SPPTOOLS: Programming tools for the IRAF SPP language

An IRAF package to assist in SPP code development and debugging is described. SPP is the machine-independent programming language used by virtually all IRAF tasks. Tools have been written to aide both novice and advanced SPP programmers with development and debugging by providing tasks to check the code for the number and type of arguments in all calls to IRAF VOS library procedures, list the calling sequences of IRAF tasks, create a database of identifiers for quick access, check for memory which is not freed, and a source code formatter. Debugging is simplified since the programmer is able to get a better understanding of the structure of his/her code, and IRAF library procedure calls (probably the most common source of errors) are automatically checked for correctness.

Fitzpatrick, M.↗

Automatic Generation of Directive-Based Parallel Programs for Shared Memory Parallel Systems

The shared-memory programming model is a very effective way to achieve parallelism on shared memory parallel computers. As great progress was made in hardware and software technologies, performance of parallel programs with compiler directives has demonstrated large improvement. The introduction of OpenMP directives, the industrial standard for shared-memory programming, has minimized the issue of portability. Due to its ease of programming and its good performance, the technique has become very popular. In this study, we have extended CAPTools, a computer-aided parallelization toolkit, to automatically generate directive-based, OpenMP, parallel programs. We outline techniques used in the implementation of the tool and present test results on the NAS parallel benchmarks and ARC3D, a CFD application. This work demonstrates the great potential of using computer-aided tools to quickly port parallel programs and also achieve good performance.

Jin, Hao-Qiang↗

Improvements, enhancements, and optimizations of COBRA-TF

The Reactor Dynamics and Fuel Management Group (RDFMG) at The Pennsylvania State University (PSU) has become active in the Consortium for Advanced Simulation of Light Water Reactors (CASL) program by delivering, supporting, and further developing CTF, the PSU version of the Coolant Boiling in Rod Arrays - Two Fluids (COBRA-TF) Thermal/Hydraulic (T/H), sub-channel program. New development work on CTF was primarily geared towards decreasing the execution time of the code so that it may eventually be used for performing pin-by-pin, full-core simulations. Great gains have been made through targeting sections of source code for optimization. For example, wall clock time has been reduced for a one-assembly, three-dimensional model, containing {approx}9,400 mesh cells, from 9.2 min to 1 min. A further improvement has been reduction in code memory usage, which was previously prohibitive for large models. In conjunction with the run time speedups, this has enabled the simulation of a refined quarter-core model ({approx}460,000 mesh cells), which saw a reduction in memory usage from over 130 GB to less than 3 GB. In addition to the optimization work, RDFMG has also created a preprocessor utility for the fast and less error-prone generation of CTF input decks. Furthermore, basic post-processing capabilities have been implemented by creating a CTF subroutine for producing Visualization Tool-Kit (VTK) files that output mesh data and associated simulation results. These VTK files can be opened with visualization software. (authors)

97 MATHEMATICS AND COMPUTING↗

SMAnalytics Automated Shape Memory Test Analysis Software User's Manual: UCFTC, UPER, and DSC Test Methods, Version 1.0.2

Over the course of 60 years of shape memory alloy research and development, the properties of these alloys have been measured using various testing methods, which are often customized by the organization performing the test. However, commercial adoption of shape memory alloys in aeronautic actuator applications requires reducing property uncertainty through standardizing test methods. Historically, differential scanning calorimetry (DSC) has been used to measure transformation temperatures under stress-free conditions. This testing method is well established, and tests are run under the applicable standard, ASTM F2004-17: Standard Test Method for Transformation Temperature of Nickel-Titanium Alloys by Thermal Analysis. Two other test methods for measuring strains and transformation temperatures under constant load or free recovery after prestraining have only recently been standardized—ASTM E3097: Standard Test Method for Mechanical Uniaxial Constant Force Thermal Cycling of SMAs (UCFTC) and ASTM E3098: Standard Test Method for Mechanical Uniaxial Pre-Strain and Thermal Free Recovery of SMAs (UPFR). These standards represent a critical step forward in producing reliable material property data for the use of these alloys in aeronautics and other commercial areas. However, no standard programs or software packages were previously available for postprocessing UCFTC- and UPFR-type test data to extract property data. Each organization that performed the testing analyzed data using its own custom manual methods, such as using a plot and a straight edge, spreadsheet plotting methods, or custom code routines, to extract the required values for strains, stresses, and transformation temperatures. SMAnalytics represents the first publicly available uniform software package for processing data generated using the DSC, UCFTC, and UPFR test methods, as well as many modifications of these methods, including loading in martensite versus austenite and performing multiple thermal cycles at stress. In doing so, it provides a tool for reducing potential error or variability in the measured values due to the precision of the technique used and person-to-person variability. It is also expected that this automated data-parsing tool can accelerate the data analysis phase of the test campaign, especially for large data files. This User’s Manual describes how the SMAnalytics software works and the method for its use.

Shape Memory Alloy↗

Predictive Engineering Tools for Injection-molded Long-Carbon-Fiber Thermoplastic Composites - FY 2014 Third Quarterly Report

This report describes the technical progresses made during the third quarter of FY 2014: 1) Autodesk introduced the options for fiber inlet condition to the 3D solver. These options are already available in the mid-plane/dual domain solver. 2) Autodesk improved the accuracy of 3D fiber orientation calculation around the gate. 3) Autodesk received consultant services from Prof. C.L. Tucker at the University of Illinois on the implementation of the reduced order model for fiber length, and discussed with Prof. Tucker the methods to reduce memory usage. 4) PlastiComp delivered to PNNL center-gated and edge-fan-gated 20-wt% to 30-wt% LCF/PP and LCF/PA66 (7”x7”x1/8”) plaques molded by the in-line direct injection molding (D-LFT) process. 5) PlastiComp molded ASTM tensile, flexural and impact bars under the same D-LFT processing conditions used for plaques for Certification of Assessment and ascertaining the resultant mechanical properties. 6) Purdue developed a new polishing routine, utilizing the automated polishing machine, to reduce fiber damage during surface preparation. 7) Purdue used a marker-based watershed segmentation routine, in conjunction with a hysteresis thresholding technique, for fiber segmentation during fiber orientation measurement. 8) Purdue validated Purdue’s fiber orientation measurement method using the previous fiber orientation data obtained from the Leeds machine and manually measured data by the University of Illinois. 9) PNNL conducted ASMI mid-plane analyses for a 30wt% LCF/PP plaque and compared the predicted fiber orientations with the measured data provided by Purdue University at the selected locations on this plaque. 10) PNNL put together the DOE 2014 Annual Merit Review (AMR) presentation with the team and presented it at the AMR meetings on June 17, 2014. 11) PNNL built ASMI dual domain models for the Toyota complex part and commenced mold filling analyses of the complex part with different wall thicknesses in order to support part molding. 12) Toyota and Magna discussed with PNNL on tool modification for molding the complex part. Toyota sent the CAD files of the complex part to PNNL to build ASMI models of the part for mold filling analysis to provide guidance to tooling and part molding.

Injection molding, long-fiber thermoplastic, carbo↗

Conditional channel simulation

In this work we design a specific simulation tool for quantum channels which is based on the use of a control system. This allows us to simulate an average quantum channel which is expressed in terms of an ensemble of channels, even when these channel-components are not jointly teleportation-covariant. This design is also extended to asymptotic simulations, continuous ensembles, and memory channels. As an application, we derive relative-entropy-of-entanglement upper bounds for private communication over various channels, including non-Gaussian mixtures of bosonic lossy channels. Among other results, we also establish the two-way quantum and private capacity of the so-called “dephrasure” channel.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Coherences of Photoinduced Electron Spin Qubit Pair States in Photosystem I

Here, this publication presents the first comprehensive experimental study of electron spin coherences in photosynthetic reaction center proteins, specifically focusing on photosystem I (PSI). The ultrafast electron transfer in PSI generates spin-correlated radical pairs (SCRPs), which are entangled spin pairs formed in well-defined spin states (Bell states). Since their discovery in our group in the 1980s, SCRPs have been extensively used to enhance our understanding of structure–function relationships in photosynthetic proteins. More recently, SCRPs have been utilized as tools for quantum sensing. Electron spin decoherence poses a significant challenge in realizing practical applications of electron spin qubits, particularly the creation of quantum entanglement between multiple electron spins. This work is focused on the systematic characterization of decoherence in SCRPs of PSI. These decoherence times were measured as electron spin echo decay times, termed phase memory times (T M ), at various temperatures. Decoherence was recorded on both transient SCRP states P 700 + A 1 – and thermalized states. Our study reveals that T M exhibits minimal dependence on the biological species, biochemical treatment, and paramagnetic species. The analysis indicates that nuclear spin diffusion and instantaneous diffusion mechanisms alone cannot explain the observed decoherence. As a plausible explanation we discuss the assumption that the low-temperature dynamics of methyl groups in the protein surrounding the unpaired electron spin centers is the main factor governing the loss of the spin coherence in PSI.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimizing the Weather Research and Forecasting Model with OpenMP Offload and Codee

Currently, the Weather Research and Forecasting model (WRF) utilizes shared memory (OpenMP) and distributed memory (MPI) parallelisms. To take advantage of GPU resources on the Perlmutter supercomputer at NERSC, we port parts of the computationally expensive routine Fast Spectral Bin Microphysics (FSBM) to NVIDIA GPUs using OpenMP device offloading directives. To facilitate this process, we explore a workflow for optimization which uses both runtime profilers and a static code inspection tool Codee to refactor the subroutine. We observe an 2.24x overall speedup for the CONUS-12km storm test case.

Wichitrnithed, Chayanon (Namo) [Odin Institute]↗

Compressed basis GMRES on high-performance graphics processing units

Krylov methods provide a fast and highly parallel numerical tool for the iterative solution of many large-scale sparse linear systems. To a large extent, the performance of practical realizations of these methods is constrained by the communication bandwidth in current computer architectures, motivating the investigation of sophisticated techniques to avoid, reduce, and/or hide the message-passing costs (in distributed platforms) and the memory accesses (in all architectures). This article leverages Ginkgo’s memory accessor in order to integrate a communication-reduction strategy into the (Krylov) GMRES solver that decouples the storage format (i.e., the data representation in memory) of the orthogonal basis from the arithmetic precision that is employed during the operations with that basis. Given that the execution time of the GMRES solver is largely determined by the memory accesses, the cost of the datatype transforms can be mostly hidden, resulting in the acceleration of the iterative step via a decrease in the volume of bits being retrieved from memory. Together with the special properties of the orthonormal basis (whose elements are all bounded by 1), this paves the road toward the aggressive customization of the storage format, which includes some floating-point as well as fixed-point formats with mild impact on the convergence of the iterative process. We develop a high-performance implementation of the “compressed basis GMRES” solver in the Ginkgo sparse linear algebra library using a large set of test problems from the SuiteSparse Matrix Collection. We demonstrate robustness and performance advantages on a modern NVIDIA V100 graphics processing unit (GPU) of up to 50% over the standard GMRES solver that stores all data in IEEE double-precision.

97 MATHEMATICS AND COMPUTING↗

Distributed Data-Flow for In-Situ Visualization and Analysis at Petascale

We conducted a feasibility study to research modifications to data-flow architectures to enable data-flow to be distributed across multiple machines automatically. Distributed data-flow is a crucial technology to ensure that tools like the VisIt visualization application can provide in-situ data analysis and post-processing for simulations on peta-scale machines. We modified a version of VisIt to study load-balancing trade-offs between light-weight kernel compute environments and dedicated post-processing cluster nodes. Our research focused on memory overheads for contouring operations, which involves variable amounts of generated geometry on each node and computation of normal vectors for all generated vertices. Each compute node independently decided whether to send data to dedicated post-processing nodes at each stage of pipeline execution, depending on available memory. We instrumented the code to allow user settable available memory amounts to test extremely low-overhead compute environments. We performed initial testing of this prototype distributed streaming framework, but did not have time to perform scaling studies at and beyond 1000 compute-nodes.

97 MATHEMATICS AND COMPUTING↗

Scalable Analysis Methods and In Situ Infrastructure for Extreme Scale Knowledge Discovery

The primary challenge motivating this team’s work is the widening gap between the ability to compute information and to store it for subsequent analysis. This gap adversely impacts science code teams, who are able to perform analysis only on a small fraction of the data they compute, resulting in the very real likelihood of lost or missed science, when results are computed but not analyzed. Our approach is to perform as much analysis or visualization processing on data while it is still resident in memory, an approach that is known as in situ processing. The idea in situ processing was not new at the time of the start of this effort in 2014, but efforts in that space were largely ad hoc, and there was no concerted effort within the research community that aimed to foster production-quality software tools suitable for use by DOE science projects. In large, our objective was produce and enable use of production-quality in situ methods and infrastructure, at scale, on DOE HPC facilities, though we expected to have impact beyond DOE due to the widespread nature of the challenges, which affect virtually all large-scale computational science efforts. To achieve that objective, we assembled a unique team of researchers consisting of representatives from DOE national laboratories, academia, and industry, and engaged in software technology R&D, as well as engaged in close partnerships with DOE science code teams, to produce software technologies that were shown to run effectively at scale on DOE HPC platforms.

97 MATHEMATICS AND COMPUTING↗

Post Moore's Law Report

Moore's law is driving an information revolution, worldwide economic growth, and is a tool for national security. This report explains how dire proclamations that "Moore's law is ending" are due to a natural redefinition of the phrase, but computing remains positioned to both drive economic growth and support national security. The computer industry used to be led by the semiconductor companies that made ever faster microprocessors with larger memories. However, control is shifting to new ways of designing computers, notably based on 3D chips and new analog and digital architectures. While artificial intelligence and quantum computing research have become mainstream pursuits, these latter two areas seem destined split off from Moore's law rather than become a part of it. We include a discussion of recent developments and opportunities in optical communications and computing.

97 MATHEMATICS AND COMPUTING↗

Design knowledge capture for a corporate memory facility

Currently, much of the information regarding decision alternatives and trade-offs made in the course of a major program development effort is not represented or retained in a way that permits computer-based reasoning over the life cycle of the program. The loss of this information results in problems in tracing design alternatives to requirements, in assessing the impact of change in requirements, and in configuration management. To address these problems, the problem was studied of building an intelligent, active corporate memory facility which would provide for the capture of the requirements and standards of a program, analyze the design alternatives and trade-offs made over the program's lifetime, and examine relationships between requirements and design trade-offs. Early phases of the work have concentrated on design knowledge capture for the Space Station Freedom. Tools are demonstrated and extended which helps automate and document engineering trade studies, and another tool is being developed to help designers interactively explore design alternatives and constraints.

Boose, John H.↗

Preconditioned implicit solvers for the Navier-Stokes equations on distributed-memory machines

The GMRES method is parallelized, and combined with local preconditioning to construct an implicit parallel solver to obtain steady-state solutions for the Navier-Stokes equations of fluid flow on distributed-memory machines. The new implicit parallel solver is designed to preserve the convergence rate of the equivalent 'serial' solver. A static domain-decomposition is used to partition the computational domain amongst the available processing nodes of the parallel machine. The SPMD (Single-Program Multiple-Data) programming model is combined with message-passing tools to develop the parallel code on a 32-node Intel Hypercube and a 512-node Intel Delta machine. The implicit parallel solver is validated for internal and external flow problems, and is found to compare identically with flow solutions obtained on a Cray Y-MP/8. A peak computational speed of 2300 MFlops/sec has been achieved on 512 nodes of the Intel Delta machine,k for a problem size of 1024 K equations (256 K grid points).

Ajmani, Kumud↗

A Partitioned - Task Parallel Implementation of the NASA Multiscale Analysis Tool for High Performance Computing

The NASA Multiscale Analysis Tool (NASMAT) is a platform for multiscale modeling of composites which can perform analysis of materials with any arbitrary number of length scales. The platform supports modularity, scalability, and interoperability using recursive procedures and data structures. A Macro solver driven parallelization scheme often limits the capability of NASMAT to scale as it has access to limited memory and number of cores (often one core/thread) and often forces to implement macro solver specific changes to the platform. In this work, a partitioned task-parallel approach is adopted, where the parallelization strategy adopted for NASMAT is independent of the macro solver and the computational resources are managed independently. The programming architecture takes into account the hierarchy of multiple scales (task-dependence) and the heterogeneous nature (dynamic load balancing) of computation through implementation of a hierarchy-informed task parallel model. The partitioned nature of the framework further extends the “plug and play” capability of NASMAT. preCICE, an open-source library for coupling multiphysics solver in a partitioned manner, is adopted to integrate NASMAT with an external macro solver by implementing a NASMAT adapter for preCICE. Speedup and scalability of the framework is studied for micromechanical models of varying size.

task-parallel↗

Runtime Detection of C-Style Errors in UPC Code

Unified Parallel C (UPC) extends the C programming language (ISO C 99) with explicit parallel programming support for the partitioned global address space (PGAS), which provides a global memory space with localized partitions to each thread. Like its ancestor C, UPC is a low-level language that emphasizes code efficiency over safety. The absence of dynamic (and static) safety checks allows programmer oversights and software flaws that can be hard to spot. In this paper, we present an extension of a dynamic analysis tool, ROSE-Code Instrumentation and Runtime Monitor (ROSECIRM), for UPC to help programmers find C-style errors involving the global address space. Built on top of the ROSE source-to-source compiler infrastructure, the tool instruments source files with code that monitors operations and keeps track of changes to the system state. The resulting code is linked to a runtime monitor that observes the program execution and finds software defects. We describe the extensions to ROSE-CIRM that were necessary to support UPC. We discuss complications that arise from parallel code and our solutions. We test ROSE-CIRM against a runtime error detection test suite, and present performance results obtained from running error-free codes. ROSE-CIRM is released as part of the ROSE compiler under a BSD-style open source license.

97 MATHEMATICS AND COMPUTING↗

Simulation at Extreme-Scale: Co-Design Thinking and Practices

The current trend of computer architecture evolving towards exaflop/s is the fast increasing floating point performance (the so-called “free” flops) accompanied by much slowly improving the bandwidth of memory and network. Numerical simulation would undergo the challenge posed by the unbalanced increase in the compute power and the capability of data movement. In this paper, after reviewing the challenges of hardware and software in moving towards exascale computing, we present co-design thinking for selecting, optimizing, and developing a numerical algorithm and a simulation tool to meet the challenge of simulation at extreme scale. Examples are presented to demonstrate the new way of thinking and its effectiveness on the emerging architecture.

Computer Science↗

Accelerating Real-Time String Searching with Multicore Processors

String searching is at the core of tools used to search, filter, and protect data, but this has become increasingly difficult to do in real time as communication speed grows. The authors present an optimization strategy for a popular algorithm that fully exploits the IBM Cell Broadband Engine architecture to perform exact string matching against large dictionaries and also offer various solutions to alleviate memory congestion.

97 MATHEMATICS AND COMPUTING↗