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 847 records · Page 47

Sequential measurement-based quantum computing with memories

We introduce a general scheme for sequential one-way quantum computation where static systems with long-living quantum coherence (memories) interact with moving systems that may possess very short coherence times. Both the generation of the cluster state needed for the computation and its consumption by measurements are carried out simultaneously. As a consequence, effective clusters of one spatial dimension fewer than in the standard approach are sufficient for computation. In particular, universal computation requires only a one-dimensional array of memories. The scheme applies to discrete-variable systems of any dimension as well as to continuous-variable ones, and both are treated equivalently under the light of local complementation of graphs. In this way our formalism introduces a general framework that encompasses and generalizes in a unified manner some previous system-dependent proposals. The procedure is intrinsically well suited for implementations with atom-photon interfaces.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Performance degradation due to multiprogramming and system overheads in real workloads - Case study on a shared memory multiprocessor

The performance degradation due to the multiprogramming (MP) overhead in a parallel execution environment is quantified. In addition, total system overhead is also measured. A methodology, which estimates the MP overhead present in real workloads, is illustrated with real measurents. It is found that MP overhead usually consumes between 10 and 23 percent of the processing power available to parallel programs. The mean MP overhead is determined to be 16 percent which is well over half the total system overhead executed on the system (the mean system overhead is determined to be 24 percent of the processing power). It is found that MP overhead, total system overhead, and application completion time are all moderately correlated.

Dimpsey, R. T.↗

Design and Analysis of Architectures for Structural Health Monitoring Systems

During the two-year project period, we have worked on several aspects of Health Usage and Monitoring Systems for structural health monitoring. In particular, we have made contributions in the following areas. 1. Reference HUMS architecture: We developed a high-level architecture for health monitoring and usage systems (HUMS). The proposed reference architecture is shown. It is compatible with the Generic Open Architecture (GOA) proposed as a standard for avionics systems. 2. HUMS kernel: One of the critical layers of HUMS reference architecture is the HUMS kernel. We developed a detailed design of a kernel to implement the high level architecture.3. Prototype implementation of HUMS kernel: We have implemented a preliminary version of the HUMS kernel on a Unix platform.We have implemented both a centralized system version and a distributed version. 4. SCRAMNet and HUMS: SCRAMNet (Shared Common Random Access Memory Network) is a system that is found to be suitable to implement HUMS. For this reason, we have conducted a simulation study to determine its stability in handling the input data rates in HUMS. 5. Architectural specification.

Mukkamala, Ravi↗

A Bandwidth-Optimized Multi-Core Architecture for Irregular Applications

This paper presents an architecture template for next-generation high performance computing systems specifically targeted to irregular applications. We start our work by considering that future generation interconnection and memory bandwidth full-system numbers are expected to grow by a factor of 10. In order to keep up with such a communication capacity, while still resorting to fine-grained multithreading as the main way to tolerate unpredictable memory access latencies of irregular applications, we show how overall performance scaling can benefit from the multi-core paradigm. At the same time, we also show how such an architecture template must be coupled with specific techniques in order to optimize bandwidth utilization and achieve the maximum scalability. We propose a technique based on memory references aggregation, together with the related hardware implementation, as one of such optimization techniques. We explore the proposed architecture template by focusing on the Cray XMT architecture and, using a dedicated simulation infrastructure, validate the performance of our template with two typical irregular applications. Our experimental results prove the benefits provided by both the multi-core approach and the bandwidth optimization reference aggregation technique.

bandwidth optimization↗

Quantum interference of stored dual-channel spin-wave excitations in a single tripod system

We present an experimental demonstration of dual-channel memory in a single tripod atomic system. The total readout signal exhibits either constructive or destructive interference when the dual-channel spin-wave excitations (SWEs) are retrieved by two reading beams with a controllable relative phase. When the two reading beams have opposite phases, the SWEs will remain in the medium, which can be retrieved later with two in-phase reading beams. Such a phase-sensitive storage and retrieval scheme can be used to measure and control the relative phase between the two SWEs in the memory medium, which may find applications in quantum-information processing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Integrating Fault-Tolerance into the Monte Carlo Application Toolkit

