Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Scientific Computing.”

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 847 records · Page 47

LArSoft and Future Framework Directions at Fermilab

The diversity of the scientific goals across HEP experiments necessitates unique bodies of software tailored for achieving particular physics results. The challenge, however, is to identify the software that must be unique, and the code that is unnecessarily duplicated, which results in wasted eort and inhibits code maintainability. Fermilab has a history of supporting and developing software projects that are shared among HEP experiments. Fermilab’s scientific computing division currently expends eort in maintaining and developing the LArSoft toolkit, used by liquid argon TPC experiments, as well as the event-processing framework technologies used by LArSoft, CMS, DUNE, and the majority of Fermilab-hosted experiments. As computing needs for DUNE and the HL-LHC become clearer, the computing models are being rethought. Presented here are Fermilab’s plans for addressing the evolving software landscape as it relates to LArSoft and the data-processing frameworks, specifically as it relates to the DUNE experiment.

Knoepfel, Kyle↗

From Long-distance Entanglement to Building a Nationwide Quantum Internet: Report of the DOE Quantum Internet Blueprint Workshop

A Quantum Path Forward. Today, many scientific experts recognize that building and scaling quantum-protected and enhanced communication networks are among the most important technological frontiers of the 21st century. The international research community perceives the construction of a first prototype global quantum network-the Quantum Internet-to be within reach over the next decade. In February 2020, the U.S. Department of Energy (DOE)'s Office of Advanced Scientific Computing Research hosted the Quantum Internet Blueprint workshop to define a potential roadmap toward building the first nationwide quantum Internet. The workshop participants included representatives from DOE national laboratories, universities, industry, and other U.S. agencies with serious interests in quantum networking. The goal was to provide an outline of the essential research needed, detail any engineering and design barriers, and suggest a path forward to move from today's limited local network experiments to a viable, secure quantum Internet.

Peters, Nicholas↗

Machine Learning Methods for Connection RTT and Loss Rate Estimation Using MPI Measurements Under Random Losses

Scientific computations are expected to be increasingly distributed across wide-area networks, and Message Passing Interface (MPI) has been shown to scale to support their communications over long distances. Application-level measurements of MPI operations reflect the connection Round-Trip Time (RTT) and loss rate, and machine learningmethods have been previously developed to estimate them under deterministic periodic losses. In this paper, we consider more complex, random losses with uniform, Poisson and Gaussian distributions. We study five disparate machine leaning methods, with linear and non-linear, and smooth and non-smooth properties, to estimate RTT and loss rate over 10 Gbps connections with 0–366 ms RTT. The diversity and complexity of these estimators combined with the randomness of losses and TCP’s non-linear response together rule out the selection of a single best among them; instead, we fuse them to retain their design diversity. Overall, the results show that accurate estimates can be generated at low loss ratesbut become inaccurate at loss rates 10% and higher, thereby illustrating both their strengths and limitations.

Rao, Nageswara S.↗

Deployable sensor system using mesh networking and satellite communication

A sensor system may be configured for continuous operation in a low resource environment and/or in extreme environmental conditions. The sensor system may have sufficient processing capabilities to provide scientific computing for pre-processing, quality control, statistical analysis, event classification, data compression and corrections (e.g., spikes in the data), autonomous decisions and actions, triggering other nodes, and information assurance functions that provide data confidentiality, data integrity, authentication, and non-repudiation. The hardware may have both mesh networking and satellite and cellular communication capability, and may be available for relatively low cost. Such a network provides the flexibility to have potentially any number of nodes be completely independent from one another. Thus, the network may scale across a diverse terrain.

Frigo, Janette↗

On the Convergence of Inexact Predictor-Corrector Methods for Linear Programming

