Search NASA⌕ Search

SEARCH · Search NASA

Results for “program processors”

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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
DOE OSTI2011

Exascale Hardware Architectures Working Group

The ASC Exascale Hardware Architecture working group is challenged to provide input on the following areas impacting the future use and usability of potential exascale computer systems: processor, memory, and interconnect architectures, as well as the power and resilience of these systems. Going forward, there are many challenging issues that will need to be addressed. First, power constraints in processor technologies will lead to steady increases in parallelism within a socket. Additionally, all cores may not be fully independent nor fully general purpose. Second, there is a clear trend toward less balanced machines, in terms of compute capability compared to memory and interconnect performance. In order to mitigate the memory issues, memory technologies will introduce 3D stacking, eventually moving on-socket and likely on-die, providing greatly increased bandwidth but unfortunately also likely providing smaller memory capacity per core. Off-socket memory, possibly in the form of non-volatile memory, will create a complex memory hierarchy. Third, communication energy will dominate the energy required to compute, such that interconnect power and bandwidth will have a significant impact. All of the above changes are driven by the need for greatly increased energy efficiency, as current technology will prove unsuitable for exascale, due to unsustainable power requirements of such a system. These changes will have the most significant impact on programming models and algorithms, but they will be felt across all layers of the machine. There is clear need to engage all ASC working groups in planning for how to deal with technological changes of this magnitude. The primary function of the Hardware Architecture Working Group is to facilitate codesign with hardware vendors to ensure future exascale platforms are capable of efficiently supporting the ASC applications, which in turn need to meet the mission needs of the NNSA Stockpile Stewardship Program. This issue is relatively immediate, as there is only a small window of opportunity to influence hardware design for 2018 machines. Given the short timeline a firm co-design methodology with vendors is of prime importance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2012

SDAV Viz July Progress Update: LANL

SDAV Viz July Progress Update: (1) VPIC (Vector Particle in Cell) Kinetic Plasma Simulation Code - (a) Implemented first version of an in-situ adapter based on Paraview CoProcessing Library, (b) Three pipelines: vtkDataSetMapper, vtkContourFilter, vtkPistonContour, (c) Next, resolve issue at boundaries of processor domains; add more advanced viz/analysis pipelines; (2) Halo finding/merger trees - (a) Summer student Wathsala W. from University of Utah is working on data-parallel halo finder algorithm using PISTON, (b) Timo Bremer (LLNL), Valerio Pascucci (Utah), George Zagaris (Kitware), and LANL people are interested in using merger trees for tracking the evolution of halos in cosmo simulations; discussed possible overlap with work by Salman Habib and Katrin Heitmann (Argonne) during their visit to LANL 7/11; (3) PISTON integration in ParaView - Now available from ParaView github.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Simulating the Effect of Fracture Connectivity on Repository Performance with GDSA Framework - 18589

