Search NASA⌕ Search

SEARCH · Search NASA

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

Let’s get our hands dirty: a comprehensive evaluation of DAQDB, key-value store for petascale hot storage

Data acquisition systems are a key component for successful data taking in any experiment. The DAQ is a complex distributed computing system and coordinates all operations, from the data selection stage of interesting events to storage elements. For the High Luminosity upgrade of the Large Hadron Collider, the experiments at CERN need to meet challenging requirements to record data with a much higher occupancy in the detectors. The DAQ system will receive and deliver data with a significantly increased trigger rate, one million events per second, and capacity, terabytes of data per second. An effective way to meet these requirements is to decouple real-time data acquisition from event selection. Data fragments can be temporarily stored in a large distributed key-value store. Fragments belonging to the same event can be then queried on demand, by the data selection processes. Implementing such a model relies on a proper combination of emerging technologies, such as persistent memory, NVMe SSDs, scalable networking, and data structures, as well as high performance, scalable software. In this paper, we present DAQDB (Data Acquisition Database) — an open source implementation of this design that was presented earlier, with an extensive evaluation of this approach, from the single node to the distributed performance. Furthermore, we complement our study with a description of the challenges faced and the lessons learned while integrating DAQDB with the existing software framework of the ATLAS experiment.

Abed Abud, Adam↗

Flexible Data-Aware Scheduling for Workflows over an In-Memory Object Store

This paper explores novel techniques for improving the performance of many-task workflows based on the Swift scripting language. We propose novel programmer options for automated distributed data placement and task scheduling. These options trigger a data placement mechanism used for distributing intermediate workflow data over the servers of Hercules, a distributed key-value store that can be used to cache file system data. We demonstrate that these new mechanisms can significantly improve the aggregated throughput of many-task workflows with up to 86x, reduce the contention on the shared file system, exploit the data locality, and trade off locality and load balance.

Duro, Francisco Rodrigo↗

Efficient learning of t -doped stabilizer states with single-copy measurements

One of the primary objectives in the field of quantum state learning is to develop algorithms that are time-efficient for learning states generated from quantum circuits. Earlier investigations have demonstrated time-efficient algorithms for states generated from Clifford circuits with at most log ⁡ ( n ) non-Clifford gates. However, these algorithms necessitate multi-copy measurements, posing implementation challenges in the near term due to the requisite quantum memory. On the contrary, using solely single-qubit measurements in the computational basis is insufficient in learning even the output distribution of a Clifford circuit with one additional T gate under reasonable post-quantum cryptographic assumptions. In this work, we introduce an efficient quantum algorithm that employs only nonadaptive single-copy measurement to learn states produced by Clifford circuits with a maximum of O ( log ⁡ n ) non-Clifford gates, filling a gap between the previous positive and negative results.

Physics↗

Considerations for design of future research and development interactive image analysis systems

Future interactive image analysis systems must provide for the increased processing requirements imposed by a thermal channel to LANDSAT-3 and the increased number of spectral channels with significantly higher spatial resolution provided by the LANDSAT-D thematic mapper. Other design considerations must include the rapidly changing technology in memories and special purpose processors, as well as the analyst-machine interface and the human factors involved. The centralized and distributed system approaches are examined in relation to the optimum design configuration of future systems.

Wilkinson, T. B.↗

Rollable Thin-Shell Nanolaminate Mirrors

A class of lightweight, deployable, thin-shell, curved mirrors with built-in precise-shape-control actuators is being developed for high-resolution scientific imaging. This technology incorporates a combination of advanced design concepts in actuation and membrane optics that, heretofore, have been considered as separate innovations. These mirrors are conceived to be stowed compactly in a launch shroud and transported aboard spacecraft, then deployed in outer space to required precise shapes at much larger dimensions (diameters of the order of meters or tens of meters). A typical shell rollable mirror structure would include: (1) a flexible single- or multiple-layer face sheet that would include an integrated reflective surface layer that would constitute the mirror; (2) structural supports in the form of stiffeners made of a shape-memory alloy (SMA); and (3) piezoelectric actuators. The actuators, together with an electronic control subsystem, would implement a concept of hierarchical distributed control, in which (1) the SMA actuators would be used for global shape control and would generate the large deformations needed for the deployment process and (2) the piezoelectric actuators would generate smaller deformations and would be used primarily to effect fine local control of the shape of the mirror.

