Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 1,243 records · Page 69

An architecture for real-time vision processing

To study the feasibility of developing an architecture for real time vision processing, a task queue server and parallel algorithms for two vision operations were designed and implemented on an i860-based Mercury Computing System 860VS array processor. The proposed architecture treats each vision function as a task or set of tasks which may be recursively divided into subtasks and processed by multiple processors coordinated by a task queue server accessible by all processors. Each idle processor subsequently fetches a task and associated data from the task queue server for processing and posts the result to shared memory for later use. Load balancing can be carried out within the processing system without the requirement for a centralized controller. The author concludes that real time vision processing cannot be achieved without both sequential and parallel vision algorithms and a good parallel vision architecture.

Chien, Chiun-Hong↗

Localization crossover and subdiffusive transport in a classical facilitated network model of a disordered interacting quantum spin chain

Here, we consider the random-field Heisenberg model, a paradigmatic model for many-body localization (MBL) and add a Markovian dephasing bath coupled to the Anderson orbitals of the model's noninteracting limit. We map this system to a classical facilitated hopping model that is computationally tractable for large system sizes and investigate its dynamics. The classical model exhibits a robust crossover between an ergodic (thermal) phase and a frozen (localized) phase. The frozen phase is destabilized by thermal subregions (bubbles), which thermalize surrounding sites by providing a fluctuating interaction energy and so enable off-resonance particle transport. Investigating steady-state transport, we observe that the interplay between thermal and frozen bubbles leads to a clear transition between diffusive and subdiffusive regimes. This phenomenology both describes the MBL system coupled to a bath and provides a classical analog for the MBL transition in the corresponding quantum model, in that the classical model displays long local memory times. It also highlights the importance of the details of the bath coupling in studies of MBL systems coupled to thermal environments.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

NESSi : The N on- E quilibrium S ystems S imulation package

The nonequilibrium dynamics of correlated many-particle systems is of interest in connection with pump–probe experiments on molecular systems and solids, as well as theoretical investigations of transport properties and relaxation processes. Nonequilibrium Green’s functions are a powerful tool to study interaction effects in quantum many-particle systems out of equilibrium, and to extract physically relevant information for the interpretation of experiments. Here, we present the open-source software package NESSi (The Non-Equilibrium Systems Simulation package) which allows to perform many-body dynamics simulations based on Green’s functions on the L-shaped Kadanoff–Baym contour. NESSi contains the library libcntr which implements tools for basic operations on these nonequilibrium Green’s functions, for constructing Feynman diagrams, and for the solution of integral and integro-differential equations involving contour Green’s functions. The library employs a discretization of the Kadanoff–Baym contour into time points and a high-order implementation of integration routines. The total integrated error scales up to $\mathcal{O}(N^{-7})$, which is important since the numerical effort increases at least cubically with the simulation time. A distributed-memory parallelization over reciprocal space allows large-scale simulations of lattice systems. We provide a collection of example programs ranging from dynamics in simple two-level systems to problems relevant in contemporary condensed matter physics, including Hubbard clusters and Hubbard or Holstein lattice models. The libcntr library is the basis of a follow-up software package for nonequilibrium dynamical mean-field theory calculations based on strong-coupling perturbative impurity solvers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Imaging the magnetic nanowire cross section and magnetic ordering within a suspended 3D artificial spin-ice

