Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “physically distributed memory”

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 55 records · Page 3

A composite grid solver for conjugate heat transfer in fluid-structure systems

We describe a numerical method for modeling temperature-dependent fluid flow coupled to heat transfer in solids. This approach to conjugate heat transfer can be used to compute transient and steady state solutions to a wide range of fluid-solid systems in complex two- and three-dimensional geometry. Fluids are modeled with the temperature-dependent incompressible Navier-Stokes equations using the Boussinesq approximation. Solids with heat transfer are modeled with the heat equation. Appropriate interface equations are applied to couple the solutions across different domains. The computational region is divided into a number of sub-domains corresponding to fluid domains and solid domains. There may be multiple fluid domains and multiple solid domains. Each fluid or solid sub-domain is discretized with an overlapping grid. The entire region is associated with a composite grid which is the union of the overlapping grids for the sub-domains. A different physics solver (fluid solver or solid solver) is associated with each sub-domain. A higher-level multi-domain solver manages the entire solution process. We propose and analyze some centered discrete approximations to the interface equations that have some desirable stability properties. The coupled interface equations may be solved directly when using explicit time-stepping methods in the sub-domains, resulting in a strongly coupled approach. The stability of the interface treatment in this case is independent of the relative sizes of the material properties in the two domains with the time-step only depending on the usual von Neumann conditions for each sub-domain. For implicit time-stepping methods we solve the interface equations in a weakly coupled fashion to avoid forming a coupled implicit system across all sub-domains. The convergence of this approach does depend on the relative sizes of the thermal conductivities and diffusivities. We analyze different iteration strategies for solving these implicit equations including the use of mixed (Robin) approximations at the interface. Numerical results are presented to illustrate the method. The accuracy of the technique is verified using the method of analytic solutions and by computing the solution to some heat exchanger problems where the exact solution is known. The technique is also applied to the modeling of an inertial-confinement-fusion hohlraum target and the flow of coolant past an hexagonal array of heated fuel rods. The multi-domain solver runs in parallel on distributed memory computers and some parallel results are provided.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Frameworks, Algorithms, and Scalable Technologies for Mathematics (FASTMath) SciDAC Institute

The FASTMath SciDAC Institute addressed two key challenges that application scientists faced at the beginning of SciDAC-3. First, FASTMath helped them continue to improve the quality of their simulations by increasing accuracy and reliability of both their software and algorithms. Second, FASTMath helped them adapt their computations to make effective use of high-end computing facilities acquired by DOE over the past five years. This required the development of new mathematical algorithms that were appropriate for the physics problems being solved, implementations that scaled to million-way parallelism, and software that effectively leveraged both distributed memory and on-node parallelism. The Rensselaer Polytechnic Institute team’s efforts focused on the unstructured mesh technologies developed by FASTMath.

97 MATHEMATICS AND COMPUTING↗

Perovskite neural trees

Trees are used by animals, humans and machines to classify information and make decisions. Natural tree structures displayed by synapses of the brain involves potentiation and depression capable of branching and is essential for survival and learning. Demonstration of such features in synthetic matter is challenging due to the need to host a complex energy landscape capable of learning, memory and electrical interrogation. We report experimental realization of tree-like conductance states at room temperature in strongly correlated perovskite nickelates by modulating proton distribution under high speed electric pulses. This demonstration represents physical realization of ultrametric trees, a concept from number theory applied to the study of spin glasses in physics that inspired early neural network theory dating almost forty years ago. We apply the tree-like memory features in spiking neural networks to demonstrate high fidelity object recognition, and in future can open new directions for neuromorphic computing and artificial intelligence.

36 MATERIALS SCIENCE↗

GPU-acceleration of the ELPA2 distributed eigensolver for dense symmetric and hermitian eigenproblems