Hickey, Gregory↗

A fast and memory-sparing probabilistic selection algorithm for the GPU

A fast and memory-sparing probabilistic top-N selection algorithm is implemented on the GPU. This probabilistic algorithm gives a deterministic result and always terminates. The use of randomization reduces the amount of data that needs heavy processing, and so reduces both the memory requirements and the average time required for the algorithm. This algorithm is well-suited to more general parallel processors with multiple layers of memory hierarchy. Probabilistic Las Vegas algorithms of this kind are a form of stochastic optimization and can be especially useful for processors having a limited amount of fast memory available.

99 GENERAL AND MISCELLANEOUS↗

An Overview of High Performance Computing and Challenges for the Future

In this talk we examine how high performance computing has changed over the last 10-year and look toward the future in terms of trends. These changes have had and will continue to have a major impact on our software. A new generation of software libraries and algorithms are needed for the effective and reliable use of (wide area) dynamic, distributed and parallel environments. Some of the software and algorithm challenges have already been encountered, such as management of communication and memory hierarchies through a combination of compile--time and run--time techniques, but the increased scale of computation, depth of memory hierarchies, range of latencies, and increased run--time environment variability will make these problems much harder. We will focus on the redesign of software to fit multicore architectures. Speaker: Jack Dongarra University of Tennessee, Oak Ridge National Laboratory, and University of Manchester. Jack Dongarra received a Bachelor of Science in Mathematics from Chicago State University in 1972 and a Master of Science in Computer Science from the Illinois Institute of Technology in 1973. He received his Ph.D. in Applied Mathematics from the University of New Mexico in 1980. He worked at the Argonne National Laboratory until 1989, becoming a senior scientist. He now holds an appointment as University Distinguished Professor of Computer Science in the Electrical Engineering and Computer Science Department at the University of Tennessee, has the position of a Distinguished Research Staff member in the Computer Science and Mathematics Division at Oak Ridge National Laboratory (ORNL), Turing Fellow in the Computer Science and Mathematics Schools at the University of Manchester, and an Adjunct Professor in the Computer Science Department at Rice University. He specializes in numerical algorithms in linear algebra, parallel computing, the use of advanced-computer architectures, programming methodology, and tools for parallel computers. His research includes the development, testing and documentation of high quality mathematical software. He has contributed to the design and implementation of the following open source software packages and systems: EISPACK, LINPACK, the BLAS, LAPACK, ScaLAPACK, Netlib, PVM, MPI, NetSolve, Top500, ATLAS, and PAPI. He has published approximately 200 articles, papers, reports and technical memoranda and he is coauthor of several books. He was awarded the IEEE Sid Fernbach Award in 2004 for his contributions in the application of high performance computers using innovative approaches. He is a Fellow of the AAAS, ACM, and the IEEE and a member of the National Academy of Engineering.

97 MATHEMATICS AND COMPUTING↗

SU-E-T-531: Performance Evaluation of Multithreaded Geant4 for Proton Therapy Dose Calculations in a High Performance Computing Facility

