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 217 records · Page 12

Electron-beam-induced-current and active secondary-electron voltage-contrast with aberration-corrected electron probes

The ability to map out electrostatic potentials in materials is critical for the development and the design of nanoscale electronic and spintronic devices in modern industry. Electron holography has been an important tool for revealing electric and magnetic field distributions in microelectronics and magnetic-based memory devices, however, its utility is hindered by several practical constraints, such as charging artifacts and limitations in sensitivity and in field of view. In this article, we report electron-beam-induced-current (EBIC) and secondary-electron voltage-contrast (SE-VC) with an aberration-corrected electron probe in a transmission electron microscope (TEM), as complementary techniques to electron holography, to measure electric fields and surface potentials, respectively. These two techniques were applied to ferroelectric thin films, multiferroic nanowires, and single crystals. Electrostatic potential maps obtained by off-axis electron holography were compared with EBIC and SE-VC to show that these techniques can be used as a complementary approach to validate quantitative results obtained from electron holography analysis.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Brain Modulyzer: Interactive Visual Analysis of Functional Brain Connectivity

Here, we present Brain Modulyzer, an interactive visual exploration tool for functional magnetic resonance imaging (fMRI) brain scans, aimed at analyzing the correlation between different brain regions when resting or when performing mental tasks. Brain Modulyzer combines multiple coordinated views—such as heat maps, node link diagrams, and anatomical views—using brushing and linking to provide an anatomical context for brain connectivity data. Integrating methods from graph theory and analysis, e.g., community detection and derived graph measures, makes it possible to explore the modular and hierarchical organization of functional brain networks. Providing immediate feedback by displaying analysis results instantaneously while changing parameters gives neuroscientists a powerful means to comprehend complex brain structure more effectively and efficiently and supports forming hypotheses that can then be validated via statistical analysis. In order to demonstrate the utility of our tool, we also present two case studies—exploring progressive supranuclear palsy, as well as memory encoding and retrieval

59 BASIC BIOLOGICAL SCIENCES↗

Performance Measurement, Visualization and Modeling of Parallel and Distributed Programs

This paper presents a methodology for debugging the performance of message-passing programs on both tightly coupled and loosely coupled distributed-memory machines. The AIMS (Automated Instrumentation and Monitoring System) toolkit, a suite of software tools for measurement and analysis of performance, is introduced and its application illustrated using several benchmark programs drawn from the field of computational fluid dynamics. AIMS includes (i) Xinstrument, a powerful source-code instrumentor, which supports both Fortran77 and C as well as a number of different message-passing libraries including Intel's NX Thinking Machines' CMMD, and PVM; (ii) Monitor, a library of timestamping and trace -collection routines that run on supercomputers (such as Intel's iPSC/860, Delta, and Paragon and Thinking Machines' CM5) as well as on networks of workstations (including Convex Cluster and SparcStations connected by a LAN); (iii) Visualization Kernel, a trace-animation facility that supports source-code clickback, simultaneous visualization of computation and communication patterns, as well as analysis of data movements; (iv) Statistics Kernel, an advanced profiling facility, that associates a variety of performance data with various syntactic components of a parallel program; (v) Index Kernel, a diagnostic tool that helps pinpoint performance bottlenecks through the use of abstract indices; (vi) Modeling Kernel, a facility for automated modeling of message-passing programs that supports both simulation -based and analytical approaches to performance prediction and scalability analysis; (vii) Intrusion Compensator, a utility for recovering true performance from observed performance by removing the overheads of monitoring and their effects on the communication pattern of the program; and (viii) Compatibility Tools, that convert AIMS-generated traces into formats used by other performance-visualization tools, such as ParaGraph, Pablo, and certain AVS/Explorer modules.

Yan, Jerry C.↗

Global Arrays

Global Arrays (GA) is a distributed-memory programming model that allows for shared-memory-style programming combined with one-sided communication, to create a set of tools that combine high performance with ease-of-use. GA exposes a relatively straightforward programming abstraction, while supporting fully-distributed data structures, locality of reference, and high-performance communication. GA was originally formulated in the early 1990’s to provide a communication layer for the Northwest Chemistry (NWChem) suite of chemistry modeling codes that was being developed concurrently.

global arrays↗

In-situ high resolution transmission electron microscopy observation of silicon nanocrystal nucleation in a SiO{sub 2} bilayered matrix