The solution of eigenproblems is often a key computational bottleneck that limits the tractable system size of numerical algorithms, among them electronic structure theory in chemistry and in condensed matter physics. Large eigenproblems can easily exceed the capacity of a single compute node, thus must be solved on distributed-memory parallel computers. We here present GPU-oriented optimizations of the ELPA two-stage tridiagonalization eigensolver (ELPA2). On top of cuBLAS-based GPU offloading, we add a CUDA kernel to speed up the back-transformation of eigenvectors, which can be the computationally most expensive part of the two-stage tridiagonalization algorithm. Furthermore, we benchmark the performance of this GPU-accelerated eigensolver on two hybrid CPU–GPU architectures, namely a compute cluster based on Intel Xeon Gold CPUs and NVIDIA Volta GPUs, and the Summit supercomputer based on IBM POWER9 CPUs and NVIDIA Volta GPUs. Consistent with previous benchmarks on CPU-only architectures, the GPU-accelerated two-stage solver exhibits a parallel performance superior to the one-stage counterpart. Finally, we demonstrate the performance of the GPU-accelerated eigensolver developed in this work for routine semi-local KS-DFT calculations comprising thousands of atoms.

97 MATHEMATICS AND COMPUTING↗

Effects of ZrO{sub 2} doping on HfO{sub 2} resistive switching memory characteristics

A resistive switching (RS) random access memory device with ZrO{sub 2}-doped HfO{sub 2} exhibits better RS performance than that with pure HfO{sub 2}. In particular, I{sub res}, V{sub res}, and V{sub set} are reduced by approximately 58%, 38%, and 39%, respectively, when HfO{sub 2} is doped with ZrO{sub 2} (9 at. %). In addition, the ZrO{sub 2} doping in HfO{sub 2} makes the distribution of most parameters steeper. Transmission electron microscopy (TEM) analysis reveals that the deposited zirconium-doped hafnium oxide (HZO) (9 at. %) is polycrystalline. Elemental mapping results by scanning TEM–energy dispersive spectroscopy also prove that ZrO{sub 2} is uniformly distributed in the HZO (9 at. %) film. The possible mechanism for the improvement in the RS characteristics is also suggested on the basis of the X-ray photoelectron spectroscopy results and filamentary RS mechanism. These results suggest that the ZrO{sub 2} doping into HfO{sub 2} likely not only will reduce power consumption but also will improve cyclic endurance by controlling the nonstoichiometric phase.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Select Advances in Computational Accelerator Physics

Computational accelerator physics has changed and broadened over the last decade or so. Part of the change is due to the advent of multiple ways of parallel computing. Another part comes from algorithmic developments. The multiple ways of parallel computing include distributed memory parallelism and on-chip parallelism, with the latter coming from architectures (CPU and GPU) having multiple processing elements (cores or streaming multiprocessors) and wide vector (SIMD) instruction units. The basics of these new architectures and their application to computational accelerator physics are briefly reviewed. Algorithmic advances in the select areas of spin tracking, cavity calculations, plasma acceleration, and electron cooling are also reviewed. In some cases the algorithms provide increased fidelity improving the overall accuracy, while in other cases, such as controlled dispersion, the algorithms provide increased fidelity by better modeling the essential physical interaction. Finally, the use of computational frameworks, which provide the basic computational infrastructure, while allowing the capability developer to concentrate on the math and physics, is reviewed in the context of the Vorpal application, which has found use across accelerator physics and many other fields.

Engineering↗

Interfractional Variations in the Setup of Pelvic Bony Anatomy and Soft Tissue, and Their Implications on the Delivery of Proton Therapy for Localized Prostate Cancer

Purpose: To quantify daily variations in the anatomy of patients undergoing radiation therapy for prostate carcinoma, to estimate their effect on dose distribution, and to evaluate the effectiveness of current standard planning and setup approaches employed in proton therapy. Methods: We used series of computed tomography data, which included the pretreatment scan, and between 21 and 43 in-room scans acquired on different treatment days, from 10 patients treated with intensity-modulated radiation therapy at Morristown Memorial Hospital. Variations in femur rotation angles, thickness of subcutaneous adipose tissue, and physical depth to the distal surface of the prostate for lateral beam arrangement were recorded. Proton dose distributions were planned with the standard approach. Daily variations in the location of the prescription isodose were evaluated. Results: In all 10 datasets, substantial variation was observed in the lateral tissue thickness (standard deviation of 1.7-3.6 mm for individual patients, variations of >5 mm from the planning computed tomography observed in all series), and femur rotation angle (standard deviation between 1.3{sup o} and 4.8{sup o}, with the maximum excursion exceeding 10{sup o} in 6 of 10 datasets). Shifts in the position of treated volume (98% isodose) were correlated with the variations in the lateral tissue thickness. Conclusions: Analysis suggests that, combined with image-guided setup verification, the range compensator expansion technique prevents loss of dose to target from femur rotation and soft-tissue deformation, in the majority of cases. Anatomic changes coupled with the uncertainties of particle penetration in tissue restrict possibilities for margin reduction in proton therapy of prostate cancer.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Nuclear fission dynamics within a generalized Langevin approach

