An Approach to QMU for Computational An Approach to QMU for Computational An Approach to QMU for Computational Analyses Involving Limited Resources.
Abstract not provided.
SEARCH · Search NASA
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.
Abstract not provided.
High-performance computing (HPC) plays an important role during the development of Earth system models. This chapter reviews HPC efforts related to Earth system models, including community Earth system models and energy exascale Earth system models. Specifically, this chapter evaluates computational and software design issues, analyzes several current HPC-related model developments, and provides an outlook for some promising areas within Earth system modeling in the era of exascale computing.
Hybrid quantum-classical workflows have become standard methods for executing variational algorithms and other quantum simulation techniques, which are key applications for noisy intermediate scale quantum (NISQ) computers. Validating these simulations is an important task which helps gauge the progress of quantum computer development, and classical simulation can serve as a tool to this end. Both exact and more scalable approximate methods with quantifiable error bounds can be used in validation tasks where the applicable metrics include the distance from a calculable ground truth, the quality of an error model fit to data, etc. Here we present a library extension that includes methods for validation of quantum simulations based on scalable hybrid workflows executable on high performance computers. We provide examples that use approximate methods based on tensor networks and stabilizer simulators to bound the error of quantum simulations on NISQ hardware.
Combustion instabilities in dilute internal combustion engines are manifest in cyclic variability (CV) in engine performance measures such as integrated heat release or shaft work. Understanding the factors leading to CV is important in model-based control, especially with high dilution where experimental studies have demonstrated that deterministic effects can become more prominent. Observation of enough consecutive engine cycles for significant statistical analysis is standard in experimental studies but is largely wanting in numerical simulations because of the computational time required to compute hundreds or thousands of consecutive cycles. We have proposed and begun implementation of an alternative approach to allow rapid simulation of long series of engine dynamics based on a low-dimensional mapping of ensembles of single-cycle simulations which map input parameters to output engine performance. This paper details the use Titan at the Oak Ridge Leadership Computing Facility to investigate CV in a gasoline direct-injected spark-ignited engine with a moderately high rate of dilution achieved through external exhaust gas recirculation. The CONVERGE™ CFD software was used to perform single-cycle simulations with imposed variations of operating parameters and boundary conditions selected according to a sparse grid sampling of the parameter space. Using an uncertainty quantification technique, the sampling scheme is chosen similar to a design of experiments grid but uses algorithms designed to minimize the number of samples required to achieve a desired degree of accuracy. The simulations map input parameters to output metrics of engine performance for a single cycle, and by mapping over a large parameter space, results can be interpolated from within that space. This interpolation scheme forms the basis for a low-dimensional ‘metamodel’ (or model of a model) which can be used to mimic the dynamical behavior of corresponding high-dimensional simulations. Simulations of high-EGR spark-ignition combustion cycles within a parametric sampling grid were performed and analyzed statistically, and sensitivities of the physical factors leading to high CV are presented. With these results, the prospect of producing low-dimensional metamodels to describe engine dynamics at any point in the parameter space will be discussed. Additionally, modifications to the methodology to account for nondeterministic effects in the numerical solution environment are proposed.
Multi-elemental alloy nanoparticles (MEA-NPs) hold great promise for catalyst discovery in a virtually unlimited compositional space. However, rational and controllable synthesize of these intrinsically complex structures remains a challenge. Here, we report the computationally aided, entropy-driven design and synthesis of highly efficient and durable catalyst MEA-NPs. The computational strategy includes prescreening of millions of compositions, prediction of alloy formation by density functional theory calculations, and examination of structural stability by a hybrid Monte Carlo and molecular dynamics method. Selected compositions can be efficiently and rapidly synthesized at high temperature (e.g., 1500 K, 0.5 s) with excellent thermal stability. We applied these MEA-NPs for catalytic NH 3 decomposition and observed outstanding performance due to the synergistic effect of multi-elemental mixing, their small size, and the alloy phase. We anticipate that the computationally aided rational design and rapid synthesis of MEA-NPs are broadly applicable for various catalytic reactions and will accelerate material discovery.
Node level heterogeneous architectures have become attractive during the last decade for several reasons: compared to traditional symmetric CPUs, they offer high peak performance and are energy and/or cost efficient. With the increase of fine-grained parallelism in high-performance computing, as well as the introduction of parallelism in workstations, there is an acute need for a good overview and understanding of these architectures. We give an overview of the state-of-the-art in heterogeneous computing, focusing on three commonly found architectures: the Cell Broadband Engine Architecture, graphics processing units (GPUs), and field programmable gate arrays (FPGAs).We present a review of hardware, available software tools, and an overview of state-of-the-art techniques and algorithms. Furthermore, we present a qualitative and quantitative comparison of the architectures, and give our view on the future of heterogeneous computing.
One of the most promising applications for quantum computers is the dynamic simulation of quantum materials. Current hardware, however, sets stringent limitations on how long such simulations can run before decoherence begins to corrupt results. The Jarzynski equality, a fluctuation theorem that allows for the computation of equilibrium free energy differences from an ensemble of short, non-equilibrium dynamics simulations, can make use of such short-time simulations on quantum computers. Here, we present a quantum algorithm based on the Jarzynski equality for computing free energies of quantum materials. We demonstrate our algorithm using the transverse field Ising model on both a quantum simulator and real quantum hardware. As the free energy is a central thermodynamic property that allows one to compute virtually any equilibrium property of a physical system, the ability to perform this algorithm for larger quantum systems in the future has implications for a wide range of applications including the construction of phase diagrams, prediction of transport properties and reaction constants, and computer-aided drug design.
The mission of the Computing Research Association’s Committee on Widening Participation in Computing Research (CRA-WP) is to widen the participation and improve the access, opportunities, and positive experiences of individuals from groups underrepresented in computing research and education. CRA-WP programs serve this overarching goal at all career stages; in addition, CRA-WP, through the formation of the CRA Center for Evaluating the Research Pipeline (CERP), has developed a methodology for thoroughly evaluating the success of its programs by comparing a nationwide sample of students, researchers, and faculty (non-participants) to program participants. Achieving these objectives requires that an increasing number of individuals from populations underrepresented in computing start and progress to the next stage while understanding and supporting the myriad computing pathways. CRA-WP offers programs for participants from undergraduate to senior professional levels. Different career stages need different types of interventions, and the goal of all Alliance program activities can be described within the unifying framework of Social Cognitive Career Theory, which finds that interest in and choice of a particular career path will be increased by interventions that improve one or more of the following: (1) outcome expectations (understanding and valuing the rewards of a particular outcome), (2) self-efficacy (a belief that one can successfully achieve an outcome), and (3) social supports that help one persist and overcome obstacles.
The application of data science in cancer research has been boosted by major advances in three primary areas: (1) Data: diversity, amount, and availability of biomedical data; (2) Advances in Artificial Intelligence (AI) and Machine Learning (ML) algorithms that enable learning from complex, large-scale data; and (3) Advances in computer architectures allowing unprecedented acceleration of simulation and machine learning algorithms. These advances help build in silico ML models that can provide transformative insights from data including: molecular dynamics simulations, next-generation sequencing, omics, imaging, and unstructured clinical text documents. Unique challenges persist, however, in building ML models related to cancer, including: (1) access, sharing, labeling, and integration of multimodal and multi-institutional data across different cancer types; (2) developing AI models for cancer research capable of scaling on next generation high performance computers; and (3) assessing robustness and reliability in the AI models. In this paper, we review the National Cancer Institute (NCI) -Department of Energy (DOE) collaboration, Joint Design of Advanced Computing Solutions for Cancer (JDACS4C), a multi-institution collaborative effort focused on advancing computing and data technologies to accelerate cancer research on three levels: molecular, cellular, and population. This collaboration integrates various types of generated data, pre-exascale compute resources, and advances in ML models to increase understanding of basic cancer biology, identify promising new treatment options, predict outcomes, and eventually prescribe specialized treatments for patients with cancer.
NREL's computational sciences center hosts the largest high performance computing (HPC) capabilities dedicated to energy research while functioning as a living laboratory for energy-efficient computing. NREL's HPC capabilities support the research needs of the Department of Energy's Office of Energy Efficiency and Renewable Energy (EERE). In ten years of operation, HPC use in EERE-sponsored research has grown by a factor of 30, including work in electricity generation, energy efficiency, transportation, and energy system modeling. This paper analyzes this research portfolio, providing examples of individual use cases. The paper documents NREL's history of operating one of the world's most energy-efficient data centers while examining pathways to reduce economic and environmental impact beyond reduction of Power Usage Efficiency (PUE). This paper concludes by examining the unique opportunities created for accelerating improvements in data center efficiency created by combining an HPC system dedicated to energy research and a research program in energy-efficient computing.
Computational methods underpin advancing the science and engineering of energy efficiency, sustainable transportation, renewable power technologies, and developing a knowledge base to optimize energy systems. NREL's Computational Science Center (CSC) proudly focuses on providing the service of computing, advancing the science of computing, and enabling NREL's clean energy mission.
Plant roots play a critical role in plant-soil-microbe interactions that occur in the rhizosphere, as well as processes with important implications to farming, forest management and climate change. X-ray computed tomography (XCT) has been proven to be an effective tool for non-invasive root imaging and analysis. A combination of XCT, open-source software, and our own code was used to noninvasively image a prairie dropseed (Sporobolus heterolepis) specimen, segment the root data to obtain a 3D image of the root structure at 31µm resolution, and extract quantitative information (root volume and surface area) from the 3D data, respectively. Based on the mesh generated from the root structure, computational fluid dynamics (CFD) simulations were applied to numerically investigate the root-soil-groundwater system. The plant root conductivity, soil hydraulic conductivity and transpiration rate were shown to control the groundwater distribution. The flow variability and soil water distributions under different scenarios were investigated. Parameterizations were evaluated to show their impacts on the average conductivity. The pore-scale modeling approach provides realistic simulations of rhizosphere flow processes and provides useful information that can be linked to upscaled models.
Purpose: To develop an automated system to safeguard radiation therapy treatments by analyzing electronic treatment records and reporting treatment events. Methods: CATERS (Computer Aided Treatment Event Recognition System) was developed to detect treatment events by retrieving and analyzing electronic treatment records. CATERS is designed to make the treatment monitoring process more efficient by automating the search of the electronic record for possible deviations from physician's intention, such as logical inconsistencies as well as aberrant treatment parameters (e.g., beam energy, dose, table position, prescription change, treatment overrides, etc). Over a 5 month period (July 2012–November 2012), physicists were assisted by the CATERS software in conducting normal weekly chart checks with the aims of (a) determining the relative frequency of particular events in the authors’ clinic and (b) incorporating these checks into the CATERS. During this study period, 491 patients were treated at the University of Iowa Hospitals and Clinics for a total of 7692 fractions. Results: All treatment records from the 5 month analysis period were evaluated using all the checks incorporated into CATERS after the training period. About 553 events were detected as being exceptions, although none of them had significant dosimetric impact on patient treatments. These events included every known event type that was discovered during the trial period. A frequency analysis of the events showed that the top three types of detected events were couch position override (3.2%), extra cone beam imaging (1.85%), and significant couch position deviation (1.31%). The significant couch deviation is defined as the number of treatments where couch vertical exceeded two times standard deviation of all couch verticals, or couch lateral/longitudinal exceeded three times standard deviation of all couch laterals and longitudinals. On average, the application takes about 1 s per patient when executed on either a desktop computer or a mobile device. Conclusions: CATERS offers an effective tool to detect and report treatment events. Automation and rapid processing enables electronic record interrogation daily, alerting the medical physicist of deviations potentially days prior to performing weekly check. The output of CATERS could also be utilized as an important input to failure mode and effects analysis.
High-throughput computational materials discovery has promised significant acceleration of the design and discovery of new materials for many years. Despite a surge in interest and activity, the constraints imposed by large-scale computational resources present a significant bottleneck. Furthermore, examples of large-scale computational discovery carried through experimental validation remain scarce, especially for materials with product applicability. In this paper, we demonstrate how this vision became reality by first combining state-of-the-art artificial intelligence (AI) models and traditional physics-based models on cloud high performance computing (HPC) resources to quickly navigate through more than 32 million candidates and predict around half a million potentially stable materials. Focusing on solid-state electrolytes for battery applications, our discovery pipeline further identified 18 promising candidates with new compositions and rediscovered a decade’s worth of collective knowledge in the field as a byproduct. By employing around one thousand virtual machines in the cloud, this process took less than 80 hours. We then synthesized and experimentally characterized the structures and conductivities of our top candidates, the Na x Li 3-x YCl 6 (0.5 ≤ x ≤ 2.5) series, demonstrating the potential of these compounds to serve as solid electrolytes. Additional candidate materials are currently under experimental investigation that could offer more examples of the computational discovery of new phases of Li- and Na-conducting solid electrolytes. We believe this unprecedented approach of synergistically integrating AI models and cloud HPC not only accelerates materials discovery but also showcases the potency of AI-guided experimentation in unlocking transformative scientific breakthroughs with real-world applications.
Demands from the commerce, finance, security, and logistics sectors drive the persistent growth of computing. As current research focuses on providing new computing capabilities using disruptive approaches, quantum computing represents a promising strategy that offers new capabilities in secure computation, trusted data storage, and efficient applications. Here, this article discusses the growing awareness that quantum computing can impact a broad variety of consumer concerns and applications.
Multiple tensor-times-matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimensional data analysis. Here, we establish communication lower bounds that determine how much data movement is required (under mild conditions) to perform the Multi-TTM computation in parallel. The crux of the proof relies on analytically solving a constrained, nonlinear optimization problem. We also present a parallel algorithm to perform this computation that organizes the processors into a logical grid with twice as many modes as the input tensor. We show that, with correct choices of grid dimensions, the communication cost of the algorithm attains the lower bounds and is therefore communication optimal. Finally, we show that our algorithm can significantly reduce communication compared to the straightforward approach of expressing the computation as a sequence of tensor-times-matrix operations when the input and output tensors vary greatly in size.
The widespread use of computing in the American economy would not be possible without a thoughtful, exploratory research and development (R&D) community pushing the performance edge of operating systems, computer languages, and software libraries. These are the tools and building blocks — the hammers, chisels, bricks, and mortar — of the smartphone, the cloud, and the computing services on which we rely. Engineers and scientists need ever-more specialized computing tools to discover new material properties for manufacturing, make energy generation safer and more efficient, and provide insight into the fundamentals of the universe, for example. The research division of the U.S. Department of Energy’s (DOE’s) Office of Advanced Scientific Computing and Research (ASCR Research) ensures that these tools and building blocks are being developed and honed to meet the extreme needs of modern science. See also http://exascaleage.org/ascr/ for additional information.
Neuromorphic computing is known for its integration of algorithms and hardware elements that are inspired by the brain. Conventionally, this nontraditional method of computing is used for many neural or learning inspired applications. Unfortunately, this has resulted in the field of neuromorphic computing being relatively narrow in scope. In this paper we discuss two research areas actively trying to widen the impact of neuromorphic systems. The first is Fugu, a high-level programming interface designed to bridge the gap between general computer scientists and those who specialize in neuromorphic areas. The second aims to map classical scientific computing problems onto these frameworks through the example of random walks. This elucidates a class of scientific applications that are conducive to neuromorphic algorithms.