Artificial spin-ice systems are patterned arrays of magnetic nanoislands arranged into frustrated geometries and provide insight into the physics of ordering and emergence. The majority of these systems have been realized in two-dimensions, mainly due to the ease of fabrication, but with recent developments in advanced nanolithography, three-dimensional artificial spin ice (ASI) structures have become possible, providing a new paradigm in their study. Such artificially engineered 3D systems provide new opportunities in realizing tunable ground states, new domain wall topologies, monopole propagation, and advanced device concepts, such as magnetic racetrack memory. Direct imaging of 3DASI structures with magnetic force microscopy has thus far been key to probing the physics of these systems but is limited in both the depth of measurement and resolution, ultimately restricting measurement to the uppermost layers of the system. In this work, a method is developed to fabricate 3DASI lattices over an aperture using two-photon lithography, thermal evaporation, and oxygen plasma exposure, allowing the probe of element-specific structural and magnetic information using soft x-ray microscopy with x-ray magnetic circular dichroism (XMCD) as magnetic contrast. The suspended polymer–permalloy lattices are found to be stable under repeated soft x-ray exposure. Analysis of the x-ray absorption signal allows the complex cross section of the magnetic nanowires to be reconstructed and demonstrates a crescent-shaped geometry. Measurement of the XMCD images after the application of an in-plane field suggests a decrease in magnetic moment on the lattice surface due to oxidation, while a measurable signal is retained on sub-lattices below the surface.

36 MATERIALS SCIENCE↗

Fault tolerant onboard packet switch architecture for communication satellites: Shared memory per beam approach

The NASA Lewis Research Center is developing a multichannel communication signal processing satellite (MCSPS) system which will provide low data rate, direct to user, commercial communications services. The focus of current space segment developments is a flexible, high-throughput, fault tolerant onboard information switching processor. This information switching processor (ISP) is a destination-directed packet switch which performs both space and time switching to route user information among numerous user ground terminals. Through both industry study contracts and in-house investigations, several packet switching architectures were examined. A contention-free approach, the shared memory per beam architecture, was selected for implementation. The shared memory per beam architecture, fault tolerance insertion, implementation, and demonstration plans are described.

Shalkhauser, Mary JO↗

Memory embedded non-intrusive reduced order modeling of non-ergodic flows

Generating a digital twin of any complex system requires modeling and computational approaches that are efficient, accurate, and modular. Traditional reduced order modeling techniques are targeted at only the first two, but the novel nonintrusive approach we present in this study is an attempt at taking all three into account effectively compared to their traditional counterparts. Based on dimensionality reduction using proper orthogonal decomposition (POD), we introduce a long short-term memory neural network architecture together with a principal interval decomposition (PID) framework as an enabler to account for localized modal deformation. As an effective partitioning tool for breaking the Kolmogorov barrier, our PID framework, therefore, can be considered a key element in the accurate reduced order modeling of convective flows. Our applications for convection-dominated systems governed by Burgers, Navier-Stokes, and Boussinesq equations demonstrate that the proposed approach yields significantly more accurate predictions than the POD-Galerkin method and could be a key enabler toward near real-time predictions of unsteady flows.

42 ENGINEERING↗

Time-series machine-learning error models for approximate solutions to parameterized dynamical systems

This work proposes a machine-learning framework for modeling the error incurred by approximate solutions to parameterized dynamical systems. In particular, we extend the machine-learning error models (MLEM) framework proposed in Ref. Freno and Carlberg (2019) to dynamical systems. The proposed Time-Series Machine-Learning Error Modeling (T-MLEM) method constructs a regression model that maps features – which comprise error indicators that are derived from standard a posteriori error-quantification techniques – to a random variable for the approximate-solution error at each time instance. The proposed framework considers a wide range of candidate features, regression methods, and additive noise models. We consider primarily recursive regression techniques developed for time-series modeling, including both classical time-series models (e.g., autoregressive models) and recurrent neural networks (RNNs), but also analyze standard non-recursive regression techniques (e.g., feed-forward neural networks) for comparative purposes. Finally, numerical experiments conducted on multiple benchmark problems illustrate that the long short-term memory (LSTM) neural network, which is a type of RNN, outperforms other methods and yields substantial improvements in error predictions over traditional approaches.

42 ENGINEERING↗

A Normal Incidence X-ray Telescope (NIXT) sounding rocket payload