Purpose: To evaluate the efficiency of multithreaded Geant4 (Geant4-MT, version 10.0) for proton Monte Carlo dose calculations using a high performance computing facility. Methods: Geant4-MT was used to calculate 3D dose distributions in 1×1×1 mm3 voxels in a water phantom and patient's head with a 150 MeV proton beam covering approximately 5×5 cm2 in the water phantom. Three timestamps were measured on the fly to separately analyze the required time for initialization (which cannot be parallelized), processing time of individual threads, and completion time. Scalability of averaged processing time per thread was calculated as a function of thread number (1, 100, 150, and 200) for both 1M and 50 M histories. The total memory usage was recorded. Results: Simulations with 50 M histories were fastest with 100 threads, taking approximately 1.3 hours and 6 hours for the water phantom and the CT data, respectively with better than 1.0 % statistical uncertainty. The calculations show 1/N scalability in the event loops for both cases. The gains from parallel calculations started to decrease with 150 threads. The memory usage increases linearly with number of threads. No critical failures were observed during the simulations. Conclusion: Multithreading in Geant4-MT decreased simulation time in proton dose distribution calculations by a factor of 64 and 54 at a near optimal 100 threads for water phantom and patient's data respectively. Further simulations will be done to determine the efficiency at the optimal thread number. Considering the trend of computer architecture development, utilizing Geant4-MT for radiotherapy simulations is an excellent cost-effective alternative for a distributed batch queuing system. However, because the scalability depends highly on simulation details, i.e., the ratio of the processing time of one event versus waiting time to access for the shared event queue, a performance evaluation as described is recommended.

60 APPLIED LIFE SCIENCES↗

Microstructure of selective laser melted nickel–titanium

In selective laser melting, the layer-wise local melting of metallic powder by means of a scanning focused laser beam leads to anisotropic microstructures, which reflect the pathway of the laser beam. We studied the impact of laser power, scanning speed, and laser path onto the microstructure of NiTi cylinders. Here, we varied the laser power from 56 to 100 W and the scanning speed from about 100 to 300 mm/s. In increasing the laser power, the grain width and length increased from (33 ± 7) to (90 ± 15) μm and from (60 ± 20) to (600 ± 200) μm, respectively. Also, the grain size distribution changed from uni- to bimodal. Ostwald-ripening of the crystallites explains the distinct bimodal size distributions. Decreasing the scanning speed did not alter the microstructure but led to increased phase transformation temperatures of up to 40 K. This was experimentally determined using differential scanning calorimetry and explained as a result of preferential nickel evaporation during the fabrication process. During selective laser melting of the NiTi shape memory alloy, the control of scanning speed allows restricted changes of the transformation temperatures, whereas controlling the laser power and scanning path enables us to tailor the microstructure, i.e. the crystallite shapes and arrangement, the extent of the preferred crystallographic orientation and the grain size distribution. - Highlights: • Higher laser powers during selective laser melting of NiTi lead to larger grains. • Selective laser melting of NiTi gives rise to preferred <111> orientation. • The observed Ni/Ti ratio depends on the exposure time. • Ostwald ripening explains the bimodal grain size distribution.

36 MATERIALS SCIENCE↗

A GPU-based compressible combustion solver for applications exhibiting disparate space and time scales

High-speed chemically active flows pose significant computational challenges due to their disparate space and time scales, with stiff chemistry often dominating simulation time. While modern scientific computing programs achieve exascale performance by leveraging graphics processing units (GPUs), existing GPU-based compressible combustion solvers face critical limitations in memory management, load balancing, and handling the highly localized nature of chemical reactions. To this end, we present a high-performance compressible reacting flow solver built on the AMReX framework and optimized for multi-GPU settings. Here, our approach addresses three GPU performance bottlenecks: memory access patterns through column-major storage optimization, computational workload variability via a bulk-sparse integration strategy for chemical kinetics, and multi-GPU load distribution for adaptive mesh refinement applications. The solver adapts existing matrix-based chemical kinetics formulations to multi-grid contexts. Using representative combustion applications, including 2D and 3D detonations and a 3D jet-in-crossflow configuration, we demonstrate 1.4–5× performance improvements over initial implementations on an in-house cluster of NVIDIA H100 GPUs, and near-ideal weak scaling on the Frontier supercomputer (Oak Ridge Leadership Computing Facility) with up to 1024 AMD Instinct MI250X GPUs. Roofline analysis reveals substantial improvements in arithmetic intensity for both convection (∼ 10 ×) and chemistry (∼ 4 ×) routines, confirming efficient utilization of GPU memory bandwidth and computational resources.