High-performance computer systems have passed the petascale mark, and the next decade will witness a drive towards exascale systems. Extrapolating from current hardware trends it is evident that exascale class systems will require a significantly larger number of cores than current petascale systems, and advanced architectures which include heterogeneous processors are gaining popularity. Such an increase in component count will decrease system mean time to interrupt (MTTI), resulting in greater emphasis on application fault tolerance. The additional memory requirements of exascale systems combined with the slow increase in hard drive write bandwidth will exclude current checkpoint/restart (C/R) techniques as a reliable means of fault tolerance. The current C/R approach to handling failures typically aborts the entire application and requires restarting the application, which is clearly an inefficient solution when utilizing 1000+ processors. Unless improvements are made in resilience and fault tolerance, it is predicted that the work throughput on the largest supercomputers could drop below 10% by 2015. As part of the ”Application Enablement for Next Generation Platforms” milestone, we addressed the shortcomings and limitations of C/R by developing a fault-tolerant component which would be integrated into the Monte Carlo Application Toolkit (MCATK) and demonstrated the ability to continue static K-effective calculations even in the presence of multiple processor failures. In section 2, we provide details about the milestone tasks. Section 3 describes the fault-tolerant framework, its integration into MCATK and its failure recovery scheme. We also describe FT-MPI, a fault-tolerant MPI implementation which provides the capabilities needed for an MPI-based application to survive and continue past failures. Section 4 reports future work that we hope to build upon the current accomplishments.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Reducing power consumption during execution of an application on a plurality of compute nodes

Methods, apparatus, and products are disclosed for reducing power consumption during execution of an application on a plurality of compute nodes that include: powering up, during compute node initialization, only a portion of computer memory of the compute node, including configuring an operating system for the compute node in the powered up portion of computer memory; receiving, by the operating system, an instruction to load an application for execution; allocating, by the operating system, additional portions of computer memory to the application for use during execution; powering up the additional portions of computer memory allocated for use by the application during execution; and loading, by the operating system, the application into the powered up additional portions of computer memory.

97 MATHEMATICS AND COMPUTING↗

Evaluating the Potential of Cray Gemini Interconnect for PGAS Communication Runtime Systems

The Cray Gemini Interconnect has been recently introduced as the next generation network for building scalable multi-petascale supercomputers. The Cray XE6 systems, which use the Gemini Interconnect are becoming available with Message Passing Interface (MPI) and Partitioned Global Address Space (PGAS) Models such as as Global Arrays, Unified Parallel C, Co-Array Fortran and Cascade High Performance Language. These PGAS models use one-sided communication runtime systems such as MPI-Remote Memory Access, Aggregate Remote Memory Copy Interface and proprietary communication runtime systems. The primary objective of our work is to study the potential of Cray Gemini Interconnect by designing application specific micro-benchmarks using the DMAPP userspace library provided by the Gemini Interconnect. To meet this objective, we design micro-benchmarks to study the performance of simple communication primitives and application specific micro-benchmarks to understand the behavior of Gemini Interconnect at scale. In our experiments, the Gemini Interconnect can achieve a peak bandwidth of 6911 MB/s and a latency of 1us for get communication primitive. Scalability tests for atomic memory operations and shift communication operation up to 65536 processes shows the efficacy of the Gemini Interconnect.

Vishnu, Abhinav↗

A stilbene - CdZnTe based radioxenon detection system

