Search NASA⌕ Search

SEARCH · Search NASA

Results for “Memory systems”

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 649 records · Page 36

Scaling molecular dynamics beyond 100,000 processor cores for large-scale biophysical simulations

The growing interest in the complexity of biological interactions is continuously driving the need to increase system size in biophysical simulations, requiring not only powerful and advanced hardware but adaptable software that can accommodate a large number of atoms interacting through complex force fields. To address this, we developed and implemented strategies in the GENESIS molecular dynamics package designed for large numbers of processors. Long–range electrostatic interactions were parallelized by minimizing the number of processes involved in communication. Here, a novel algorithm was implemented for nonbonded interactions to increase single instruction multiple data (SIMD) performance, reducing memory usage for ultra large systems. Memory usage for neighbor searches in real–space nonbonded interactions was reduced by approximately 80%, leading to significant speedup. Using experimental data describing physical 3D chromatin interactions, we constructed the first atomistic model of an entire gene locus (GATA4). Taken together, these developments enabled the first billion–atom simulation of an intact biomolecular complex, achieving scaling to 65,000 processes (130,000 processor cores) with 1 ns/day performance.

3D modeling↗

Scalable Memory Registration for High-Performance Networks Using Helper Threads

Remote DMA (RDMA) enables high performance networks to reduce data copying between an application and the operating system (OS). However RDMA operations in some high performance networks require communication memory explicitly registered with the network adapter and pinned by the OS. Memory registration and pinning limits the flexibility of the memory system and reduces the amount of memory that user processes can allocate. These issues become more significant on multicore platforms, since registered memory demand grows linearly with the number of processor cores. In this paper we propose a new memory registration/deregistration strategy to reduce registered memory on multicore architectures for HPC applications. We hide the cost of dynamic memory management by offloading all dynamic memory registration and deregistration requests to a dedicated memory management helper thread. We investigate design policies and performance implications of the helper thread approach. We evaluate our framework with the NAS parallel benchmarks, for which our registration scheme significantly reduces the registered memory (23.62% on average and up to 49.39%) and avoids memory registration/deregistration costs for reused communication memory. We show that our system enables the execution of problem sizes that could not complete under existing memory registration strategies.

99 GENERAL AND MISCELLANEOUS↗

On the memory attribution problem: A solution and case study using MPI

As parallel applications running on large–scale computing systems become increasingly memory constrained, the ability to attribute memory usage to the various components of the application is becoming increasingly important. We present the design and implementation of memnesia, a novel memory usage profiler for parallel and distributed message–passing applications. Our approach captures both application– and message–passing library–specific memory usage statistics from unmodified binaries dynamically linked to a message–passing communication library. Using microbenchmarks and proxy applications, we evaluated our profiler across three Message Passing Interface (MPI) implementations and two hardware platforms. Furthermore, the results show that our approach and the corresponding implementation can accurately quantify memory resource usage as a function of time, scale, communication workload, and software or hardware system architecture, clearly distinguishing between application and MPI library memory usage at a per–process level. With this new capability, we show that job size, communication workload, and hardware/software architecture influence peak runtime memory usage. In practice, this tool provides a potentially valuable source of information for application developers seeking to measure and optimize memory usage.

97 MATHEMATICS AND COMPUTING↗

System for simultaneously loading program to master computer memory devices and corresponding slave computer memory devices

A bus programmable slave module card for use in a computer control system is disclosed which comprises a master computer and one or more slave computer modules interfacing by means of a bus. Each slave module includes its own microprocessor, memory, and control program for acting as a single loop controller. The slave card includes a plurality of memory means (S1, S2...) corresponding to a like plurality of memory devices (C1, C2...) in the master computer, for each slave memory means its own communication lines connectable through the bus with memory communication lines of an associated memory device in the master computer, and a one-way electronic door which is switchable to either a closed condition or a one-way open condition. With the door closed, communication lines between master computer memory (C1, C2...) and slave memory (S1, S2...) are blocked. In the one-way open condition invention, the memory communication lines or each slave memory means (S1, S2...) connect with the memory communication lines of its associated memory device (C1, C2...) in the master computer, and the memory devices (C1, C2...) of the master computer and slave card are electrically parallel such that information seen by the master's memory is also seen by the slave's memory. The slave card is also connectable to a switch for electronically removing the slave microprocessor from the system. With the master computer and the slave card in programming mode relationship, and the slave microprocessor electronically removed from the system, loading a program in the memory devices (C1, C2...) of the master accomplishes a parallel loading into the memory devices (S1, S2...) of the slave.

Hall, William A.↗

Epoxy elastomers reinforced with functionalized multi-walled carbon nanotubes as stimuli-responsive shape memory materials