Work on the High Resolution X-ray (HRX) Detector Program is described. In the laboratory and flight programs, multiple copies of a general purpose set of electronics which control the camera, signal processing and data acquisition, were constructed. A typical system consists of a phosphor convertor, image intensifier, a fiber optics coupler, a charge coupled device (CCD) readout, and a set of camera, signal processing and memory electronics. An initial rocket detector prototype camera was tested in flight and performed perfectly. An advanced prototype detector system was incorporated on another rocket flight, in which a high resolution heterojunction vidicon tube was used as the readout device for the H(alpha) telescope. The camera electronics for this tube were built in-house and included in the flight electronics. Performance of this detector system was 100 percent satisfactory. The laboratory X-ray system for operation on the ground is also described.

Golub, Leon↗

Geology and image processing

Digital image processing for geological applications will be integrated with geographic information systems and data base management systems. While multiband data sets from radar and multispectral scanners will make extreme demands on memory, bus and processor architectures, it is expected that array processors and VLSI/VHSIC dedicated function chips will allow the use of fast Fourier transform and classification algorithms. It is anticipted that, as processor power increases, the weakest link of a processing system will become the analyst who uses it. Human engineering of systems is therefore recommended for the most effective utilization of remotely sensed geologic data.

Daily, M.↗

Tracer particle transport dynamics in the diffusive sandpile cellular automaton

The confinement properties of the diffusive running sandpile are characterized by tracking the motion of a population of marked grains of sand. It is found that, as the relative strength of the avalanching to the diffusive transport channel is varied, a point is reached at which the particle global confinement time and the probability density functions of the jump-sizes and waiting-times of the tracked grains experience a sudden change, thus revealing a dynamical transition, that is consistent with previous studies (Newman DE et al., Phys Rev Lett 2002;88(20):204304). Across this transition, the sandpile moves from a regime characterized by self-similarity and memory, where avalanches of all possible sizes dominate transport across the system, to another regime where transport is taken over by near system-size, quasi-periodic avalanches. Values for the fractional transport exponents that quantify effective transport across the sandpile prior to the transition are also obtained.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Pass-efficient methods for compression of high-dimensional turbulent flow data

The future of high-performance computing, specifically on future Exascale computers, will presumably see memory capacity and bandwidth fail to keep pace with data generated, for instance, from massively parallel partial differential equation (PDE) systems. Current strategies proposed to address this bottleneck entail the omission of large fractions of data, as well as the incorporation of in situ compression algorithms to avoid overuse of memory. To ensure that post-processing operations are successful, this must be done in a way that a sufficiently accurate representation of the solution is stored. Moreover, in situations where the input/output system becomes a bottleneck in analysis, visualization, etc., or the execution of the PDE solver is expensive, the number of passes made over the data must be minimized. In the interest of addressing this problem, this work focuses on the utility of pass-efficient, parallelizable, low-rank, matrix decomposition methods in compressing high-dimensional simulation data from turbulent flows. Additionally, a particular emphasis is placed on using coarse representation of the data – compatible with the PDE discretization grid – to accelerate the construction of the low-rank factorization. This includes the presentation of a novel single-pass matrix decomposition algorithm for computing the so-called interpolative decomposition. The methods are described extensively and numerical experiments on two turbulent channel flow data are performed. In the first (unladen) channel flow case, compression factors exceeding 400 are achieved while maintaining accuracy with respect to first- and second-order flow statistics. In the particle-laden case, compression factors of 100 are achieved and the compressed data is used to recover particle velocities. These results show that these compression methods can enable efficient computation of various quantities of interest in both the carrier and disperse phases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Neuromorphic spintronics

Neuromorphic computing uses brain-inspired principles to design circuits that can perform computational tasks with superior power efficiency to conventional computers. Approaches that use traditional electronic devices to create artificial neurons and synapses are, however, currently limited by the energy and area requirements of these components. Spintronic nanodevices, which exploit both the magnetic and electrical properties of electrons, can increase the energy efficiency and decrease the area of these circuits, and magnetic tunnel junctions are of particular interest as neuromorphic computing elements because they are compatible with standard integrated circuits and can support multiple functionalities. Here, we review the development of spintronic devices for neuromorphic computing. We examine how magnetic tunnel junctions can serve as synapses and neurons, and how magnetic textures, such as domain walls and skyrmions, can function as neurons. We also explore spintronics-based implementations of neuromorphic computing tasks, such as pattern recognition in an associative memory, and discuss the challenges that exist in scaling up these systems.