Atmospheric monitoring of radioxenon is one of the most widely used methods by the Comprehensive Nuclear-Test-Ban Treaty Organization (CTBTO) to detect elevated levels of 131m Xe, 133/133m Xe, and 135 Xe. The ratios of these radionuclides help discriminate between peaceful use of nuclear technology and nuclear weapon explosions. Radioxenon detection systems often use plastic scintillators in the capacity of an electron detector and a gas cell, plastic gas cells are responsible for introducing high memory effect in these systems. This work presents the design of a new detection system for radioxenon monitoring that utilizes silicon photomultipliers, a stilbene gas cell, and a CdZnTe detector. This detector was evaluated using xenon radioisotope samples produced in the TRIGA reactor at Oregon State University. Here, a 48-h background was collected and calculations of the Minimum Detectable Concentration (MDC) were carried out using the Region of Interest (ROI) approach. An MDC of less than 1 mBq/m 3 was obtained for 131m Xe, 133 Xe, and 133m Xe in accordance with the sensitivity limits set by the CTBTO and performs respectably when compared to state-of-the-art radioxenon detection systems. Using 131m Xe, this study indicates that the stilbene gas cell exhibits a memory effect of 0.045 ±0.017%, this is almost a two-order magnitude improvement compared to plastic scintillators. The main purpose of this work is to explore the use of new stilbene detection media for radioxenon application and addressing the problem of memory effect.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Evidence of dilute ferromagnetism in rare-earth doped yttrium aluminium garnet

This work demonstrates strong coupling regime between an erbium ion spin ensemble and microwave hybrid cavity-whispering gallery modes in a yttrium aluminium garnet dielectric crystal. Coupling strengths of 220 MHz and mode quality factors in excess of 10{sup 6} are demonstrated. Moreover, the magnetic response of high-Q modes demonstrates behaviour which is unusual for paramagnetic systems. This behaviour includes hysteresis and memory effects. Such qualitative change of the system's magnetic field response is interpreted as a phase transition of rare earth ion impurities. This phenomenon is similar to the phenomenon of dilute ferromagnetism in semiconductors. The clear temperature dependence of the phenomenon is demonstrated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-processing system study

The results are summarized of a multiprocessor systems design review. The systems were reviewed against use in a space station environment. The proposed designs were evaluated from a systems viewpoint in general and from the systems software in particular. The recommendations resulting from this evaluation are anticipated to be considered for the design of a multiprocessing system built around a SUMC. Two multiprocessing system designs were reviewed. The designs reviewed were highly functional and many questions could not be answered. However, several major issues were uncovered which could be evaluated to some detail, and which could greatly impact the SUMC-MP design. The major issues relevant to a multiprocessing system design revolve around the following functions: (1) Storage Management, (2) Processor Management, (3) Intermodule Communication, (4) Memory Access Interference, (5) System Efficiency, and (6) System Recovery/Reliability.

Source record↗

Knowledge acquisition from natural language for expert systems based on classification problem-solving methods

It is shown how certain kinds of domain independent expert systems based on classification problem-solving methods can be constructed directly from natural language descriptions by a human expert. The expert knowledge is not translated into production rules. Rather, it is mapped into conceptual structures which are integrated into long-term memory (LTM). The resulting system is one in which problem-solving, retrieval and memory organization are integrated processes. In other words, the same algorithm and knowledge representation structures are shared by these processes. As a result of this, the system can answer questions, solve problems or reorganize LTM.

Gomez, Fernando↗

Memory protection

Accidental overwriting of files or of memory regions belonging to other programs, browsing of personal files by superusers, Trojan horses, and viruses are examples of breakdowns in workstations and personal computers that would be significantly reduced by memory protection. Memory protection is the capability of an operating system and supporting hardware to delimit segments of memory, to control whether segments can be read from or written into, and to confine accesses of a program to its segments alone. The absence of memory protection in many operating systems today is the result of a bias toward a narrow definition of performance as maximum instruction-execution rate. A broader definition, including the time to get the job done, makes clear that cost of recovery from memory interference errors reduces expected performance. The mechanisms of memory protection are well understood, powerful, efficient, and elegant. They add to performance in the broad sense without reducing instruction execution rate.