Within the generalized (non-Markovian) multidimensional Langevin approach, the time and energy characteristics of symmetric fission of highly excited heavy nuclei are studied. In two-dimensional space of the collective deformation parameters, it is considered a nuclear descent from the top of the fission barrier to the scission point. The distributions of descent times and total kinetic energy of fission fragments are calculated as functions of memory time, measuring the relative size of memory effects in the collective dynamics. We found that the peculiarities of the non-Markovian dynamics at fairly large values of the memory time are reflected in the saturation of the mean time of motion from the saddle to scission with the growth of the strength of memory effects in the system.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Performance Evaluation of Different Parallel Programming Models in SCALE-Shift Sequences for Criticality and Shielding Applications [Abstract]

The SCALE code system has been widely used for nuclear criticality safety, reactor physics, radiation shielding, source term generation, and inventory analyses by researchers, industry, and regulatory bodies. Although limited support for shared- and distributed-memory parallel processing was introduced via C++ threading, OpenMP, and MPI, a hybrid parallel programming model with both distributed- and shared-memory parallelism has not been fully supported in the SCALE code system.

Nuclear Criticality Safety Program (NCSP)↗

LSI computer fabrication - SUMC/DV.

The SUMC/DV (Space Ultrareliable Modular Computer Demonstration Vehicle), which required the design and fabrication of ten different array types, was designed, partitioned, assembled, tested, and made completely operational in less than one year. This paper describes the assembly, the physical and electrical characteristics, and the basic electrical testing procedures used on SUMC/DV. The paper includes a description of the packaging concepts, the physical assembly, the fabrication and testing of the various components including the LSI/CMOS arrays, the hierarchy of the memory complement, the clock generation and distribution scheme, additional system testing techniques, and the procedure employed in the electrical checkout of the system.

Feller, A.↗

A new hybrid-Lagrangian numerical scheme for gyrokinetic simulation of tokamak edge plasma

In order to enable kinetic simulation of non-thermal edge plasmas at a reduced computational cost, a new hybrid-Lagrangian δf scheme has been developed that utilizes the phase space grid in addition to the usual marker particles, taking advantage of the computational strengths from both sides. The new scheme splits the particle distribution function of a kinetic equation into two parts. Marker particles contain the fast space-time varying, δf, part of the distribution function and the coarse-grained phase-space grid contains the slow space-time varying part. The coarse-grained phase-space grid reduces the memory-requirement and the computing cost, while the marker particles provide scalable computing ability for the fine-grained physics. Weights of the marker particles are determined by a direct weight evolution equation instead of the differential form weight evolution equations that the conventional delta-f schemes use. The particle weight can be slowly transferred to the phase space grid, thereby reducing the growth of the particle weights. The non-Lagrangian part of the kinetic equation – e.g., collision operation, ionization, charge exchange, heat-source, radiative cooling, and others – can be operated directly on the phase space grid. Deviation of the particle distribution function on the velocity grid from a Maxwellian distribution function – driven by ionization, charge exchange and wall loss – is allowed to be arbitrarily large. The numerical scheme is implemented in the gyrokinetic particle code XGC1, which specializes in simulating the tokamak edge plasma that crosses the magnetic separatrix and is in contact with the material wall.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

GSRP/David Marshall: Fully Automated Cartesian Grid CFD Application for MDO in High Speed Flows