42 ENGINEERING↗

Excited-state electronic structure of molecules using many-body Green’s functions: Quasiparticles and electron–hole excitations with VOTCA-XTP

Here, we present the open-source VOTCA-XTP software for the calculation of the excited-state electronic structure of molecules using many-body Green’s function theory in the GW approximation with the Bethe–Salpeter equation (BSE). This work provides a summary of the underlying theory and discusses the details of its implementation based on Gaussian orbitals, including resolution-of-identity techniques and different approaches to the frequency integration of the self-energy or acceleration by offloading compute-intensive matrix operations using graphics processing units in a hybrid OpenMP/Cuda scheme. A distinctive feature of VOTCA–XTP is the capability to couple the calculation of electronic excitations to a classical polarizable environment on an atomistic level in a coupled quantum- and molecular-mechanics (QM/MM) scheme, where a complex morphology can be imported from Molecular Dynamics simulations. The capabilities and limitations of the GW–BSE implementation are illustrated with two examples. First, we study the dependence of optically active electron–hole excitations in a series of diketopyrrolopyrrole-based oligomers on molecular-architecture modifications and the number of repeat units. Second, we use the GW–BSE/MM setup to investigate the effect of polarization on localized and intermolecular charge-transfer excited states in morphologies of low-donor content rubrene–fullerene mixtures. These showcases demonstrate that our implementation currently allows us to treat systems with up to 2500 basis functions on regular shared-memory workstations, providing accurate descriptions of quasiparticle and coupled electron–hole excited states of various characters on an equal footing.

74 ATOMIC AND MOLECULAR PHYSICS↗

Cybersecurity impact of the growth of data in sports

As the sporting industry continues to increase dependence on new and often massive data sets, they also risk exposing themselves, as well as the leagues, teams, venues, players, and fans, to risks posed by not protecting the confidentiality and integrity of this data. The industry, especially true for professional sports, demands an ever increasing supply of new forms of data to achieve their goals of enticing new fans; enhancing experience; expanding the fan experience from venues and television to the internet and mobile devices; measuring and evaluating the performance and safety of players; and increasing revenue. New methods have emerged to collect data about a variety of aspects of sports ranging from players to fans to teams to venues. Data collected during sporting events is combined with historical data to also help teams analyze and predict performance. To synthesize these predictive analytical and historical memories, sports teams and organizations mix a variety of computer technologies. System integration tends to focus on ensuring the availability of the data and reliability of the technologies but might introduce risks to the confidentiality (privacy) and integrity of the data. Recognizing the potential risks requires review and evaluation. Much of the data is collected for publicly providing information to the fans, so threats to confidentiality pose fewer risks. The greatest risk is violating the privacy of players, such a private performance test, or using technology to gain a competitive advantage.

Jenkins, Stephanie↗

Performance Analysis and Optimal Node-aware Communication for Enlarged Conjugate Gradient Methods

Krylov methods are a key way of solving large sparse linear systems of equations but suffer from poor strong scalability on distributed memory machines. Furthermore, this is due to high synchronization costs from large numbers of collective communication calls alongside a low computational workload. Enlarged Krylov methods address this issue by decreasing the total iterations to convergence, an artifact of splitting the initial residual and resulting in operations on block vectors. In this article, we present a performance study of an enlarged Krylov method, Enlarged Conjugate Gradients (ECG), noting the impact of block vectors on parallel performance at scale. Most notably, we observe the increased overhead of point-to-point communication as a result of denser messages in the sparse matrix-block vector multiplication kernel. Additionally, we present models to analyze expected performance of ECG, as well as motivate design decisions. Most importantly, we introduce a new point-to-point communication approach based on node-aware communication techniques that increases efficiency of the method at scale.