Interior point methods (IPMs) are a common approach for solving linear programs (LPs) with strong theoretical guarantees and solid empirical performance. The time complexity of these methods is dominated by the cost of solving a linear system of equations at each iteration. In common applications of linear programming, particularly in machine learning and scientific computing, the size of this linear system can become prohibitively large, requiring the use of iterative solvers, which provide an approximate solution to the linear system. However, approximately solving the linear system at each iteration of an IPM invalidates the theoretical guarantees of common IPM analyses. To remedy this, we theoretically and empirically analyze (slightly modified) predictor-corrector IPMs when using approximate linear solvers: our approach guarantees that, when certain conditions are satisfied, the number of IPM iterations does not increase and that the final solution remains feasible. We also provide practical instantiations of approximate linear solvers that satisfy these conditions for special classes of constraint matrices using randomized linear algebra.

Dexter, Gregory↗

Implementation of a Red-Black SOR CMFD Solver in MPACT

As part of the Consortium for Advanced Simulation of Light Water Reactors (CASL), the Virtual Environment for Reactor Applications (VERA) is being developed to provide high-fidelity multi-physics simulations of nuclear reactor cores. The MPACT code being developed collaboratively by Oak Ridge National Laboratory and the University of Michigan includes the primary deterministic neutron transport solver available within VERA. MPACT employs the 2D/1D method to solve three-dimensional problems, using 2D method of characteristics (MOC) radial transport solvers with 1D NEM-SP3 axial transport solvers, which are coupled using axial and radial transverse leakages. A 3D coarse mesh finite difference (CMFD) solver is used to provide accelerated convergence that is more stable. The Portable, Extensible Tool kit for Scientific Computation (PETSc) generalized minimal residual (GMRES) iterative solver with a block Jacobi preconditioner has been used to solve the CMFD linear systems. This work focused on the addition of a red-black successive over-relaxation (RBSOR) solver to reduce overall runtime by reducing time spent solving the CMFD linear systems. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Recovering Topology of Nested Volumes Represented by Single Closed Surfaces

As scientific computing abilities continue to advance, so too have the efforts to model and simulate highly complex geometries in radiation environments. Modeling has advanced from primitive constructive solid geometry (CSG) to voxelized models, and now to high fidelity polygon mesh models. While polygon mesh surface models are very accurate, most Monte Carlo codes do not allow for their direct use. Often they are converted to voxel or tetrahedral mesh models and then used with the physics codes. The Direct Accelerated Geometry Monte Carlo (DAGMC) software package has the ability to efficiently run transport calculations directly on tessellated surface models. Typically the surface meshes used for DAGMC calculations come from CAD-based geometry models generated by solid modeling software. In some cases geometries of interest, like human phantoms, are generated by other means and may not contain all of the necessary information for particle transport. For example, mesh geometries in the OBJ file format contain vertex and connectivity data for each surface, but do not have any information about surface topology. These types of file formats necessitate a tool that can build a hierarchy of surfaces and reconstruct the topological information. The generate hierarchy tool was developed for this purpose. The following summary will explain the algorithm behind the tool, describe a test case, and finally demonstrate a real-world application of the tool with an MCNP5 calculation that directly uses a polygon mesh human phantom.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Scientific Machine Learning using MOOSE

A machine learning interface has been recently developed for the Multiphysics Object-Oriented Simulation Environment (MOOSE). This presentation summarizes the motivation behind using machine learning in scientific computing together with several examples for applications.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Performance study of atomic tally methods for GPU-accelerated Monte Carlo dose calculation - 25352

Over the past several years, the graphics processing unit (GPU) technology has rapidly gained ground in scientific computing due to its outstanding performance and programmability. GPU implementation of Monte Carlo radiation transport for dose calculations has been reported by many investigators. The majority of these studies adopted single-precision floating point format because of the higher peak floating point operations per second (FLOPS) the GPUs can deliver than double-precision. It has been known that calculation using single-precision is more prone to numerical round-off errors, especially when a single tally data is accumulated 'atomically' and repeatedly by thousands of GPU threads. To mitigate this problem, the least intrusive solution in theory is to replace the single-precision atomic-add tally function with a double-precision version. However, the complexity lies in the fact that some GPUs (Nvidia GPUs prior to the Pascal generation; all current AMD GPUs) do not readily offer such double-precision function at hardware level, and that software emulation is too slow to use if not optimized properly. This paper discusses several atomic-add tally methods with reduced numerical errors used throughout ARCHER development. The original software-based compare-and-swap method (CAS) was shown to be inefficient due to high intra-warp thread contention, whereas the improved software-based warp-aggregated method (WAG) and Kahan summation method (KAS) eliminated the thread contention and performed very well on Kepler and Maxwell GPUs, being more than 13 times faster than CAS in our tests. The hardware-based (HB) double-precision atomic-add feature available on Pascal and Volta GPUs exceeded software emulation and offered the best performance universally, so did WIB, a combination of WAG and HB methods. It was also shown that in a single-precision dose engine, KAS managed to maintain high reliability when the single-precision atomic-add tally underestimated the dose by 25%. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