With the renewed interest in Cartesian gridding methodologies for the ease and speed of gridding complex geometries in addition to the simplicity of the control volumes used in the computations, it has become important to investigate ways of extending the existing Cartesian grid solver functionalities. This includes developing methods of modeling the viscous effects in order to utilize Cartesian grids solvers for accurate drag predictions and addressing the issues related to the distributed memory parallelization of Cartesian solvers. This research presents advances in two areas of interest in Cartesian grid solvers, viscous effects modeling and MPI parallelization. The development of viscous effects modeling using solely Cartesian grids has been hampered by the widely varying control volume sizes associated with the mesh refinement and the cut cells associated with the solid surface. This problem is being addressed by using physically based modeling techniques to update the state vectors of the cut cells and removing them from the finite volume integration scheme. This work is performed on a new Cartesian grid solver, NASCART-GT, with modifications to its cut cell functionality. The development of MPI parallelization addresses issues associated with utilizing Cartesian solvers on distributed memory parallel environments. This work is performed on an existing Cartesian grid solver, CART3D, with modifications to its parallelization methodology.

Source record↗

Unconventional spin distributions in thick Ni{sub 80}Fe{sub 20} nanodisks

We study the spin distributions in permalloy (Py: Ni{sub 80}Fe{sub 20}) nanodisks as a function of diameter D (300 nm ≤ D ≤ 1 μm) and thickness L (30 nm ≤ L ≤ 100 nm). We observed that beyond a certain thickness, for a fixed disk diameter, an unconventional spin topology precipitates which is marked by the presence of a divergence field within the magnetic vortex curl. The strength of this divergence changes anti-symmetrically from negative to positive—depending on the core polarity—along the axis of the cylindrical nanodisk. This is also accompanied by a skyrmion-like out-of-plane bending of the spin vectors farther away from the disk center. Additionally, the vortex core dilates significantly when compared to its typical size. This has been directly observed using magnetic force microscopy. We determined from the ferromagnetic resonance spectroscopy measurements that the unconventional topology in the thicker nanodisks gyrated at a frequency, which is significantly lower than what is predicted by a magnetic vortex based analytical model. Micromagnetic simulations involving dipolar and exchange interactions appear to satisfactorily reproduce the experimentally observed static and dynamic behaviors. Besides providing a physical example of an unconventional topology, these results can also aid the design of topologically protected memory elements.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Technique for Solving Electrically Small to Large Structures for Broadband Applications

Fast iterative algorithms are often used for solving Method of Moments (MoM) systems, having a large number of unknowns, to determine current distribution and other parameters. The most commonly used fast methods include the fast multipole method (FMM), the precorrected fast Fourier transform (PFFT), and low-rank QR compression methods. These methods reduce the O(N) memory and time requirements to O(N log N) by compressing the dense MoM system so as to exploit the physics of Green s Function interactions. FFT-based techniques for solving such problems are efficient for spacefilling and uniform structures, but their performance substantially degrades for non-uniformly distributed structures due to the inherent need to employ a uniform global grid. FMM or QR techniques are better suited than FFT techniques; however, neither the FMM nor the QR technique can be used at all frequencies. This method has been developed to efficiently solve for a desired parameter of a system or device that can include both electrically large FMM elements, and electrically small QR elements. The system or device is set up as an oct-tree structure that can include regions of both the FMM type and the QR type. The system is enclosed with a cube at a 0- th level, splitting the cube at the 0-th level into eight child cubes. This forms cubes at a 1st level, recursively repeating the splitting process for cubes at successive levels until a desired number of levels is created. For each cube that is thus formed, neighbor lists and interaction lists are maintained. An iterative solver is then used to determine a first matrix vector product for any electrically large elements as well as a second matrix vector product for any electrically small elements that are included in the structure. These matrix vector products for the electrically large and small elements are combined, and a net delta for a combination of the matrix vector products is determined. The iteration continues until a net delta is obtained that is within the predefined limits. The matrix vector products that were last obtained are used to solve for the desired parameter. The solution for the desired parameter is then presented to a user in a tangible form; for example, on a display.

Jandhyala, Vikram↗

Heterogeneous scalable framework for multiphase flows