97 MATHEMATICS AND COMPUTING↗

CIMantic Graphs

CIMantic Graphs (aka CIM-Graph) is a new python library developed by PNNL to reduce the burden of working with the Common Information Model. CIMantic Graphs takes a novel approach of building in-memory labeled property graphs for creating, parsing, and editing CIM power system models.

Anderson, Alexander↗

AMReX v2024

The software framework, AMReX, supports the development of block-structured adaptive mesh refinement (AMR) algorithms for solving systems of partial differential equations. AMR reduces the computational cost and memory footprint compared to a uniform mesh while preserving the essential local descriptions of different physical processes in complex multiphysics algorithms. AMR uses a hierarchical representation of the solution at multiple levels of resolution where the solution on each level is defined on the union of data containers at that resolution. These data containers, which represent the solution over a logically rectangular subregion of the domain, can contain field data defined on a mesh, Lagrangian particles or combinations of both. In addition to these basic data types, AMReX supports a multilevel embedded boundary representation of complex geometry; linear solvers for cell-centered and nodal data; asynchronous I/O in a native format readable by ParaView, VisIt and yt; and interfaces to hypre and PETSc solvers. AMReX enables applications to run on distributed memory architectures with multicore CPUs and with GPU accelerators. AMReX uses a lightweight abstraction layer that effectively hides the details of the architecture from the application. The framework currently supports CUDA, HIP and SYCL for GPU acceleration and OpenMP for multi-core CPU architectures.

Almgren, Ann↗

SMC 2021 Data Challenge: Analyzing Resource Utilization and User Behavior on Titan Supercomputer

Resource utilization statistics of submitted jobs on a supercomputer can help us understand how users from various scientific domains use HPC platforms and better design a job scheduler. We explore to generate insight regarding workload distribution and usage pattern domains from job scheduler trace, GPU failure information, and project-specific information collected from Titan supercomputer. Furthermore, we want to know how the scheduler performance varies over time and how the users' scheduling behavior changes following a system failure. These observations have the potential to provide valuable insight, which is helpful to prepare for system failures. These practices will help us develop and apply novel machine learning algorithms in understanding system behavior, requirement, and better scheduling of HPC systems. There are two datasets, RUR and GPU: RUR dataset is the job scheduler traces collected from the Titan supercomputer from 01/01/2015 to 07/31/2019 (2015.csv - 2019.csv). These were collected using resource Utilization Report (RUR), a Cray-developed resource-usage data collection and reporting system. It contains the usage information of its critical resources (CPU, Memory, GPU, and I/O) of each running job on Titan during that period (https://ieeexplore.ieee.org/abstract/document/8891001). It includes ProjectAreas as additional information, every job is associated with a project ID. TheProjectAreas.csv dataset provides a mapping of the project ID to its domain science. GPU dataset has information regarding GPU failure on Titan. There have been some hardware-related issues in the GPUs in Titan that caused some GPUs to fail, sometimes irrecoverably during some job runs. This dataset provides information regarding these failures during the execution of the submitted jobs. GPUs on Titan are uniquely identified by a serial number (SN), and they are installed in a location. A GPU can be installed in a location, then removed from that location following a failure, and then re-installed in a different location after fixing the problem. If the failure can't be recovered, the GPU might be removed entirely from Titan. There are two prominent types of failures that resulted in the removal of GPUs from Titan: Double Bit Error (DBE) and Out of the Bus (OTB). The dataset (gc_full.csv) has seven attributes, we provided a short description of these attributes in the ReadMe file. To learn more about this dataset, please refer to the git repository https://github.com/olcf/TitanGPULife and the related publication (https://ieeexplore.ieee.org/abstract/document/9355319).

42 ENGINEERING↗