Search NASA⌕ Search

SEARCH · Search NASA

Results for “scalable performance”

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 145 records · Page 8

A compute-bound formulation of Galerkin model reduction for linear time-invariant dynamical systems

This work aims to advance computational methods for projection-based reduced-order models (ROMs) of linear time-invariant (LTI) dynamical systems. For such systems, current practice relies on ROM formulations expressing the state as a rank-1 tensor (i.e., a vector), leading to computational kernels that are memory bandwidth bound and, therefore, ill-suited for scalable performance on modern architectures. This weakness can be particularly limiting when tackling many-query studies, where one needs to run a large number of simulations. This work introduces a reformulation, called rank-2 Galerkin, of the Galerkin ROM for LTI dynamical systems which converts the nature of the ROM problem from memory bandwidth to compute bound. We present the details of the formulation and its implementation, and demonstrate its utility through numerical experiments using, as a test case, the simulation of elastic seismic shear waves in an axisymmetric domain. We quantify and analyze performance and scaling results for varying numbers of threads and problem sizes. In conclusion, we present an end-to-end demonstration of using the rank-2 Galerkin ROM for a Monte Carlo sampling study. We show that the rank-2 Galerkin ROM is one order of magnitude more efficient than the rank-1 Galerkin ROM (the current practice) and about 970 times more efficient than the full-order model, while maintaining accuracy in both the mean and statistics of the field.

97 MATHEMATICS AND COMPUTING↗

Building complex event processing capability for intelligent environmental monitoring

Rapid evolution of Internet-of-Things is driving the increased deployment of smart sensors in environmental applications, contributing to many big data characteristics of environmental monitoring. Most of the current environmental monitoring systems are not designed to handle real-time datastreams, and the best practices for datastream processing and predictive analytics are yet to be established. This work presents a complex event processing (CEP) engine for detecting anomalies in real time, and demonstrates it using a series of real monitoring data from the geological carbon sequestration domain. We show that the service-based CEP engine is instrumental for enabling environmental intelligent monitoring systems to ingest heterogeneous datastreams with scalable performance. Our CEP framework requires minimal coding from the user and can be easily extended to other similar environmental monitoring applications.

54 ENVIRONMENTAL SCIENCES↗

WENO schemes on arbitrary unstructured meshes for laminar, transitional and turbulent flows

This paper presents the development and implementation of weighted-essentially-non-oscillatory (WENO) schemes for viscous flows on arbitrary unstructured grids. WENO schemes up to fifth-order accurate have been implemented in conjunction with hybrid and non-hybrid unstructured grids. The schemes are investigated with reference to numerical and experimental results for the Taylor–Green vortex, as well as for laminar and turbulent flows around a sphere, and the turbulent shock-wave boundary layer interaction flow problem. The results show that the accuracy of the schemes depends on the arbitrariness of shape and orientation of the unstructured mesh elements, as well as the compactness of directional stencils. The WENO schemes provide a more accurate numerical framework compared to second-order and third-order total variation diminishing (TVD) methods, however, the fifth-order version of the schemes is computationally too expensive to make the schemes practically usable. On the other hand, the third-order variant offers an excellent numerical framework in terms of accuracy and computational cost compared to the fifth-order WENO and second-order TVD schemes. Parallelisation of the CFD code (henceforth labelled as UCNS3D), where the schemes have been implemented, shows that the present methods offer very good scalable performance.

42 ENGINEERING↗

Revolutionizing Energy Storage: AI, Automation, and Advanced Modeling as Catalysts for Next-Generation Breakthroughs

The Presidential Symposium (PRES) at the 2025 Fall Meeting, hosted by the President’s Office and Energy and Fuels Division, American Chemical Society (ACS) in Washington, DC, brought together a diverse group of chemists, engineers, and materials scientists working in battery materials & systems, automation and artificial intelligence from academia, industry, and national laboratories. The accelerating demand for high-performance, scalable, and sustainable energy storage has catalyzed a paradigm shift in how materials are dis-covered, devices are engineered, and systems are optimized. This Presidential Symposium, entitled “Revolutionizing Energy Storage: AI, Automation, and Advanced Modeling Driving Next-Gen Breakthroughs”, brings together global leaders to unveil transformative strategies anchored in the AAA framework: Artificial Intelligence, Automation, and Advanced Modeling. Artificial Intelligence is redefining the frontiers of energy storage by enabling predictive design, real-time optimization, and intelligent control across diverse chemistries and architectures. Automation is streamlining the synthesis, characterization, and testing of battery materials, dramatically accelerating innovation cycles and unlocking scalable solutions for grid and mobility applications. Advanced Modeling, spanning atomic to system-level scales, provides unprecedented insight into electrochemical dynamics, degradation pathways, and thermal behavior, particularly when coupled with physics-informed machine learning and digital twin technologies. Digital twins, in turn, leverage the AAA framework by integrating real-time data, physics-based models, and AI predictions into dynamic virtual replicas, enabling proactive diagnostics, optimization, and system resilience. Together, these synergistic pillars are not only re-shaping the scientific landscape but also forging a new era of reproducible, data-driven, and resilient energy storage innovation. In conclusion, this symposium marks a pivotal moment in the convergence of computational intelligence and experimental rigor, charting the course for next-generation breakthroughs in lithium-ion, solid-state, and flow battery technologies.