In this work, the incorporation of multiwalled carbon nanotubes (MWCNT) into epoxy-based elastomers was carried out in order to obtain nanocomposite systems with shape memory effect. For the preparation of elastomeric matrices, p-bis(2,3-epoxypropoxy)-α-methylstilbene (DOMS) was cured with sebacic acid. DOMS was synthesized in our laboratory and it is characterized by a rigid-rod, potentially liquid crystalline structure. A lightly cross-linked liquid crystalline elastomer was obtained. As for nanocomposites, variable amounts (0.75, 1.50, 3.0, 6.0, 12.0 wt.%) of COOH-MWCNTs were employed. In order to improve the nanotubes dispersibility and the interfacial adhesion with the epoxy matrix, an optimized two-step procedure was developed, which consisted in grafting the epoxy monomer onto the nanotube surface and then curing it in presence of crosslinking agent. DOMS-functionalized MWCNT were characterized through solvent dispersion experiments, FTIR spectroscopy and TGA analysis, which demonstrated the occurred covalent functionalization of the nanotubes with the epoxy monomers. The morphological analysis through electron microscopy demonstrated that this was an efficient strategy to improve the dispersion of nanotubes within the matrix. The second part of the work was devoted to the structural, thermal, mechanical and electric characterization of elastomeric nanocomposites. The results indicated a general improvement of properties of nanocomposites. Also, independently of the nanotube content, a smectic phase formed. Shape memory features of LC systems were also evaluated. It was demonstrated the shape could be recovered through heating, solvent immersion, as well as upon the application of an electrical field.

36 MATERIALS SCIENCE↗

Havens: Explicit Reliable Memory Regions for HPC Applications

Supporting error resilience in future exascale-class supercomputing systems is a critical challenge. Due to transistor scaling trends and increasing memory density, scientific simulations are expected to experience more interruptions caused by transient errors in the system memory. Existing hardware-based detection and recovery techniques will be inadequate to manage the presence of high memory fault rates. In this paper we propose a partial memory protection scheme based on region-based memory management. We define the concept of regions called havens that provide fault protection for program objects. We provide reliability for the regions through a software-based parity protection mechanism. Our approach enables critical program objects to be placed in these havens. The fault coverage provided by our approach is application agnostic, unlike algorithm-based fault tolerance techniques.

exascale computing↗

Malicious activity detection in a memory

A method and apparatus for monitoring a volatile memory in a computer system. Samples of compressed data from locations in the volatile memory in the computer system are read. Data in the volatile memory is reconstructed using the samples of compressed data. The data is an image of the volatile memory. The image enables determining whether an undesired process is present in the volatile memory.

Wheeler, Jason W.↗

Analog actuator-piston memory

Simple analog control system of digitally controlled acuator uses 'stopped' position of actuator as 'memory' and potentiometer as sensing element during power failure to reload drive circuit to value equal to its last position preceding power loss.

Sable, B. A.↗

Non-volatile memory for checkpoint storage

A system, method and computer program product for supporting system initiated checkpoints in high performance parallel computing systems and storing of checkpoint data to a non-volatile memory storage device. The system and method generates selective control signals to perform checkpointing of system related data in presence of messaging activity associated with a user application running at the node. The checkpointing is initiated by the system such that checkpoint data of a plurality of network nodes may be obtained even in the presence of user applications running on highly parallel computers that include ongoing user messaging activity. In one embodiment, the non-volatile memory is a pluggable flash memory card.

97 MATHEMATICS AND COMPUTING↗

Comparison of the NASCAP/GEO, POLAR, SEE Charging Handbook, and NASCAP-2K.1 Spacecraft Charging Codes