Solid-state nucleation of Si nanocrystals in a SiO{sub 2} bilayered matrix was observed at temperatures as low as 450 °C. This was achieved by aberration corrected high-resolution transmission electron microscopy (HRTEM) with real-time in-situ heating up to 600 °C. This technique is a valuable characterization tool especially with the recent interest in Si nanostructures for light emitting devices, non-volatile memories, and third-generation photovoltaics which all typically require a heating step in their fabrication. The control of size, shape, and distribution of the Si nanocrystals are critical for these applications. This experimental study involves in-situ observation of the nucleation of Si nanocrystals in a SiO{sub 2} bilayered matrix fabricated through radio frequency co-sputtering. The results show that the shapes of Si nanocrystals in amorphous SiO{sub 2} bilayered matrices are irregular and not spherical, in contrast to many claims in the literature. Furthermore, the Si nanocrystals are well confined within their layers by the amorphous SiO{sub 2}. This study demonstrates the potential of in-situ HRTEM as a tool to observe the real time nucleation of Si nanocrystals in a SiO{sub 2} bilayered matrix. Furthermore, ideas for improvements on this in-situ heating HRTEM technique are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Programming Model Performance Study Using the NAS Parallel Benchmarks

Harnessing the power of multicore platforms is challenging due to the additional levels of parallelism present. In this paper we use the NAS Parallel Benchmarks to study three programming models, MPI, OpenMP and PGAS to understand their performance and memory usage characteristics on current multicore architectures. To understand these characteristics we use the Integrated Performance Monitoring tool and other ways to measure communication versus computation time, as well as the fraction of the run time spent in OpenMP. The benchmarks are run on two different Cray XT5 systems and an Infiniband cluster. Our results show that in general the three programming models exhibit very similar performance characteristics. In a few cases, OpenMP is significantly faster because it explicitly avoids communication. For these particular cases, we were able to re-write the UPC versions and achieve equal performance to OpenMP. Using OpenMP was also the most advantageous in terms of memory usage. Also we compare performance differences between the two Cray systems, which have quad-core and hex-core processors. We show that at scale the performance is almost always slower on the hex-core system because of increased contention for network resources.

Shan, Hongzhang↗

A programming model performance study using the NAS parallel benchmarks

Harnessing the power of multicore platforms is challenging due to the additional levels of parallelism present. In this paper we use the NAS Parallel Benchmarks to study three programming models, MPI, OpenMP and PGAS to understand their performance and memory usage characteristics on current multicore architectures. To understand these characteristics we use the Integrated Performance Monitoring tool and other ways to measure communication versus computation time, as well as the fraction of the run time spent in OpenMP. The benchmarks are run on two different Cray XT5 systems and an Infiniband cluster. Our results show that in general the three programming models exhibit very similar performance characteristics. In a few cases, OpenMP is significantly faster because it explicitly avoids communication. For these particular cases, we were able to re-write the UPC versions and achieve equal performance to OpenMP. Using OpenMP was also the most advantageous in terms of memory usage. Also we compare performance differences between the two Cray systems, which have quad-core and hex-core processors.We show that at scale the performance is almost always slower on the hex-core system because of increased contention for network resources.

97 MATHEMATICS AND COMPUTING↗

PreDSLpmo: A neural network-based prediction tool for functional annotation of lytic polysaccharide monooxygenases

Lytic polysaccharide monooxygenases (LPMOs), a family of copper-dependent oxidative enzymes, boost the degradation of polysaccharides such as cellulose, chitin, and others. While experimental methods are used to validate LPMO function, a computational method that can aid experimental methods and provide fast and accurate classification of sequences into LPMOs and its families would be an important step towards understanding the breadth of contributions these enzymes make in deconstruction of recalcitrant polysaccharides. In this study, we developed a machine learning-based tool called PreDSLpmo that employs two different approaches to functionally classify protein sequences into the major LPMO families (AA9 and AA10). The first approach uses a traditional neural network or multilayer percerptron-based approach, while the second employs bi-directional long short-term memory for sequence classification. Finally, our method shows improvement in predictive power when compared with dbCAN2, an existing HMM-profile-based CAZyme predicting tool, on both validation and independent benchmark set.

59 BASIC BIOLOGICAL SCIENCES↗

TopoMS: Comprehensive topological exploration for molecular and condensed-matter systems