42 ENGINEERING↗

High Damping of Lightweight TiNi-Ti{sub 2}Ni Shape Memory Composites for Wide Temperature Range Usage

A bimodal porous TiNi-Ti{sub 2}Ni shape memory alloy composite (SMAC) with 59% porosity was fabricated by sintering Ti-46at.%Ni elemental powders with pore-forming agent. The porous TiNi-Ti{sub 2}Ni SMAC contains two irregular pores of about 400 and 120 μm. We investigated the microstructure and pore morphology correlated with the mechanical properties and damping capacities of the SMAC. Ti{sub 2}Ni intermetallic phases with size of 1-3 μm were homogeneously distributed in the TiNi matrix. The porous TiNi-Ti{sub 2}Ni SMAC exhibits exceptionally high inverse mechanical quality factor (Q{sup −1}) of ~0.25 at < 40 °C, which is among the highest value reported for porous/dense shape memory alloys or composites to best of our knowledge, and it shows very high compressive fracture strain of about 25%. Moreover, the fabricated porous SMAC at relatively low strain amplitude can exhibit considerable high Q{sup −1} of 0.06 ~ 0.11 for a wide range of temperature between − 90 and 200 °C, which is attributed to the stress concentration distribution provided by the bimodal structure of pores and the massive interfaces between pore/matrix and TiNi/Ti{sub 2}Ni. These porous SMACs can be an ideal candidate for using as a lightweight damping material in the energy-saving applications.

36 MATERIALS SCIENCE↗

Reducing uncertainty in personnel dosimetry calculations in the VHTR plant using MAVRIC

This work analyzes the efficacy of the MAVRIC sequence of the Scale 6.1 code package with respect to the accuracy of results and the ability to utilize large-memory, parallel machines. MAVRIC implements the hybrid FW-CADIS methodology to solve neutron and photon transport for shielding applications. Using the discrete ordinates method to solve the Boltzmann transport equation, an importance map is generated which MAVRIC then uses to bias a stochastic Monte Carlo simulation. The MAVRIC sequence is applied to generate neutron and photon dose rate distributions of improved accuracy in a model of a proposed VHTR power plant. Problems like this one, with a size on the order of magnitude of a nuclear power plant, require a prohibitive amount of memory to store complete importance maps. The issue is addressed by refining the mesh in areas around the source through the detector regions, while leaving a coarse mesh elsewhere. Additionally through the use of parallel computing, the angular flux can be expanded in higher quadrature sets, which leads to a better importance map while requiring no extra memory requirements during the Monte Carlo portion of the sequence. The final Monte Carlo simulations can be run concurrently on several machines with results combined after the fact, emulating parallelism that is not yet available in MAVRIC sequence. Using a combination of strategies, the MAVRIC sequence is shown to be able to scale across available computational resources, allowing the user to more quickly obtain Monte Carlo results with lower relative uncertainties in large, deep-penetration shielding problems. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

High-Q cavity interface for color centers in thin film diamond

Quantum information technology offers the potential to realize unprecedented computational resources via secure channels distributing entanglement between quantum computers. Diamond, as a host to optically-accessible spin qubits, is a leading platform to realize quantum memory nodes needed to extend such quantum links. Photonic crystal (PhC) cavities enhance light-matter interaction and are essential for an efficient interface between spins and photons that are used to store and communicate quantum information respectively. Here, we demonstrate one- and two-dimensional PhC cavities fabricated in thin-film diamonds, featuring quality factors (Q) of 1.8 × 10 5 and 1.6 × 10 5 , respectively, the highest Qs for visible PhC cavities realized in any material. Importantly, our fabrication process is simple and high-yield, based on conventional planar fabrication techniques, in contrast to the previous with complex undercut processes. We also demonstrate fiber-coupled 1D PhC cavities with high photon extraction efficiency, and optical coupling between a single SiV center and such a cavity at 4 K achieving a Purcell factor of 18. The demonstrated photonic platform may fundamentally improve the performance and scalability of quantum nodes and expedite the development of related technologies.