Artificial Intelligence (AI)↗

Synthetic residential load models for smart city energy management simulations

The ability to control tens of thousands of residential electricity customers in a coordinated manner has the potential to enact system-wide electric load changes, such as reduce congestion and peak demand, among other benefits. To quantify the potential benefits of demand-side management and other power system simulation studies (e.g. home energy management, large-scale residential demand response), synthetic load datasets that accurately characterize the system load are required. This study designs a combined top-down and bottom-up approach for modelling individual residential customers and their individual electric assets, each possessing their own characteristics, using time-varying queueing models. The aggregation of all customer loads created by the queueing models represents a known city-sized load curve to be used in simulation studies. The three presented residential queueing load models use only publicly available data. An open-source Python tool to allow researchers to generate residential load data for their studies is also provided. The simulation results presented consider the ComEd region (utility company from Chicago, IL) and demonstrate the characteristics of the three proposed residential queueing load models, the impact of the choice of model parameters, and scalability performance of the Python tool.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NWChem: Past, present, and future

Specialized computational chemistry packages have permanently reshaped the landscape of chemical sciences by providing tools to support and guide the experimental effort and for prediction of chemical and materials properties. In this regard, a special role has been played by electronic structure packages where complex chemical and materials processes can be modeled using first-principle-driven methodologies. Over the last few decades, the rapid development of computing technologies and a tremendous increase in computational power has offered a unique chance to study complex chemical transformations using sophisticated and predictive many-body techniques to describe correlated behavior of electrons in molecular and condensed phase systems at different levels of theory. In enabling these simulations, a critical role has been played by novel parallel algorithms capable of taking advantage of computational resources to address polynomial scaling of electronic structure methods. NWChem was among the first electronic structure codes that focused on delivering scalable performance for electronic structure simulations. Herein, we briefly review the NWChem suite of computational codes including its history, design principles, parallel tools, current capabilities, outreach and outlook.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Self-radiography of imploded shells on OMEGA based on additive-free multi-monochromatic continuum spectral analysis

Radiographs of pure-DT cryogenic imploding shells provide critical validation of progress toward ignition-scalable performance of inertial confinement fusion implosions. Cryogenic implosions on the OMEGA Laser System can be self-radiographed by their own core spectral emission near ≈2 keV. Utilizing the distinct spectral dependences of continuum emissivity and opacity, the projected optical-thickness distribution of imploded shells, i.e., the shell radiograph, can be distinguished from the structure of the core emission distribution in images.Importantly, this can be done without relying on spectral additives (shell dopants), as in previous applications of implosion self-radiography. Furthermore, demonstrations with simulated data show that this technique is remarkably well-suited to cryogenic implosions and can also be applied to self-radiography of imploded room-temperature CH shells at higher spectral energy (hv ≈ 3–5 keV) based on the very similar continuum spectrum of carbon. Experimental demonstration of additive-free self-radiography with warm CH shell implosions on OMEGA will provide an important proof of principle for future applications to cryogenic DT implosions.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

METAREP: JCVI metagenomics reports—an open source tool for high-performance comparative metagenomics

JCVI Metagenomics Reports (METAREP) is a Web 2.0 application designed to help scientists analyze and compare annotated metagenomics datasets. It utilizes Solr/Lucene, a high performance scalable search engine, to quickly query large data collections. Furthermore, users can use its SQL-like query syntax to filter and refine datasets. METAREP provides graphical summaries for top taxonomic and functional classifications as well as a GO, NCBI Taxonomy and KEGG Pathway Browser. Users can compare absolute and relative counts of multiple datasets at various functional and taxonomic levels. Advanced comparative features comprise statistical tests as well as multidimensional scaling, heatmap and hierarchical clustering plots. Summaries can be exported as tab-delimited files, publication quality plots in PDF format. A data management layer allows collaborative data analysis and result sharing.

59 BASIC BIOLOGICAL SCIENCES↗

Scalable metagenomic taxonomy classification using a reference genome database