We introduce TopoMS, a computational tool enabling detailed topological analysis of molecular and condensed-matter systems, including the computation of atomic volumes and charges through the quantum theory of atoms in molecules, as well as the complete molecular graph. With roots in techniques from computational topology, and using a shared-memory parallel approach, TopoMS provides scalable, numerically robust, and topologically consistent analysis. TopoMS can be used as a command-line tool or with a GUI (graphical user interface), where the latter also enables an interactive exploration of the molecular graph. This paper presents algorithmic details of TopoMS and compares it with state-of-the-art tools: Bader charge analysis v1.0 (Arnaldsson et al., 01/11/17) and molecular graph extraction using Critic2 (Otero-de-la-Roza et al., Comput. Phys. Commun. 2014, 185, 1007). TopoMS not only combines the functionality of these individual codes but also demonstrates up to 4× performance gain on a standard laptop, faster convergence to fine-grid solution, robustness against lattice bias, and topological consistency. TopoMS is released publicly under BSD License.

97 MATHEMATICS AND COMPUTING↗

Ballistic rectification of vortex domain wall chirality at nanowire corners

The interactions of vortex domain walls with corners in planar magnetic nanowires are probed using magnetic soft X-ray transmission microscopy. Here,we show that when the domain walls are propagated into sharp corners using applied magnetic fields above a critical value, their chiralities are rectified to either clockwise or anticlockwise circulation depending on whether the corners turn left or right. Single-shot focused magneto-optic Kerr effect measurements are then used to demonstrate how, when combined with modes of domain propagation that conserve vortex chirality, this allows us to dramatically reduce the stochasticity of domain pinning at artificial defect sites. In conclusion, our results provide a tool for controlling domain wall chirality and pinning behavior both in further experimental studies and in future domain wall-based memory, logic and sensor technologies.

36 MATERIALS SCIENCE↗

Seeing the Invisible: Embedding Tests in Code That Cannot be Modified

The difficulty of characterizing and observing valid software behavior during testing can be very difficult in flight systems. To address this issue, we evaluated several approaches to increasing test observability on the Shuttle Abort Flight Management (SAFM) system. To increase test observability, we added probes into the running system to evaluate the internal state and analyze test data. To minimize the impact of the instrumentation and reduce manual effort, we used Aspect-Oriented Programming (AOP) tools to instrument the source code. We developed and elicited a spectrum of properties, from generic to application specific properties, to be monitored via the instrumentation. To evaluate additional approaches, SAFM was ported to Linux, enabling the use of gcov for measuring test coverage, Valgrind for looking for memory usage errors, and libraries for finding non-normal floating point values. An in-house C++ source code scanning tool was also used to identify violations of SAFM coding standards, and other potentially problematic C++ constructs. Using these approaches with the existing test data sets, we were able to verify several important properties, confirm several problems and identify some previously unidentified issues.

O'Malley, Owen↗

Distributed Louvain Algorithm for Graph Community Detection

In most real-world networks, the nodes/vertices tend to be organized into tightly-knit modules known as communities or clusters, such that nodes within a community are more likely to be “related” to one another than they are to the rest of the network. The goodness of partitioning into communities is typically measured using a well known measure called modularity. However, modularity optimization is an NP-complete problem. In 2008, Blondel, et al. introduced a multi-phase, iterative heuristic for modularity optimization, called the Louvain method. Owing to its speed and ability to yield high quality communities, the Louvain method continues to be one of the most widely used tools for serial community detection. In this paper, we present the design of a distributed memory implementation of the Louvain algorithm for parallel community detection. Our approach begins with an arbitrarily partitioned distributed graph input, and employs several heuristics to speedup the computation of the different steps of the Louvain algorithm. We evaluate our implementation and its different variants using real-world networks from various application domains (including internet, biology, social networks). Our MPI+OpenMP implementation yields about 7x speedup (on 4K processes) for soc-friendster network (1.8B edges) over a state-of-the-art shared-memory multicore implementation (on 64 threads), without compromising output quality. Furthermore, our distributed implementation was able to process a larger graph (uk-2007; 3.3B edges) in 32 seconds on 1K cores (64 nodes) of NERSC Cori, when the state-of-the-art shared-memory implementation failed to run due to insufficient memory on a single Cori node containing 128 GB.

High performance computing, graph algorithms, Dist↗

Archer

Archer is a data race detector for OpenMP programs. Archer combines static and dynamic techniques to identify data races in large OpenMP applications, leading to low runtime and memory overheads, while still offering high accuracy and precision. It builds on open-source tools infrastructure such as LLVM, ThreadSanitizer, and OMPT to provide portability.