The NASA Charging Analyzer Program (NASCAP) spacecraft charging software developed by Maxwell Technologies has been widely used for the past fifteen to twenty years in satellite design and investigation of spacecraft charging related anomalies. Individual versions of the NASCAP software are available for use in low inclination, low Earth orbit environments (NASCAP[LEO) and geostationary orbit environments (NASCAP/GEO). In addition, the Potentials of Large objects in the Auroral Region (POLAR) code is available for use in LEO polar orbit environments. NASCAP/GEO and POLAR were both written in the 1980's using algorithms appropriate for the computers of the time. They solve the Poisson-Vlasov system for currents and densities assuming limited speed and memory of computer systems standard for the day. In addition, use of the charging models requires individual input files that are not readily transported into the various codes to facilitate comparison of results by the user.

Neergaard, Linda E.↗

JTAG-based PLC memory acquisition framework for industrial control systems

In industrial control systems (ICS), programmable logic controllers (PLC) are the embedded devices that directly control and monitor critical industrial infrastructure processes such as nuclear plants and power grid stations. Cyberattacks often target PLCs to sabotage a physical process. A memory forensic analysis of a suspect PLC can answer questions about an attack, including compromised firmware and manipulation of PLC control logic code and I/O devices. Given physical access to a PLC, collecting forensic information from the PLC memory at the hardware-level is risky and challenging. It may cause the PLC to crash or hang since PLCs have proprietary, legacy hardware with heterogeneous architecture. This paper addresses this research problem and proposes a novel JTAG (Joint Test Action Group)-based framework, Kyros, for reliable PLC memory acquisition. Kyros systematically creates a JTAG profile of a PLC through hardware assessment, JTAG pins identification, memory map creation, and optimizing acquisition parameters. It also facilitates the community of interest (such as ICS owners, operators, and vendors) to develop the JTAG profiles of PLCs. Further, we present a case study of Kyros implementation over Allen-Bradley 1756-A10/B to help understand the framework's application on a real-world PLC used in industry settings. The sample PLC memory dumps are shared with the research community to facilitate further research.

Rais, Muhammad Haris↗

Processing-in-Memory Enabled Graphics Processors for 3D Rendering

The performance of 3D rendering of Graphics Processing Unit that convents 3D vector stream into 2D frame with 3D image effects significantly impact users’ gaming experience on modern computer systems. Due to the high texture throughput in 3D rendering, main memory bandwidth becomes a critical obstacle for improving the overall rendering performance. 3D stacked memory systems such as Hybrid Memory Cube (HMC) provide opportunities to significantly overcome the memory wall by directly connecting logic controllers to DRAM dies. Based on the observation that texel fetches significantly impact off-chip memory traffic, we propose two architectural designs to enable Processing-In-Memory based GPU for efficient 3D rendering.

Innovative hardware/software co-design↗

Final Project Report: Data Locality Enhancement of Dynamic Simulations for Exascale Computing

The goal of this project is to develop a set of techniques and software tools to enhance the matching between memory accesses in dynamic simulations and the prominent features of modern and future manycore systems, alleviating the memory performance issues for exascale computing. In the first three years, the PI and his group have achieves some significant progress towards the goal, producing a set of novel techniques for improving the memory performance and data locality in manycore systems, yielding 18 conference and workshop papers and 4 journal papers and graduating 6 Ph.Ds. This report summarizes the research results of this project through that period.

97 MATHEMATICS AND COMPUTING↗

The potential of multi-port optical memories in digital computing

A high-capacity memory with a relatively high data transfer rate and multi-port simultaneous access capability may serve as the basis for new computer architectures. The implementation of a multi-port optical memory is discussed. Several computer structures are presented that might profitably use such a memory. These structures include (1) a simultaneous record access system, (2) a simultaneously shared memory computer system, and (3) a parallel digital processing structure.

Alford, C. O.↗

H{sub ∞} memory feedback control for uncertain singular Markov jump systems with time-varying delay and input saturation

This paper concerns with the H{sub ∞} robust exponential stability and memory state feedback stabilization of singular Markov jump systems with time-delay and input saturation. Linear matrix inequality conditions are given to guarantee regularity, impulse-freeness and exponential stability for the singular Markov jump system. Moreover, sufficient conditions are presented to ensure the H{sub ∞} disturbance attenuation level, and the design method of memory feedback controller is developed by solving linear matrix inequalities optimization problem without any decompositions of system matrices and equivalent transformation. Furthermore, the function in the proof procedure belongs to multiple Lyapunov-like functions whose advantage lies in their flexibility. Finally, numerical examples are employed to verify the effectiveness of the proposed methods and to illustrate the significant improvement on the conservativeness of some reported results in the literature.

97 MATHEMATICS AND COMPUTING↗

Self-correcting quantum memory in a thermal environment

The ability to store information is of fundamental importance to any computer, be it classical or quantum. To identify systems for quantum memories, which rely, analogously to classical memories, on passive error protection (''self-correction''), is of greatest interest in quantum information science. While systems with topological ground states have been considered to be promising candidates, a large class of them was recently proven unstable against thermal fluctuations. Here, we propose two-dimensional (2D) spin models unaffected by this result. Specifically, we introduce repulsive long-range interactions in the toric code and establish a memory lifetime polynomially increasing with the system size. This remarkable stability is shown to originate directly from the repulsive long-range nature of the interactions. We study the time dynamics of the quantum memory in terms of diffusing anyons and support our analytical results with extensive numerical simulations. Our findings demonstrate that self-correcting quantum memories can exist in 2D at finite temperatures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient construction of generalized master equation memory kernels for multi-state systems from nonadiabatic quantum-classical dynamics

Techniques derived from the generalized quantum master equation (GQME) framework have provided the basis for elucidating energy and charge transfer in systems ranging from molecular solids to photosynthetic complexes. Recently, the nonperturbative combination of the GQME with quantum-classical methods has resulted in approaches whose accuracy and efficiency exceed those of the original quantumclassical schemes while offering significant accuracy improvements over perturbative expansions of the GQME. In this work, we show that, while the non-Markovian memory kernel required to propagate the GQME scales quartically with the number of subsystem states, the number of trajectories required scales at most quadratically when using quantum-classical methods to construct the kernel. We then present an algorithm that allows further acceleration of the quantum-classical GQME by offering a way to selectively sample the kernel matrix elements that are most important to the process of interest. We demonstrate the utility of these advances by applying the combination of Ehrenfest mean field theory with the GQME (MF-GQME) to models of the Fenna-Matthews-Olson (FMO) complex and the light harvesting complex II (LHCII), with 7 and 14 states, respectively. This allows us to show that the MF-GQME is able to accurately capture all the relevant dynamical time scales in LHCII: the initial nonequilibrium population transfer on the femtosecond time scale, the steady state-type trapping on the picosecond time scale, and the long time population relaxation. Remarkably, all of these physical effects spanning tens of picoseconds can be encoded in a memory kernel that decays only after ~65 fs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