Two categories of challenges confront the developer of computational spray models: those related to the computation and those related to the physics. Regarding the computation, the trend towards heterogeneous, multi- and many-core platforms will require considerable re-engineering of codes written for the current supercomputing platforms. Regarding the physics, accurate methods for transferring mass, momentum and energy from the dispersed phase onto the carrier fluid grid have so far eluded modelers. Significant challenges also lie at the intersection between these two categories. To be competitive, any physics model must be expressible in a parallel algorithm that performs well on evolving computer platforms. This work created an application based on a software architecture where the physics and software concerns are separated in a way that adds flexibility to both. The develop spray-tracking package includes an application programming interface (API) that abstracts away the platform-dependent parallelization concerns, enabling the scientific programmer to write serial code that the API resolves into parallel processes and threads of execution. The project also developed the infrastructure required to provide similar API s to other application. The API allow object-oriented Fortran applications direct interaction with Trilinos to support memory management of distributed objects in central processing units (CPU) and graphic processing units (GPU) nodes for applications using C++.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Experiments and Analyses of Data Transfers Over Wide-Area Dedicated Connections

Dedicated wide-area network connections are increasingly employed in high-performance computing and big data scenarios. One might expect the performance and dynamics of data transfers over such connections to be easy to analyze due to the lack of competing traffic. However, non-linear transport dynamics and end-system complexities (e.g., multi-core hosts and distributed filesystems) can in fact make analysis surprisingly challenging. We present extensive measurements of memory-to-memory and disk-to-disk file transfers over 10 Gbps physical and emulated connections with 0–366 ms round trip times (RTTs). For memory-to-memory transfers, profiles of both TCP and UDT throughput as a function of RTT show concave and convex regions; large buffer sizes and more parallel flows lead to wider concave regions, which are highly desirable. TCP and UDT both also display complex throughput dynamics, as indicated by their Poincare maps and Lyapunov exponents. For disk-to-disk transfers, we determine that high throughput can be achieved via a combination of parallel I/O threads, parallel network threads, and direct I/O mode. Our measurements also show that Lustre filesystems can be mounted over long-haul connections using LNet routers, although challenges remain in jointly optimizing file I/O and transport method parameters to achieve peak throughput.

Rao, Nageswara S.↗

On Data Transfers Over Wide-Area Dedicated Connections

Dedicated wide-area network connections are employed in big data and high-performance computing scenarios, since the absence of cross-traffic promises to make it easier to analyze and optimize data transfers over them. However, nonlinear transport dynamics and end-system complexity due to multi-core hosts and distributed file systems make these tasks surprisingly challenging. We present an overview of methods to analyze memory and disk file transfers using extensive measurements over 10 Gbps physical and emulated connections with 0–366 ms round trip times (RTTs). For memory transfers, we derive performance profiles of TCP and UDT throughput as a function of RTT, which show concave regions in contrast to entirely convex regions predicted by previous models. These highly desirable concave regions can be expanded by utilizing large buffers and more parallel flows. We also present Poincar´e maps and Lyapunov exponents of TCP and UDT throughputtraces that indicate complex throughput dynamics. For disk file transfers, we show that throughput can be optimized using a combination of parallel I/O and network threads under direct I/O mode. Our initial throughput measurements of Lustre filesystems mounted over long-haul connections using LNet routers show convex profiles indicative of I/O limits.

Rao, Nageswara S.↗

I/O Parallelization for the Goddard Earth Observing System Data Assimilation System (GEOS DAS)

The National Aeronautics and Space Administration (NASA) Data Assimilation Office (DAO) at the Goddard Space Flight Center (GSFC) has developed the GEOS DAS, a data assimilation system that provides production support for NASA missions and will support NASA's Earth Observing System (EOS) in the coming years. The GEOS DAS will be used to provide background fields of meteorological quantities to EOS satellite instrument teams for use in their data algorithms as well as providing assimilated data sets for climate studies on decadal time scales. The DAO has been involved in prototyping parallel implementations of the GEOS DAS for a number of years and is now embarking on an effort to convert the production version from shared-memory parallelism to distributed-memory parallelism using the portable Message-Passing Interface (MPI). The GEOS DAS consists of two main components, an atmospheric General Circulation Model (GCM) and a Physical-space Statistical Analysis System (PSAS). The GCM operates on data that are stored on a regular grid while PSAS works with observational data that are scattered irregularly throughout the atmosphere. As a result, the two components have different data decompositions. The GCM is decomposed horizontally as a checkerboard with all vertical levels of each box existing on the same processing element(PE). The dynamical core of the GCM can also operate on a rotated grid, which requires communication-intensive grid transformations during GCM integration. PSAS groups observations on PEs in a more irregular and dynamic fashion.

Lucchesi, Rob↗