Motivation: Deep metagenomic sequencing of biological samples has the potential to recover otherwise difficult-to-detect microorganisms and accurately characterize biological samples with limited prior knowledge of sample contents. Existing metagenomic taxonomic classification algorithms, however, do not scale well to analyze large metagenomic datasets, and balancing classification accuracy with computational efficiency presents a fundamental challenge. Results: A method is presented to shift computational costs to an offline computation by creating a taxonomy/genome index that supports scalable metagenomic classification. Scalable performance is demonstrated on real and simulated data to show accurate classification in the presence of novel organisms on samples that include viruses, prokaryotes, fungi and protists. Taxonomic classification of the previously published 150 giga-base Tyrolean Iceman dataset was found to take520 h on a single node 40 core large memory machine and provide new insights on the metagenomic contents of the sample.

59 BASIC BIOLOGICAL SCIENCES↗

Exploring Hardware Support For Scaling Irregular Applications on Multi-node Multi-core Architectures

With the recent emergence of large-scale knowledge dis- covery, data mining and social network analysis, irregular applications have gained renewed interest. Classic cache-based high-performance architectures do not provide optimal performances with such kind of workloads, mainly due to the very low spatial and temporal locality of the irregular control and memory access patterns. In this paper, we present a multi-node, multi-core, fine-grained multi-threaded shared-memory system architecture specifically designed for the execution of large-scale irregular applications, and built on top of three pillars, that we believe are fundamental to support these workloads. First, we offer transparent hardware support for Partitioned Global Address Space (PGAS) to provide a large globally-shared address space with no software library overhead. Second, we employ multi-threaded multi-core processing nodes to achieve the necessary latency tolerance required by accessing global memory, which potentially resides in a remote node. Finally, we devise hardware support for inter-thread synchronization on the whole global address space. We first model the performances by using an analytical model that takes into account the main architecture and application characteristics. We describe the hardware design of the proposed cus- tom architectural building blocks that provide support for the above- mentioned three pillars. Finally, we present a limited-scale evaluation of the system on a multi-board FPGA prototype with typical irregular kernels and benchmarks. The experimental evaluation demonstrates the architecture performance scalability for different configurations of the whole system.

FPGA↗

Advancements in NbTiN based circuits for Superconducting Digital Logic

Superconducting (SC) electronics have emerged as a promising platform for high-speed, energy-efficient computing and quantum information processing. This work, centered on NbTiN, presents recent advances in material science and fabrication methods leading to significant improvements in performance, scalability and vertical integration. We specifically report on fabrication and characterization of key components, including Josephson junctions (JJs), flux trapping structures and SC interconnects. Together, these efforts represent critical steps towards realizing practical, complex, dense and large-scale SC integrated circuits.

Pokhrel, A. [Imec,Heverlee,Belgium]↗

A uGNI-based Asynchronous Message-driven Runtime System for Cray Supercomputers with Gemini Interconnect

Gemini, the network for the new Cray XE/XK systems, features low latency, high bandwidth and strong scalability. Its hardware support for remote direct memory access enables efficient implementation of the global address space programming languages. Although the user Generic Network Interface (uGNI) provides a low-level interface for Gemini with support to the message-passing programming model (MPI), it remains challenging to port alternative programming models with scalable performance. CHARM++ is an object-oriented message-driven programming model. Its applications have been shown to scale up to the full Jaguar Cray XT machine. In this paper, we present an implementation of this programming model on uGNI for the Cray XE/XK systems. Several techniques are presented to exploit the uGNI capabilites by reducing memory copy and registration overhead, taking advantage of the persistent communication, and improving intra-node communication. Our microbenchmark results demonstrate that the uGNI-based runtime system outperforms the MPI-based implementation by up to 50% in terms of message latency. For communication intensive applications such as N-Queens, this implementation scales up to 15, 360 cores of a Cray XE6 machine and is 70% faster than the MPI-based implementation. In molecular dynamics application NAMD, the performance is also considerably improved by as much as 18%.

Computer Science↗

Global Trees: A Framework for Linked Data Structures on Distributed Memory Parallel Systems

This paper describes the Global Trees (GT) system that provides a multi-layered interface to a global address space view of distributed tree data structures, while providing scalable performance on distributed memory systems. The Global Trees system utilizes coarse-grained data movement to enhance locality and communication efficiency. We describe the design and implementation of GT, illustrate its use in the context of a gravitational simulation application, and provide experimental results that demonstrate the effectiveness of the approach. The key benefits of using this system include efficient sharedmemory style programming of distributed trees, tree-specific optimizations for data access and computation, and the ability to customize many aspects of GT to optimize application performance.

97 MATHEMATICS AND COMPUTING↗

A Framework for Load Balancing of Tensor Contraction Expressions via Dynamic Task Partitioning