High-Fidelity Arc-Discharge Model for Hydrogen-Plasma-Smelting-Reduction of Iron Ore

Electrification and use of renewable hydrogen is currently a necessity for decarbonizing the iron-and-steel industry. In this regard, hydrogen plasma smelting reduction (HPSR) is a novel pathway that is being explored for reduction of iron ore. HPSR provides several decarbonization merits compared to conventional blast furnaces. Firstly, the use of renewable hydrogen drastically reduces the CO2 emissions compared to the use of coke. Secondly, renewable electricity in the form of a thermal plasma for making reactive hydrogen species (radicals, ions) are more efficient at reducing iron ore compared to neutral H2. Thirdly, a molten product compatible with downstream processes is obtained from the intense heat transfer from the plasma. However, the scale-up of this technology requires fundamental exploration of hydrogen plasma dynamics and its interaction with complex solid material that include phase changing iron-ore and slag. In this work, we present a first principles continuum scale model for thermal plasmas in Ar/H2 gas mixtures typically used for HPSR. The thermal plasma governing equations for mass, momentum and energy with Lorentz force and Joule heating source terms are solved along with electromagnetic equations for electrostatic and magnetic vector potential. Our solver will be based on Pele, a suite of reacting flow solvers designed for advanced scientific computing architectures (Henry De Frahan et al., Proceedings of SIAM Parallel Processing, 13-25, 2024), and will utilize adaptive mesh generation for enhanced resolutions at locations of intense physicochemical interactions. This study will present the impact of Ar to H2 ratios on excited/dissociated hydrogen species concentrations, plasma temperature and conductivity along with the impact of outgassed species (water, metal vapor, O, OH radicals) from ore surface on gas phase chemistry. Furthermore, the heat and species flux to the surface will be quantified as a function of applied voltages in a transferred arc configuration.

hydrogen plasma↗

Creation of a GUI for Zori, a Quantum Monte Carlo program, usingRappture

In their research laboratories, academic institutions produce some of the most advanced software for scientific applications. However, this software is usually developed only for local application in the research laboratory or for method development. In spite of having the latest advances in the particular field of science, such software often lacks adequate documentation and therefore is difficult to use by anyone other than the code developers. As such codes become more complex, so typically do the input files and command statements necessary to operate them. Many programs offer the flexibility of performing calculations based on different methods that have their own set of variables and options to be specified. Moreover, situations can arise in which certain options are incompatible with each other. For this reason, users outside the development group can be unaware of how the program runs in detail. The opportunity can be lost to make the software readily available outside of the laboratory of origin. This is a long-standing problem in scientific programming. Rappture, Rapid Application Infrastructure [1], is a new GUI development kit that enables a developer to build an I/O interface for a specific application. This capability enables users to work only with the generated GUI and avoids the problem of the user needing to learn details of the code. Further, it reduces input errors by explicitly specifying the variables required. Zori, a quantum Monte Carlo (QMC) program, developed by the Lester group at the University of California, Berkeley [2], is one of the few free tools available for this field. Like many scientific computer packages, Zori suffers from the problems described above. Potential users outside the research group have acquired it, but some have found the code difficult to use. Furthermore, new members of the Lester group usually have to take considerable time learning all the options the code has to offer before they can use it successfully. In this paper we describe the use of the Rappture toolkit to generate a GUI, labeled Zopi (Zori Processing Interface), for the Zori computer code.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimal Chunking of Large Multidimensional Arrays for Data Warehousing