Lee, GregoryL.↗

Next generation VLSI tools

This paper focuses on what features would be useful in VLSI Computer Aided Design Tools and Systems to be used in the next five to ten years. Examples of current design tasks will be used to emphasize the areas where new or expanded VLSI CAD tools are needed. To provide a basis for projecting the future of VLSI tools, a brief history of the evolution of VLSI design software and hardware platforms is presented. The role of design methodology is considered with respect to the anticipated scale of future VLSI design projects. Future requirements of design verification and manufacturing testing are projected based on the challenge of surviving in a competitive market. Examples of VLSI tools reflect the author's involvement on VLSI design teams developing integrated circuits for disk memory and other computer peripherals for the last eight years.

Gibson, J.↗

A Systems Architecting Methodology Using Bloom’s Taxonomy to Promote Creative Engineering Synthesis

Architecting complex systems requires high-level cognitive processing and extensive knowledge of the system elements, functions, relationships, and constraints. This paper describes a systems architecting methodology implemented through cognitive psychological creative processes using Bloom’s taxonomy as a framework to generate the expert knowledge required to effectively and systematically synthesize new systems. Systems architecting activities were carried out to identify, develop, and capture factual and conceptual knowledge relevant to the system subject matter and functional elements, as well as to facilitate active processing of the knowledge through remembering, understanding, applying, analyzing, evaluating, and creating. Dual channel and limited capacity principles of learning were incorporated into the format of the systems engineering tools developed to assist with information processing and retention. Meta-cognitive strategies associated with memory and creative idea generation were implemented into the methodology to effectively and efficiently develop system alternatives using the full collection of knowledge. Synthesis of an orbiting sample capture and orientation system architecture to enable spacecraft-based on orbit capture of a Mars sample container for a potential Mars Sample Return campaign was used as a case study.

Adajian, Rama↗

Methodology for fast detection of false sharing in threaded scientific codes

A profiling tool identifies a code region with a false sharing potential. A static analysis tool classifies variables and arrays in the identified code region. A mapping detection library correlates memory access instructions in the identified code region with variables and arrays in the identified code region while a processor is running the identified code region. The mapping detection library identifies one or more instructions at risk, in the identified code region, which are subject to an analysis by a false sharing detection library. A false sharing detection library performs a run-time analysis of the one or more instructions at risk while the processor is re-running the identified code region. The false sharing detection library determines, based on the performed run-time analysis, whether two different portions of the cache memory line are accessed by the generated binary code.

97 MATHEMATICS AND COMPUTING↗

Planning and processing of new or upgraded electric transmission systems in New Mexico

RETA has been requested to identify and prioritize renewable energy resource zones in New Mexico that have a potential to support industry development among renewable energy developers for renewable resource generation projects. Moreover, Senate Memorial 44 requests that RETA identify and prioritize the best viable options for potential transmission corridors to accommodate renewable energy export from New Mexico in accordance with a defined time-line and to convene a working group to submit recommendations to the legislature for establishing a process to streamline procedures for establishing renewable energy transmission projects in New Mexico. RETA's July 9, 2009 request for comments outlined seven topical areas of specific value to Senate Memorial 44. This document addresses Topics 1, 3 and 4.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Parallel k-means Clustering of Geospatial Data Sets Using Manycore CPU Architectures

The increasing availability of high-resolution geospatiotemporal data sets from sources such as observatory networks, remote sensing platforms, and computational Earth system models has opened new possibilities for knowledge discovery and mining of weather, climate, ecological, and other geoscientific data sets fused from disparate sources. Many of the standard tools used on individual workstations are impractical for the analysis and synthesis of data sets of this size; however, new algorithmic approaches that can effectively utilize the complex memory hierarchies and the extremely high levels of parallelism available in state-of-the-art high-performance computing platforms can enable such analysis. Here, we describe pKluster, an open-source tool we have developed for accelerated k-means clustering of geospatial and geospatiotemporal data, and discuss algorithmic modifications and code optimizations we have made to enable it to effectively use parallel machines based on novel CPU architectures—such as the Intel “Knights Landing” Xeon Phi and Skylake Xeon processors—with many cores and hardware threads, and employing significant single instruction, multiple data (SIMD) parallelism. We outline some applications of the code in ecology and climate science contexts and present a detailed discussion of the performance of the code for one such application, LiDAR-derived vertical vegetation structure classification.

Mills, Richard T↗