Denning, Peter J.↗

Multiple transient memories in sheared suspensions: Robustness, structure, and routes to plasticity

Multiple transient memories, first discovered in charge-density-wave conductors, are a remarkable and initially counterintuitive example of how a system can store information about its driving. In this class of memories, a system can learn multiple driving inputs, nearly all of which are eventually forgotten despite their continual input. If sufficient noise is present, the system regains plasticity so that it can continue to learn new memories indefinitely. Recently, Keim and Nagel [Phys. Rev. Lett. 107, 010603 (2011)] showed how multiple transient memories could be generalized to a generic driven disordered system with noise, giving as an example simulations of a simple model of a sheared non-Brownian suspension. Here, we further explore simulation models of suspensions under cyclic shear, focusing on three main themes: robustness, structure, and overdriving. We show that multiple transient memories are a robust feature independent of many details of the model. The steady-state spatial distribution of the particles is sensitive to the driving algorithm; nonetheless, the memory formation is independent of such a change in particle correlations. Finally, we demonstrate that overdriving provides another means for controlling memory formation and retention.

42 ENGINEERING↗

Towards Superior Software Portability with SHAD and HPX C++ Libraries

As hardware architectures and software stacks complexity grows, development productivity, performance and software portability, quickly evolve from desirable features to actual needs. SHAD, the Scalable High-performance Algorithms and Data-structures C++ library is designed to mitigate these issues: it provides general purpose building blocks as well as high-level custom utilities, and offers a shared-memory programming abstraction which facilitates the programming of complex systems, scaling up to High Performance Computing clusters. SHAD’s portability is achieved through an abstract runtime interface, which decouples the upper layers of the library and hides the low level details of the underlying architecture. This layer enables SHAD to interface with different runtime/threading systems, e.g. Intel TBB and Global Memory and Threading (GMT). However, current backends targeting distributed systems, rely on a centralized controller which may possibly limit scalability up to hundreds of nodes and creates a network hot spot due to all to one communication for synchronization, and possibly resulting in degraded performance at high process counts. In this research, we explore HPX, the C++ standard library for parallelism and concurrency, as an additional backend in support of the SHAD library, and present the methodologies in support of local and remote task executions in SHAD with respect to HPX. Finally, we evaluate the proposed system by comparing against existing backends of SHAD and analyzing their performance on C++ Standard Template Library algorithms.

Wu, Nanmiao↗

Parallel Programming Models and Systems for High Performance Computing. In: Emerging Research in Cloud Distributed Computing Systems

A parallel programming model is an abstraction of a parallel system that allows expression of both algorithms and shared data structures. To accommodate the diversity in parallel system architectures and user requirements, there are a variety of programming models including the models providing a shared memory view or a distributed memory view of the system. The programming models are implemented as libraries, language extensions, or compiler directives. This chapter provides a discussion on programming models and its implementations aimed at application developers, system software researchers, and hardware architects. The first part provides an overview of the programming models. The second part is an in-depth discussion on high-performance networking interface to implement the programming model. The last part of the chapter discusses implementation of a programming model with a case study. Each part of the chapter concludes with a discussion on current research trends and its impact on future architectures.

Venkata, Manjunath Gorentia↗

A closed-loop automatic control system for high-intensity acoustic test systems.

Description of an automatic control system for high-intensity acoustic tests in reverberation chambers. Working in 14 one-third-octave bands from 50 to 1000 Hz, the desired sound pressure levels are set into the memory in the control system before the test. The control system then increases the sound pressure level in the reverberation chamber gradually in each of the one-third-octave bands until the level set in the memory is reached. This level is then maintained for the duration of the test. Additional features of the system are overtest protection, the capability of 'holding' the spectrum at any time, and the presence of a total test timer.

Slusser, R. A.↗