97 MATHEMATICS AND COMPUTING↗

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

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

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

UPC++ V1.0

UPC++ is a C++11 library providing classes and functions that support Partitioned Global Address Space (PGAS) programming. We are revising the library under the auspices of the DOE's Exascale Computing Project, to meet the needs of applications requiring PGAS support. UPC++ is intended for implementing elaborate distributed data structures where communication is irregular or fine-grained. The UPC++ interfaces for moving non-contiguous data and handling memories with different optimal access methods are composable and similar to those used in conventional C++. The UPC++ programmer can expect communication to run at close to hardware speeds. The key facilities in UPC++ are global pointers, that enable the programmer to express ownership information for improving locality, one-sided communication, both put/get and RPC, futures and continuations. Futures capture data readiness state, which is useful in making scheduling decisions, and continuations provide for completion handling via callbacks. Together, these enable the programmer to chain together a DAG of operations to execute asynchronously as high-latency dependencies become satisfied.

ECP↗

UPC++ Specification v1.0, Draft 4

UPC++ is a C++11 library providing classes and functions that support Asynchronous Partitioned Global Address Space (APGAS) programming. We are revising the library under the auspices of the DOE’s Exascale Computing Project, to meet the needs of applications requiring PGAS support. UPC++ is intended for implementing elaborate distributed data structures where communication is irregular or fine-grained. The UPC++ interfaces for moving non-contiguous data and handling memories with different optimal access methods are composable and similar to those used in conventional C++. The UPC++ programmer can expect communication to run at close to hardware speeds. The key facilities in UPC++ are global pointers, that enable the programmer to express ownership information for improving locality, one-sided communication, both put/get and RPC, futures and continuations. Futures capture data readiness state, which is useful in making scheduling decisions, and continuations provide for completion handling via callbacks. Together, these enable the programmer to chain together a DAG of operations to execute asynchronously as high-latency dependencies become satisfied.

97 MATHEMATICS AND COMPUTING↗

UPC++ Specification v1.0, Draft 6

UPC++ is a C++11 library providing classes and functions that support Partitioned Global Address Space (PGAS) programming. We are revising the library under the auspices of the DOE’s Exascale Computing Project, to meet the needs of applications requiring PGAS support. UPC++ is intended for implementing elaborate distributed data structures where communication is irregular or fine-grained. The UPC++ interfaces for moving non-contiguous data and handling memories with different optimal access methods are composable and similar to those used in conventional C++. The UPC++ programmer can expect communication to run at close to hardware speeds. The key facilities in UPC++ are global pointers, that enable the programmer to express ownership information for improving locality, one-sided communication, both put/get and RPC, futures and continuations. Futures capture data readiness state, which is useful in making scheduling decisions, and continuations provide for completion handling via callbacks. Together, these enable the programmer to chain together a DAG of operations to execute asynchronously as high-latency dependencies become satisfied.

97 MATHEMATICS AND COMPUTING↗

UPC++ Specification v1.0, Draft 10

UPC++ is a C++11 library providing classes and functions that support Partitioned Global Address Space (PGAS) programming. We are revising the library under the auspices of the DOE’s Exascale Computing Project, to meet the needs of applications requiring PGAS support. UPC++ is intended for implementing elaborate distributed data structures where communication is irregular or fine-grained. The UPC++ interfaces for moving non-contiguous data and handling memories with different optimal access methods are composable and similar to those used in conventional C++. The UPC++ programmer can expect communication to run at close to hardware speeds. The key facilities in UPC++ are global pointers, that enable the programmer to express ownership information for improving locality, one-sided communication, both put/get and RPC, futures and continuations. Futures capture data readiness state, which is useful in making scheduling decisions, and continuations provide for completion handling via callbacks. Together, these enable the programmer to chain together a DAG of operations to execute asynchronously as high-latency dependencies become satisfied.

97 MATHEMATICS AND COMPUTING↗