This work examines the possible migration of radionuclides from a deep geologic nuclear waste repository sited in fractured crystalline host rock. The key safety concern is the potential effect on waste isolation of the inter-connectivity of the fracture network, which is primarily established by the temporal evolution of the temperature and stress fields at the time of original rock intrusion and cooling. Two end members are considered in these simulations, one with a high degree of connectivity to the biosphere, such that advective transport through the fracture and fault network controls radionuclide migration, and the other with a low degree of connectivity, such that slow diffusive transport through the crystalline rock matrix is the controlling process for radionuclide migration to the biosphere. Both end members have several areally extensive, high-transmissivity deformation zones, whose distance to the repository is an important factor for waste isolation capability. Uncertainties in fracture properties (transmissivity, orientation, radius) and fracture distribution also give rise to uncertainty in waste isolation capability (i.e., the overall connectivity of the repository with the surface biosphere). These types of natural system uncertainties are generally present in any geologic site-characterization program and thus represent an important factor in assessing repository performance in hard rock environments. The waste considered in these simulations are spent fuel rod assemblies from the U.S. commercial nuclear reactor fleet. Thermal output of the waste must be considered in the simulations and can influence the rate and timing of waste package failure, waste form degradation, and fluid flux due to thermal expansion around the repository horizon. To achieve a high-fidelity representation of radionuclide transport in fractures and rock matrix, combined with thermal energy transport and fluid flow in fractures and matrix, the mathematical model is solved numerically in a parallel high-performance computing (HPC) environment on a finite volume unstructured grid consisting of approximately 5 million cells, using Geologic Disposal Safety Assessment (GDSA) Framework (https://pa.sandia.gov), an open-source performance assessment tool for deep underground disposal of nuclear waste. GDSA Framework uses PFLOTRAN to solve the balance equations on a three-dimensional grid with heterogeneous properties, using multiple processors in a parallel configuration based on domain decomposition. The fracture networks in these simulations are originally generated as discrete fracture networks (DFNs), which are sets of two-dimensional planes distributed in a three-dimensional domain. The method used in GDSA Framework maps the stochastically generated DFN to an equivalent continuous porous medium (ECPM) domain that allows for the simulation of coupled heat flow, fluid flow, and radionuclide transport, including heat conduction through the matrix of the fractured rock, which is a process not easily modeled in a DFN representation. Computational efficiency is also greatly enhanced using the ECPM method, allowing for a realistic representation and analysis of uncertainties in a multi-realization performance assessment of a deep geologic repository. The effect of fracture connectivity on the waste isolation safety function, as brought to light by these GDSA Framework simulations, points to the importance of including a realistic representation of uncertainties in fracture properties and distribution (effectively, uncertainty in spatial heterogeneity) in repository safety assessment simulations. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2012

Instrumentation and Equipment for Three Independent Research Labs

Completed in 2011, Albright's new Science Center includes three independent student and faculty research labs in Biology, Chemistry/Biochemistry, and Physics (separate from teaching labs). Providing independent research facilities, they eliminate disruptions in classrooms and teaching labs, encourage and accommodate increased student interest, and stimulate advanced research. The DOE grant of $369,943 enabled Albright to equip these advanced labs for 21st century science research, with much instrumentation shared among departments. The specialty labs will enable Albright to expand its student-faculty research program to meet growing interest, help attract superior science students, maximize faculty expertise, and continue exceeding its already high rates of acceptance for students applying for postgraduate education or pharmaceutical research positions. Biology instrumentation/equipment supports coursework and independent and collaborative research by students and faculty. The digital shaker, CO 2 and water bath incubators (for controlled cell growth), balance, and micropipettes support cellular biology research in the advanced cell biology course and student-faculty research into heavy metal induction of heat shock proteins in cultured mammalian cells and the development of PCR markers from different populations of the native tree, Franklinia. The gravity convection oven and lyophilizer support research into physical and chemical analysis of floodplain sediments used in assessment of riparian restoration efforts. The Bio-Rad thermocycler permits fast and accurate DNA amplification as part of research into genetic diversity in small mammal populations and how those populations are affected by land-use practices and environmental management. The Millipore water deionizing system and glassware washer provide general support of the independent research lab and ensure quality control of coursework and interdisciplinary research at the intersection of biology, chemistry, and toxicology. Grant purchases support faculty and students working in the areas of plant cellular biology, landscape ecology and wildlife management, wetland restoration, and ecotoxicology of aquatic invertebrates. Chemistry/BioChemistry instrumentation supports a wide range of research and teaching needs. The Dell quad core Xeon processors and Gaussian 09 support computational research efforts of two of our faculty. The computational work of one of these groups is part of close collaboration with one organic chemist and provides support info for the synthetic work of this professor and his students. Computational chemistry studies were also introduced into the physical chemistry laboratory course for junior chemistry concentrators. The AKTA plus system and superdex columns, Thermoscientific Sorvall RC-6 plus superspeed centrifuge, Nanodrop spectrometer, Eppendorf microfuge, Homogenizer and Pipetman pipetters were incorporated into a research project involving purification and characterization of a construct of beta 2-microglobulin by one of our biochemists. The vacuum system (glove box, stand, and pump) makes a significant contribution to the research of our inorganic chemist, the newest department member, working on research projects with four students. The glove box provides the means to carry out their synthetic work in an oxygenless atmosphere. Supporting basic research pursued by faculty and students, the remaining items (refrigerator/freezer units for flammable storage, freezer, refrigerated water bath, rotary evaporator system, vacuum oven, analytical and top-loading balances) were distributed between our biochemistry and chemistry research labs. The Nanodrop spectrometer, Sorvall centrifuge, and rotary evaporator system are used in several junior/senior lab courses in both biochemistry and chemistry. To date, 14 undergraduate research students have been involved in projects using the new instrumentation and equipment provided by this grant. Physics equipment acquired is radically transforming Albright research and teaching capabilities. The two main purchases are an atomic force microscope (AFM) and a scanning tunneling microscope (STM). These two devices allow us to view surfaces at much higher resolution than ever before, even to the level of individual atoms. Already the AFM has been incorporated into courses for advanced physics and biology students, allowing them to view at high resolution material such as carbon nanotubes, cell structure, and proteins. These devices offer possibilities for interdisciplinary collaboration among students and faculty in various departments that have barely begun to be tapped. Additional equipment, such as software, optical tables, lasers, and other support equipment, is also strengthening our research and teaching capabilities in optics-related areas.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2020

OpenSNAPI: Toward a Unified API for SmartNICs

The end of Moore’s Law and Dennard Scaling has produced a renaissance in the field of computer architecture. Unable to continue leveraging silicon-level processor improvements to further enhance performance and scalability, system architects have been forced to explore other options. In this new era of heterogeneous architectures and hardware/software codesign, a new class of devices known as “accelerators” has emerged. Independently designed for optimized execution of distinct workloads, these devices have proven critical to the continued advancement of application performance. SmartNICs, accelerator devices integrated with a network controller, have conventionally been utilized to offload low-level networking functionality. However, newer SmartNIC variants, which incorporate a system-on-chip (SoC) with traditional designs, are challenging this precedent. Leveraging significantly augmented resources, these new devices offer increased versatility and the potential to more effectively complement a given architecture’s CPU. In this talk, we introduce the motivation underlying acceleration, explore the fundamentals of SmartNICs, and discuss traditional use cases. We also detail our initial efforts to investigate the feasibility and benefits of SmartNICs as general-purpose accelerators. We present the OpenSNAPI project created to define a uniform application programming interface (API) for this emerging class of devices. Finally, we provide a brief tutorial regarding development of SmartNIC-accelerated applications on Los Alamos National Laboratory’s SmartNIC-enabled platforms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Novel Geometric Operations for Linear Programming

This report summarizes the work performed under the project "Linear Programming in Strongly Polynomial Time." Linear programming (LP) is a classic combinatorial optimization problem heavily used directly and as an enabling subroutine in integer programming (IP). Specifically IP is the same as LP except that some solution variables must take integer values (e.g. to represent yes/no decisions). Together LP and IP have many applications in resource allocation including general logistics, and infrastructure design and vulnerability analysis. The project was motivated by the PI's recent success developing methods to efficiently sample Voronoi vertices (essentially finding nearest neighbors in high-dimensional point sets) in arbitrary dimension. His method seems applicable to exploring the high-dimensional convex feasible space of an LP problem. Although the project did not provably find a strongly-polynomial algorithm, it explored multiple algorithm classes. The new medial simplex algorithms may still lead to solvers with improved provable complexity. We describe medial simplex algorithms and some relevant structural/complexity results. We also designed a novel parallel LP algorithm based on our geometric insights and implemented it in the Spoke-LP code. A major part of the computational step is many independent vector dot products. Our parallel algorithm distributes the problem constraints across processors. Current commercial and high-quality free LP solvers require all problem details to fit onto a single processor or multicore. Our new algorithm might enable the solution of problems too large for any current LP solvers. We describe our new algorithm, give preliminary proof-of-concept experiments, and describe a new generator for arbitrarily large LP instances.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Experimental design applications for modeling and assessing carbon dioxide sequestration in saline aquifers

This project was a computer modeling effort to couple reservoir simulation and ED/RSM using Sensitivity Analysis, Uncertainty Analysis, and Optimization Methods, to assess geologic, geochemical, geomechanical, and rock-fluid effects and factors on CO 2 injectivity, capacity, and plume migration. The project objective was to develop proxy models to simplify the highly complex coupled geochemical and geomechanical models in the utilization and storage of CO 2 in the subsurface. The goals were to investigate and prove the feasibility of the ED/RSM processes and engineering development, and bridge the gaps regarding the uncertainty and unknowns of the many geochemical and geomechanical interacting parameters in the development and operation of anthropogenic CO 2 sequestration and storage sites. The bottleneck in this workflow is the high computational effort of reactive transport simulation models and large number of input variables to optimize with ED/RSM techniques. The project was not to develop the reactive transport, geomechanical, or ED/RSM software, but was to use what was commercially and/or publically available as a proof of concept to generate proxy or surrogate models. A detailed geologic and petrographic mineral assemblage and geologic structure of the doubly plunging anticline was defined using the USDOE RMOTC formations of interest data (e.g., Lower Sundance, Crow Mountain, Alcova Limestone, and Red Peak). The assemblage of 23 minerals was primarily developed from literature data and petrophysical (well log) analysis. The assemblage and structure was input into a commercial reactive transport simulator to predict the effects of CO 2 injection and complex reactions with the reservoir rock. Significant impediments were encountered during the execution phase of the project. The only known commercial reactive transport simulator was incapable of simulating complex geochemistry modeled in this project. Significant effort and project funding was expended to determine the limitations of both the commercial simulator and the Lawrence Berkeley National Laboratory (LBNL) R&D simulator, TOUGHREACT available to the project. A simplified layer cake model approximating the volume of the RMOTC targeted reservoirs was defined with 1-3 minerals eventually modeled with limited success. Modeling reactive transport in porous media requires significant computational power. In this project, up to 24 processors were used to model a limited mineral set of 1-3 minerals. In addition, geomechanical aspects of injecting CO 2 into closed, semi-open, and open systems in various well completion methods was simulated. Enhanced Oil Recovery (EOR) as a storage method was not modeled. A robust and stable simulation dataset or base case was developed and used to create a master dataset with embedded instructions for input to the ED/RSM software. Little success was achieved toward the objective of the project using the commercial simulator or the LBNL simulator versions available during the time of this project. Several hundred realizations were run with the commercial simulator and ED/RSM software, most having convergence problems and terminating prematurely. A proxy model for full field CO 2 injection sequestration utilization and storage was not capable of being developed with software available for this project. Though the chemistry is reasonably known and understood, based on the amount of effort and huge computational time required, predicting CO 2 sequestration storage capacity in geologic formations to within the program goals of ±30% proved unsuccessful.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2014

Energy-aware Thread and Data Management in Heterogeneous Multi-core, Multi-memory Systems

By 2004, microprocessor design focused on multicore scaling—increasing the number of cores per die in each generation—as the primary strategy for improving performance. These multicore processors typically equip multiple memory subsystems to improve data throughput. In addition, these systems employ heterogeneous processors such as GPUs and heterogeneous memories like non-volatile memory to improve performance, capacity, and energy efficiency. With the increasing volume of hardware resources and system complexity caused by heterogeneity, future systems will require intelligent ways to manage hardware resources. Early research to improve performance and energy efficiency on heterogeneous, multi-core, multi-memory systems focused on tuning a single primitive or at best a few primitives in the systems. The key limitation of past efforts is their lack of a holistic approach to resource management that balances the tradeoff between performance and energy consumption. In addition, the shift from simple, homogeneous systems to these heterogeneous, multicore, multi-memory systems requires in-depth understanding of efficient resource management for scalable execution, including new models that capture the interchange between performance and energy, smarter resource management strategies, and novel low-level performance/energy tuning primitives and runtime systems. Tuning an application to control available resources efficiently has become a daunting challenge; managing resources in automation is still a dark art since the tradeoffs among programming, energy, and performance remain insufficiently understood. In this dissertation, I have developed theories, models, and resource management techniques to enable energy-efficient execution of parallel applications through thread and data management in these heterogeneous multi-core, multi-memory systems. I study the effect of dynamic concurrent throttling on the performance and energy of multi-core, non-uniform memory access (NUMA) systems. I use critical path analysis to quantify memory contention in the NUMA memory system and determine thread mappings. In addition, I implement a runtime system that combines concurrent throttling and a novel thread mapping algorithm to manage thread resources and improve energy efficient execution in multi-core, NUMA systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Extreme-Scale Algorithms & Software Resilience (EASIR) Architecture-Aware Algorithms for Scalable Performance and Resilience on Heterogeneous Architectures

This project addresses both communication-avoiding algorithms, and reproducible floating-point computation. Communication, i.e. moving data, either between levels of memory or processors over a network, is much more expensive per operation than arithmetic (measured in time or energy), so we seek algorithms that greatly reduce communication. We developed many new algorithms for both dense and sparse, and both direct and iterative linear algebra, attaining new communication lower bounds, and getting large speedups in many cases. We also extended this work in several ways: (1) We minimize writes separately from reads, since writes may be much more expensive than reads on emerging memory technologies, like Flash, sometimes doing asymptotically fewer writes than reads. (2) We extend the lower bounds and optimal algorithms to arbitrary algorithms that may be expressed as perfectly nested loops accessing arrays, where the array subscripts may be arbitrary affine functions of the loop indices (eg A(i), B(i,j+k, k+3*m-7, …) etc.). (3) We extend our communication-avoiding approach to some machine learning algorithms, such as support vector machines. This work has won a number of awards. We also address reproducible floating-point computation. We define reproducibility to mean getting bitwise identical results from multiple runs of the same program, perhaps with different hardware resources or other changes that should ideally not change the answer. Many users depend on reproducibility for debugging or correctness. However, dynamic scheduling of parallel computing resources, combined with nonassociativity of floating point addition, makes attaining reproducibility a challenge even for simple operations like summing a vector of numbers, or more complicated operations like the Basic Linear Algebra Subprograms (BLAS). We describe an algorithm that computes a reproducible sum of floating point numbers, independent of the order of summation. The algorithm depends only on a subset of the IEEE Floating Point Standard 754-2008, uses just 6 words to represent a “reproducible accumulator,” and requires just one read-only pass over the data, or one reduction in parallel. New instructions based on this work are being considered for inclusion in the future IEEE 754-2018 floating-point standard, and new reproducible BLAS are being considered for the next version of the BLAS standard.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

TU-AB-BRC-08: Egs-brachy, a Fast and Versatile Monte Carlo Code for Brachytherapy Applications

Purpose: To introduce egs-brachy, a new, fast, and versatile Monte Carlo code for brachytherapy applications. Methods: egs-brachy is an EGSnrc user-code based on the EGSnrc C++ class library (egs++). Complex phantom, applicator, and source model geometries are built using the egs++ geometry module. egs-brachy uses a tracklength estimator to score collision kerma in voxels. Interaction, spectrum, energy fluence, and phase space scoring are also implemented. Phase space sources and particle recycling may be used to improve simulation efficiency. HDR treatments (e.g. stepping source through dwell positions) can be simulated. Standard brachytherapy seeds, as well as electron and miniature x-ray tube sources are fully modelled. Variance reduction techniques for electron source simulations are implemented (Bremsstrahlung cross section enhancement, uniform Bremsstrahlung splitting, and Russian Roulette). TG-43 parameters of seeds are computed and compared to published values. Example simulations of various treatments are carried out on a single 2.5 GHz Intel Xeon E5-2680 v3 processor core. Results: TG-43 parameters calculated with egs-brachy show excellent agreement with published values. Using a phase space source, 2% average statistical uncertainty in the PTV ((2mm){sup 3} voxels) can be achieved in 10 s for 100 {sup 125}I or {sup 103}Pd seeds in a 36.2 cm{sup 3} prostate PTV, 31 s for 64 {sup 103}Pd seeds in a 64 cm{sup 3} breast PTV, and 56 s for a miniature x-ray tube in a 27 cm{sup 3} breast PTV. Comparable uncertainty is reached in 12 s in a (1 mm){sup 3} water voxel 5 mm away from a COMS 16mm eye plaque with 13 {sup 103}Pd seeds. Conclusion: The accuracy of egs-brachy has been demonstrated through benchmarking calculations. Calculation times are sufficiently fast to allow full MC simulations for routine treatment planning for diverse brachytherapy treatments (LDR, HDR, miniature x-ray tube). egs-brachy will be available as free and open-source software to the medical physics research community. This work is partially funded by the Canada Research Chairs program, the Natural Sciences and Engineering Research Council of Canada, and the Ontario Ministry of Research and Innovation (Ontario Early Researcher Award).

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

Development of MCNP Training Modules for Safeguards Practitioners [Abstract]

The Monte-Carlo N-Particle (MCNP) software developed at LANL is the most widely used neutron transport code in the world. It is an essential tool for a variety of applications including detector development and design, nuclear fuel burnup simulation, criticality safety, and nondestructive assay system optimization. For this reason, it is indispensable within the safeguards and materials control & accountability (MC&A) communities. Multiple MCNP training courses have been created and taught over the last several decades by the MCNP development team at LANL, however there are no existing courses that cover specialized topics considered fundamental to NDA and safeguards models. To fill this gap, the MCNP team and Safeguards Science and Technology group at LANL have co-created a set of training modules customized to meet the specialized needs of the safeguards and MC&A communities. The basic modules cover concepts such as NDA system optimization, He-specific and other capture tallies, and tools for improved theoretical understanding. An advanced module was also created to cover topics including variance reduction for active interrogation simulations, use of the LANL MCNPTools post-processor, PTRAC (particle tracking) and list-mode data simulations, and fuel burnup simulations. The training modules teach to the latest and most state-of-the-art MCNP features and tools released by the development team at LANL and are intended to be taught jointly by the developers and safeguards experts. Ultimately, we hope that creation of these modules will serve to capture and convey the safeguards modeling and MCNP expertise at LANL, and that we will be able to share the modules more broadly with the MC&A and safeguards communities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Comparing the Performance of Julia on CPUs versus GPUs and Julia-MPI versus Fortran-MPI: a case study with MPAS-Ocean (Version 7.1)

Abstract. Some programming languages are easy to develop at the cost of slow execution, while others are fast at runtime but much more difficult to write. Julia is a programming language that aims to be the best of both worlds – a development and production language at the same time. To test Julia's utility in scientific high-performance computing (HPC), we built an unstructured-mesh shallow water model in Julia and compared it against an established Fortran-MPI ocean model, the Model for Prediction Across Scales–Ocean (MPAS-Ocean), as well as a Python shallow water code. Three versions of the Julia shallow water code were created: for single-core CPU, graphics processing unit (GPU), and Message Passing Interface (MPI) CPU clusters. Comparing identical simulations revealed that our first version of the Julia model was 13 times faster than Python using NumPy, where both used an unthreaded single-core CPU. Further Julia optimizations, including static typing and removing implicit memory allocations, provided an additional 10–20× speed-up of the single-core CPU Julia model. The GPU-accelerated Julia code was almost identical in terms of performance to the MPI parallelized code on 64 processes, an unexpected result for such different architectures. Parallelized Julia-MPI performance was identical to Fortran-MPI MPAS-Ocean for low processor counts and ranges from 2× faster to 2× slower for higher processor counts. Our experience is that Julia development is fast and convenient for prototyping but that Julia requires further investment and expertise to be competitive with compiled codes. We provide advice on Julia code optimization for HPC systems.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2016

Rolex: Resilience-oriented language extensions for extreme-scale systems

Future exascale high-performance computing (HPC) systems will be constructed from VLSI devices that will be less reliable than those used today, and faults will become the norm, not the exception. This will pose significant problems for system designers and programmers, who for half-a-century have enjoyed an execution model that assumed correct behavior by the underlying computing system. The mean time to failure (MTTF) of the system scales inversely to the number of components in the system and therefore faults and resultant system level failures will increase, as systems scale in terms of the number of processor cores and memory modules used. However every error detected need not cause catastrophic failure. Many HPC applications are inherently fault resilient. Yet it is the application programmers who have this knowledge but lack mechanisms to convey it to the system. In this paper, we present new Resilience Oriented Language Extensions (Rolex) which facilitate the incorporation of fault resilience as an intrinsic property of the application code. We describe the syntax and semantics of the language extensions as well as the implementation of the supporting compiler infrastructure and runtime system. Furthermore, our experiments show that an approach that leverages the programmer's insight to reason about the context and significance of faults to the application outcome significantly improves the probability that an application runs to a successful conclusion.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

SHARP Assembly-Scale Multiphysics Demonstration Simulations

The NEAMS Reactor Product Line effort aims to develop an integrated multiphysics simulation capability for the design and analysis of future generations of nuclear power plants. The Reactor Product Line code suite’s multi-resolution hierarchy is being designed to ultimately span the full range of length and time scales present in relevant reactor design and safety analyses, as well as scale from desktop to petaflop computing platforms. In this report, we describe our efforts to integrate thermal/hydraulics, neutronics, and structural mechanics modeling codes to perform coupled analysis of a representative fast sodium-cooled reactor fuel assembly. Over the past five years, the Reactor Product Line effort has developed high-fidelity single-physics codes for neutron transport modeling, in the PROTEUS code, and Large Eddy Simulation-based thermal/fluid modeling in the Nek5000 code. Both these codes have been exercised on over 100,000 processors of the IBM Blue Gene/P. The Diablo code has been used to perform structural mechanics and thermo-mechanical modeling. MOAB, the Reactor Geometry Generator (RGG), and MeshKit have been developed to generate and manipulate mesh and mesh-based data, in both serial and parallel environments. These tools together form a strong basis on which to build a multi-physics modeling capability. The goal of developing such a tool is to perform multi-physics neutronics, thermal/fluid, and structural mechanics modeling of the components inside a reactor core. While the focus of this report is on modeling a fast sodium-cooled reactor, it is also the goal that this simulation tool be useful for most reactor types. Here we report on the integration of PROTEUS and Nek5000 into the NEAMS framework. Both codes have been modified to read and write data from and to the MOAB library, in both serial and parallel environments. We focused on broad support for as many original physics code options as possible, rather than focusing only on near-term needs. Both codes were demonstrated through this interface on a relatively simple, seven-pin hexagonal fuel assembly. To support coupled analysis, the new multi-physics driver library COUPE was developed; this library provides flexible support for both loose and tight coupling, and can interface flexibly with codes in multiple programming languages. To couple results between the separate meshes used in each physics, the driver, PROTEUS, and Nek5000 all interface with the MBCoupler solution transfer tool provided with MOAB. Together, these tools form the basis of a new, coupled neutronics and thermal/fluid modeling code, that works in both serial and parallel. In a related effort, a driver in the Diablo code was used to access Nek5000-computed results written to a MOAB database, as well as the temperature data used to drive structural mechanics computations.

Tautges, Timothy J.↗
DOE OSTI2012

An Evaluation of Molecular Dynamics Performance on the Hybrid Cray XK6 Supercomputer

For many years, the drive towards computational physics studies that match the size and time-scales of experiment has been fueled by increases in processor and interconnect performance that could be exploited with relatively little modification to existing codes. Engineering and electrical power constraints have disrupted this trend, requiring more drastic changes to both hardware and software solutions. Here, we present details of the Cray XK6 architecture that achieves increased performance with the use of GPU accelerators. We review software development efforts in the LAMMPS molecular dynamics package that have been implemented in order to utilize hybrid high performance computers. We present benchmark results for solid-state, biological, and mesoscopic systems and discuss some challenges for utilizing hybrid systems. We present some early work in improving application performance on the XK6 and performance results for the simulation of liquid copper nanostructures with the embedded atom method.

43 PARTICLE ACCELERATORS↗
DOE OSTI2023

Short-Depth QAOA circuits and Quantum Annealing on Higher-Order Ising Models (Rev.2)

The Quantum Alternating Operator Ansatz (QAOA) and Quantum Annealing (QA) are quantum algorithms that are both based on the adiabatic theorem and both have the goal of sampling the optimal solution(s) of combinatorial optimization problems. Quantum annealing has been physically instantiated on D-Wave devices using superconducting flux qubits, and QAOA can be programmed on digital gate-model quantum computers such as the programmable superconducting transmon qubits devices of the IBMQ series, for instance ibm washington. QAOA and QA address the same types of problems, but it is unclear how they will scale to large problem sizes and to larger and higher-fidelity quantum computers. In this article, we present a direct comparison between QAOA, one and two rounds, run on all 127 qubits of ibm washington and QA run on D-Wave Advantage system4.1 and Advantage system6.1. The problems which allow for this comparison are random Ising model problems whose connectivity matches the heavy hexagonal lattice topology of ibm washington and the Pegasus graph connectivity of the two D-Wave devices. We create two classes of problem instances for this comparison: one with higher order terms (ZZZ variable interactions), linear terms, and quadratic terms, and a separate problem type with only linear and quadratic terms. Our QAOA circuits are novel and extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of ibm washington’s heavy hexagonal lattice and can be applied to future heavy-hex chips. We also test the effectiveness of the error suppression technique digital dynamical decoupling on the QAOA circuits. The QAOA circuits compiled to ibm washington are composed of several thousand circuit instructions, approximately 3, 000 depending on the details of the circuit, making these some the largest quantum circuits ever executed on a digital quantum processor. QAOA and QA are compared against the classical heuristic algorithm of simulated annealing and all problem instances are exactly solved using CPLEX in order to evaluate which samplers, if any, correctly found the ground state solution(s) of the problem instances. We find that (i) QA outperforms QAOA on all problem instances, (ii) QAOA samples the problems better than random sampling, and (iii) QAOA angle computation exhibits clear parameter concentration across the ensemble of Ising models.

127 Qubits↗
DOE OSTI2013

Dose-shaping using targeted sparse optimization

Purpose: Dose volume histograms (DVHs) are common tools in radiation therapy treatment planning to characterize plan quality. As statistical metrics, DVHs provide a compact summary of the underlying plan at the cost of losing spatial information: the same or similar dose-volume histograms can arise from substantially different spatial dose maps. This is exactly the reason why physicians and physicists scrutinize dose maps even after they satisfy all DVH endpoints numerically. However, up to this point, little has been done to control spatial phenomena, such as the spatial distribution of hot spots, which has significant clinical implications. To this end, the authors propose a novel objective function that enables a more direct tradeoff between target coverage, organ-sparing, and planning target volume (PTV) homogeneity, and presents our findings from four prostate cases, a pancreas case, and a head-and-neck case to illustrate the advantages and general applicability of our method.Methods: In designing the energy minimization objective (E{sub tot}{sup sparse}), the authors utilized the following robust cost functions: (1) an asymmetric linear well function to allow differential penalties for underdose, relaxation of prescription dose, and overdose in the PTV; (2) a two-piece linear function to heavily penalize high dose and mildly penalize low and intermediate dose in organs-at risk (OARs); and (3) a total variation energy, i.e., the L{sub 1} norm applied to the first-order approximation of the dose gradient in the PTV. By minimizing a weighted sum of these robust costs, general conformity to dose prescription and dose-gradient prescription is achieved while encouraging prescription violations to follow a Laplace distribution. In contrast, conventional quadratic objectives are associated with a Gaussian distribution of violations, which is less forgiving to large violations of prescription than the Laplace distribution. As a result, the proposed objective E{sub tot}{sup sparse} improves tradeoff between planning goals by 'sacrificing' voxels that have already been violated to improve PTV coverage, PTV homogeneity, and/or OAR-sparing. In doing so, overall plan quality is increased since these large violations only arise if a net reduction in E{sub tot}{sup sparse} occurs as a result. For example, large violations to dose prescription in the PTV in E{sub tot}{sup sparse}-optimized plans will naturally localize to voxels in and around PTV-OAR overlaps where OAR-sparing may be increased without compromising target coverage. The authors compared the results of our method and the corresponding clinical plans using analyses of DVH plots, dose maps, and two quantitative metrics that quantify PTV homogeneity and overdose. These metrics do not penalize underdose since E{sub tot}{sup sparse}-optimized plans were planned such that their target coverage was similar or better than that of the clinical plans. Finally, plan deliverability was assessed with the 2D modulation index.Results: The proposed method was implemented using IBM's CPLEX optimization package (ILOG CPLEX, Sunnyvale, CA) and required 1-4 min to solve with a 12-core Intel i7 processor. In the testing procedure, the authors optimized for several points on the Pareto surface of four 7-field 6MV prostate cases that were optimized for different levels of PTV homogeneity and OAR-sparing. The generated results were compared against each other and the clinical plan by analyzing their DVH plots and dose maps. After developing intuition by planning the four prostate cases, which had relatively few tradeoffs, the authors applied our method to a 7-field 6 MV pancreas case and a 9-field 6MV head-and-neck case to test the potential impact of our method on more challenging cases. The authors found that our formulation: (1) provided excellent flexibility for balancing OAR-sparing with PTV homogeneity; and (2) permitted the dose planner more control over the evolution of the PTV's spatial dose distribution than conventional objective functions. In particular, E{sub tot}{sup sparse}-optimized plans for the pancreas case and head-and-neck case exhibited substantially improved sparing of the spinal cord and parotid glands, respectively, while maintaining or improving sparing for other OARs and markedly improving PTV homogeneity. Plan deliverability for E{sub tot}{sup sparse}-optimized plans was shown to be better than their associated clinical plans, according to the two-dimensional modulation index.Conclusions: These results suggest that our formulation may be used to improve dose-shaping and OAR-sparing for complicated disease sites, such as the pancreas or head and neck. Furthermore, our objective function and constraints are linear and constitute a linear program, which converges to the global minimum quickly, and can be easily implemented in treatment planning software. Thus, the authors expect fast translation of our method to the clinic where it may have a positive impact on plan quality for challenging disease sites.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2019

Production Application Performance Data Streaming for System Monitoring

In this article, we present an approach to streaming collection of application performance data. Practical application performance tuning and troubleshooting in production high-performance computing (HPC) environments requires an understanding of how applications interact with the platform, including (but not limited to) parallel programming libraries such as Message Passing Interface (MPI). Several profiling and tracing tools exist that collect heavy runtime data traces either in memory (released only at application exit) or on a file system (imposing an I/O load that may interfere with the performance being measured). Although these approaches are beneficial in development stages and post-run analysis, a systemwide and low-overhead method is required to monitor deployed applications continuously. This method must be able to collect information at both the application and system levels to yield a complete performance picture. In our approach, an application profiler collects application event counters. A sampler uses an efficient inter-process communication method to periodically extract the application counters and stream them into an infrastructure for performance data collection. We implement a tool-set based on our approach and integrate it with the Lightweight Distributed Metric Service (LDMS) system, a monitoring system used on large-scale computational platforms. LDMS provides the infrastructure to create and gather streams of performance data in a low overhead manner. We demonstrate our approach using applications implemented with MPI, as it is one of the most common standards for the development of large-scale scientific applications. We utilize our tool-set to study the impact of our approach on an open source HPC application, Nalu. Our tool-set enables us to efficiently identify patterns in the behavior of the application without source-level knowledge. We leverage LDMS to collect system-level performance data and explore the correlation between the system and application events. Finally, we demonstrate how our tool-set can help detect anomalies with a low latency. We run tests on two different architectures: a system enabled with Intel Xeon Phi and another system equipped with Intel Xeon processor. Our overhead study shows our method imposes at most 0.5% CPU usage overhead on the application in realistic deployment scenarios.

59 BASIC BIOLOGICAL SCIENCES↗