Very large multidimensional arrays are commonly used in data intensive scientific computations as well as on-line analytical processingapplications referred to as MOLAP. The storage organization of such arrays on disks is done by partitioning the large global array into fixed size sub-arrays called chunks or tiles that form the units of data transfer between disk and memory. Typical queries involve the retrieval of sub-arrays in a manner that access all chunks that overlap the query results. An important metric of the storage efficiency is the expected number of chunks retrieved over all such queries. The question that immediately arises is"what shapes of array chunks give the minimum expected number of chunks over a query workload?" The problem of optimal chunking was first introduced by Sarawagi and Stonebraker who gave an approximate solution. In this paper we develop exact mathematical models of the problem and provide exact solutions using steepest descent and geometric programming methods. Experimental results, using synthetic and real life workloads, show that our solutions are consistently within than 2.0percent of the true number of chunks retrieved for any number of dimensions. In contrast, the approximate solution of Sarawagi and Stonebraker can deviate considerably from the true result with increasing number of dimensions and also may lead to suboptimal chunk shapes.

97 MATHEMATICS AND COMPUTING↗

Compact Graph Representations and Parallel Connectivity Algorithms for Massive Dynamic Network Analysis

Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication traffic, and scientific computing can be intuitively modeled as graphs. We present the first study of novel high-performance combinatorial techniques for analyzing large-scale information networks, encapsulating dynamic interaction data in the order of billions of entities. We present new data structures to represent dynamic interaction networks, and discuss algorithms for processing parallel insertions and deletions of edges in small-world networks. With these new approaches, we achieve an average performance rate of 25 million structural updates per second and a parallel speedup of nearly28 on a 64-way Sun UltraSPARC T2 multicore processor, for insertions and deletions to a small-world network of 33.5 million vertices and 268 million edges. We also design parallel implementations of fundamental dynamic graph kernels related to connectivity and centrality queries. Our implementations are freely distributed as part of the open-source SNAP (Small-world Network Analysis and Partitioning) complex network analysis framework.

97 MATHEMATICS AND COMPUTING↗

Exploring network structure, dynamics, and function using NetworkX

NetworkX is a Python language package for exploration and analysis of networks and network algorithms. The core package provides data structures for representing many types of networks, or graphs, including simple graphs, directed graphs, and graphs with parallel edges and self loops. The nodes in NetworkX graphs can be any (hashable) Python object and edges can contain arbitrary data; this flexibility mades NetworkX ideal for representing networks found in many different scientific fields. In addition to the basic data structures many graph algorithms are implemented for calculating network properties and structure measures: shortest paths, betweenness centrality, clustering, and degree distribution and many more. NetworkX can read and write various graph formats for eash exchange with existing data, and provides generators for many classic graphs and popular graph models, such as the Erdoes-Renyi, Small World, and Barabasi-Albert models, are included. The ease-of-use and flexibility of the Python programming language together with connection to the SciPy tools make NetworkX a powerful tool for scientific computations. We discuss some of our recent work studying synchronization of coupled oscillators to demonstrate how NetworkX enables research in the field of computational networks.

99 GENERAL AND MISCELLANEOUS↗

Franklin: User Experiences

The newest workhorse of the National Energy Research Scientific Computing Center is a Cray XT4 with 9,736 dual core nodes. This paper summarizes Franklin user experiences from friendly early user period to production period. Selected successful user stories along with top issues affecting user experiences are presented.

97 MATHEMATICS AND COMPUTING↗

Integrating Grid Services into the Cray XT4 Environment

The 38640 core Cray XT4"Franklin" system at the National Energy Research Scientific Computing Center (NERSC) is a massively parallel resource available to Department of Energy researchers that also provides on-demand grid computing to the Open Science Grid. The integration of grid services on Franklin presented various challenges, including fundamental differences between the interactive and compute nodes, a stripped down compute-node operating system without dynamic library support, a shared-root environment and idiosyncratic application launching. Inour work, we describe how we resolved these challenges on a running, general-purpose production system to provide on-demand compute, storage, accounting and monitoring services through generic grid interfaces that mask the underlying system-specific details for the end user.

42 ENGINEERING↗