In this paper, we introduce the Dynamic Load-balanced Tensor Contractions (DLTC), a domain-specific library for efficient task parallel execution of tensor contraction expressions, a class of computation encountered in quantum chemistry and physics. Our framework decomposes each contraction into smaller unit of tasks, represented by an abstraction referred to as iterators. We exploit an extra level of parallelism by having tasks across independent contractions executed concurrently through a dynamic load balancing run- time. We demonstrate the improved performance, scalability, and flexibility for the computation of tensor contraction expressions on parallel computers using examples from coupled cluster methods.

Tensor contraction, domain-specific language, dyna↗

A Backend-agnostic, Quantum-classical Framework for Simulations of Chemistry in C ++

As quantum computing hardware systems continue to advance, the research and development of performant, scalable, and extensible software architectures, languages, models, and compilers is equally as important to bring this novel coprocessing capability to a diverse group of domain computational scientists. For the field of quantum chemistry, applications and frameworks exist for modeling and simulation tasks that scale on heterogeneous classical architectures, and we envision the need for similar frameworks on heterogeneous quantum-classical platforms. Furthermore, we present the XACC system-level quantum computing framework as a platform for prototyping, developing, and deploying quantum-classical software that specifically targets chemistry applications. We review the fundamental design features in XACC, with special attention to its extensibility and modularity for key quantum programming workflow interfaces and provide an overview of the interfaces most relevant to simulations of chemistry. A series of examples demonstrating some of the state-of-the-art chemistry algorithms currently implemented in XACC are presented, while also illustrating the various APIs that would enable the community to extend, modify, and devise new algorithms and applications in the realm of chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Modular Finite Element Methods (MFEM)

MFEM is a modular parallel C++ library for finite element methods. Its goal is to enable high-performance scalable finite element discretization research and application development on a wide variety of platforms, ranging from laptops to supercomputers.

Kolev, Tzanio↗

Approximate Weighted Matching On Emerging Manycore and Multithreaded Architectures

Graph matching is a prototypical combinatorial problem with many applications in computer science and scientific computing, but algorithms for computing optimal matchings are challenging to parallelize. Approximate matching algorithms provide an alternate route for parallelization, and in many contexts compute near-optimal matchings for large-scale graphs. We present sharedmemory parallel implementations for computing half-approximate weighted matching on state-of-the-art multicore (Intel Nehalem and AMD Magny-Cours), manycore (Nvidia Tesla and Nvidia Fermi) and massively multithreaded (Cray XMT) platforms. We provide two implementations: the first implementation uses shared work queues, and is suited to all these platforms; the second implementation is based on dataflow principles, and exploits the architectural features of the Cray XMT. Using a carefully chosen dataset that exhibits characteristics from a wide range of real-world applications, we show scalable performance across different platforms. In particular, for one instance of the input, an R-MAT graph (RMAT-G), we show speedups of: about 32 on 48 cores of an AMD Magny-Cours; 7 on 8 cores of Intel Nehalem; 3 on Nvidia Tesla and 10 on Nvidia Fermi relative to one core of Intel Nehalem; and 60 on 128 processors of Cray XMT. We demonstrate good weak and strong scaling for graphs with up to a billion edges using up to 12, 800 threads. Given the breadth of this work, we focus on simplicity and portability of software rather than excessive fine-tuning for each platform. To the best of our knowledge, this is the first such large-scale study of the half-approximate weighted matching problem on shared-memory platforms. Driven by the critical enabling role of combinatorial algorithms such as matching in scientific computing and the emergence of informatics applications, there is a growing demand to support irregular computations on current and future computing platforms. In this context, we evaluate the capability of emerging multithreaded platforms to tolerate latency induced by irregular memory access patterns, and to support fine-grained parallelism via light-weight synchronization mechanisms. By contrasting the architectural features of these platforms against the Cray XMT, which is specifically designed to support irregular memory-intensive applications, we delineate the impact of these choices on performance.

Halappanavar, Mahantesh↗

BigData Express: Toward Predictable, Schedulable, and High-Performance Data Transfer [Slides]

Big data has emerged as a driving force for scientific discoveries. Large scientific instruments (e.g., colliders, and telescopes) generate exponentially increasing volumes of data. To enable scientific discovery, science data must be collected, indexed, archived, shared, and analyzed, typically in a widely distributed and highly collaborative manner. Data transfer is now an essential function for science discoveries, particularly within big data environments. To support data transfer for big data science, there is a need for predictable, high performance, scalable, end-to-end, programmable networks that enable science applications to use network resources most efficiently. Software-Defined Networking (SDN) is a novel network architecture and technological approach that separates the network control and data planes.

97 MATHEMATICS AND COMPUTING↗