Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Distributed computation”

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 883 records · Page 49
All sourcesNASA NTRSDOE OSTI
NASA NTRS1997

A Comparison of PETSC Library and HPF Implementations of an Archetypal PDE Computation

Two paradigms for distributed-memory parallel computation that free the application programmer from the details of message passing are compared for an archetypal structured scientific computation a nonlinear, structured-grid partial differential equation boundary value problem using the same algorithm on the same hardware. Both paradigms, parallel libraries represented by Argonne's PETSC, and parallel languages represented by the Portland Group's HPF, are found to be easy to use for this problem class, and both are reasonably effective in exploiting concurrency after a short learning curve. The level of involvement required by the application programmer under either paradigm includes specification of the data partitioning (corresponding to a geometrically simple decomposition of the domain of the PDE). Programming in SPAM style for the PETSC library requires writing the routines that discretize the PDE and its Jacobian, managing subdomain-to-processor mappings (affine global- to-local index mappings), and interfacing to library solver routines. Programming for HPF requires a complete sequential implementation of the same algorithm, introducing concurrency through subdomain blocking (an effort similar to the index mapping), and modest experimentation with rewriting loops to elucidate to the compiler the latent concurrency. Correctness and scalability are cross-validated on up to 32 nodes of an IBM SP2.

Hayder, M. Ehtesham↗
DOE OSTI2016

Studies of QCD structure in high-energy collisions

”Studies of QCD structure in high-energy collisions” is a research project in theoretical particle physics at Southern Methodist University funded by US DOE Award DE-SC0013681. The award furnished bridge funding for one year (2015/04/15-2016/03/31) between the periods funded by Nadolsky’s DOE Early Career Research Award DE-SC0003870 (in 2010-2015) and a DOE grant DE-SC0010129 for SMU Department of Physics (starting in April 2016). The primary objective of the research is to provide theoretical predictions for Run-2 of the CERN Large Hadron Collider (LHC). The LHC physics program relies on state-of-the-art predictions in the field of quantum chromodynamics. The main effort of our group went into the global analysis of parton distribution functions (PDFs) employed by the bulk of LHC computations. Parton distributions describe internal structure of protons during ultrarelivistic collisions. A new generation of CTEQ parton distribution functions (PDFs), CT14, was released in summer 2015 and quickly adopted by the HEP community. The new CT14 parametrizations of PDFs were obtained using benchmarked NNLO calculations and latest data from LHC and Tevatron experiments. The group developed advanced methods for the PDF analysis and estimation of uncertainties in LHC predictions associated with the PDFs. We invented and refined a new ’meta-parametrization’ technique that streamlines usage of PDFs in Higgs boson production and other numerous LHC processes, by combining PDFs from various groups using multivariate stochastic sampling. In 2015, the PDF4LHC working group recommended to LHC experimental collaborations to use ’meta-parametrizations’ as a standard technique for computing PDF uncertainties. Finally, to include new QCD processes into the global fits, our group worked on several (N)NNLO calculations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2012

Distributed Storage Systems for Data Intensive Computing

In this chapter, the authors present an overview of the utility of distributed storage systems in supporting modern applications that are increasingly becoming data intensive. Their coverage of distributed storage systems is based on the requirements imposed by data intensive computing and not a mere summary of storage systems. To this end, they delve into several aspects of supporting data-intensive analysis, such as data staging, offloading, checkpointing, and end-user access to terabytes of data, and illustrate the use of novel techniques and methodologies for realizing distributed storage systems therein. The data deluge from scientific experiments, observations, and simulations is affecting all of the aforementioned day-to-day operations in data-intensive computing. Modern distributed storage systems employ techniques that can help improve application performance, alleviate I/O bandwidth bottleneck, mask failures, and improve data availability. They present key guiding principles involved in the construction of such storage systems, associated tradeoffs, design, and architecture, all with an eye toward addressing challenges of data-intensive scientific applications. They highlight the concepts involved using several case studies of state-of-the-art storage systems that are currently available in the data-intensive computing landscape.

99 GENERAL AND MISCELLANEOUS↗
NASA NTRS2018

Computational Component Build-Up for the X-57 Distributed Electric Propulsion Aircraft

A computational study of the wing for the distributed electric propulsion X-57 Maxwell airplane configuration at cruise and takeoff/landing conditions was completed. Three unstructured-mesh, Navier-Stokes computational fluid dynamics methods, FUN3D, USM3D and Kestrel, were used to predict the performance buildup of components to the full X-57 configuration. The goal of the X-57 wing and distributed electric propulsion system design was to meet or exceed the required lift coefficient of 3.95 for a stall speed of 58 knots. The X-57 Maxwell airplane was designed with a small, high aspect ratio cruise wing that was designed for a high cruise lift coefficient of 0.75 at a cruise speed of 150 knots and altitude of 8,000 ft, with an angle of attack of approximately 0deg. The computational data indicates that the X-57 full aircraft drag would meet the cruise drag goal with a 25 count drag margin. The cruise configuration maximum lift coefficient is 2.07 and without including the stabilator is 1.86 at an angle of attack of 14 deg, predicted with the USM3D flow solver using the Spalart-Allmaras turbulence model. The maximum lift coefficient for the high-lift wing (with the 30deg flap deflection) without the stabilator contribution is 2.60 at an angle of attack of 13 deg. For high-lift blowing conditions with 13.7 hp/prop, the maximum lift coefficient excluding the stabilator is 4.426 at (alpha) = 13 deg. Therefore, the lift augmentation from the high-lift propellers is 1.7 and the total lift augmentation from the high-lift system (30 deg flap deflection and the high-lift blowing) is 2.38. The drag for the high-lift wing with 30 deg flap deflection is much higher than the cruise wing configuration, but the high-lift system is used only during a small portion of the flight envelope. The pitching moment is relatively constant for both blown and unblown conditions when the stabilator is excluded. Modeling the full geometry has indicated some adverse effects from the fuselage on the wing and stabilator. At high angles of attack, the solutions with the USM3D flow solver using the Spalart-Allmaras turbulence model indicates large flow separation on the wing upper surface between the two high-lift nacelles near the fuselage, and also a reduction in sectional lift on the stabilator in the first 50 percent of the stabilator semispan. However, the large flow separation near the fuselage is mostly eliminated in the solutions predicted with two codes, USM3D and Kestrel, using Hybrid Reynolds-averaged Navier Stokes/Large Eddy Simulation turbulence models.

Deere, Karen A.↗
DOE OSTI2025

Unorthodox parallelization for Bayesian quantum state estimation

Quantum state tomography (QST) allows for the reconstruction of quantum states through measurements and some inference technique under the assumption of repeated state preparations. Bayesian inference provides a promising platform to achieve both efficient QST and accurate uncertainty quantification, yet is generally plagued by the computational limitations associated with long Markov chains. In this work, we present a novel Bayesian QST approach that leverages modern distributed parallel computer architectures to efficiently sample a D-dimensional Hilbert space. Using a parallelized preconditioned Crank–Nicholson Metropolis–Hastings algorithm, we demonstrate our approach on simulated data and experimental results from IBM Quantum systems up to four qubits, showing significant speedups through parallelization. Although highly unorthodox in pooling independent Markov chains, our method proves remarkably practical, with validation ex post facto via diagnostics like the intrachain autocorrelation time. We conclude by discussing scalability to higher-dimensional systems, offering a path toward efficient and accurate Bayesian characterization of large quantum systems.

Bayesian inference↗
DOE OSTI2017

Data preservation at the Fermilab Tevatron

The Fermilab Tevatron collider's data-taking run ended in September 2011, yielding a dataset with rich scientific potential. The CDF and D0 experiments each have approximately 9 PB of collider and simulated data stored on tape. A large computing infrastructure consisting of tape storage, disk cache, and distributed grid computing for physics analysis with the Tevatron data is present at Fermilab. The Fermilab Run II data preservation project intends to keep this analysis capability sustained through the year 2020 and beyond. To achieve this goal, we have implemented a system that utilizes virtualization, automated validation, and migration to new standards in both software and data storage technology and leverages resources available from currently-running experiments at Fermilab. Lastly, these efforts have also provided useful lessons in ensuring long-term data access for numerous experiments, and enable high-quality scientific output for years to come.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2015

Data preservation at the Fermilab Tevatron

The Fermilab Tevatron collider's data-taking run ended in September 2011, yielding a dataset with rich scientific potential. The CDF and DO experiments each have nearly 9 PB of collider and simulated data stored on tape. A large computing infrastructure consisting of tape storage, disk cache, and distributed grid computing for physics analysis with the Tevatron data is present at Fermilab. The Fermilab Run II data preservation project intends to keep this analysis capability sustained through the year 2020 or beyond. To achieve this, we are implementing a system that utilizes virtualization, automated validation, and migration to new standards in both software and data storage technology as well as leveraging resources available from currently-running experiments at Fermilab. Furthermore, these efforts will provide useful lessons in ensuring long-term data access for numerous experiments throughout high-energy physics, and provide a roadmap for high-quality scientific output for years to come.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
NASA NTRS1988

An analysis for high speed propeller-nacelle aerodynamic performance prediction. Volume 1: Theory and application

A computer program, the Propeller Nacelle Aerodynamic Performance Prediction Analysis (PANPER), was developed for the prediction and analysis of the performance and airflow of propeller-nacelle configurations operating over a forward speed range inclusive of high speed flight typical of recent propfan designs. A propeller lifting line, wake program was combined with a compressible, viscous center body interaction program, originally developed for diffusers, to compute the propeller-nacelle flow field, blade loading distribution, propeller performance, and the nacelle forebody pressure and viscous drag distributions. The computer analysis is applicable to single and coaxial counterrotating propellers. The blade geometries can include spanwise variations in sweep, droop, taper, thickness, and airfoil section type. In the coaxial mode of operation the analysis can treat both equal and unequal blade number and rotational speeds on the propeller disks. The nacelle portion of the analysis can treat both free air and tunnel wall configurations including wall bleed. The analysis was applied to many different sets of flight conditions using selected aerodynamic modeling options. The influence of different propeller nacelle-tunnel wall configurations was studied. Comparisons with available test data for both single and coaxial propeller configurations are presented along with a discussion of the results.

Egolf, T. Alan↗
DOE OSTI2024

Systematic Uncertainties from Gribov Copies in Lattice Calculation of Parton Distributions in the Coulomb Gauge

Recently, a new method has been proposed to compute parton distributions using boosted correlators fixed in the Coulomb gauge (CG) within the framework of large-momentum effective theory. This approach, which does not involve Wilson lines, could greatly improve the efficiency and precision of lattice quantum chromodynamics calculations. However, concerns remain regarding whether systematic uncertainties from Gribov copies, which correspond to ambiguities in lattice gauge-fixing, are adequately controlled. This work assesses the effects of Gribov copies on Coulomb-gauge-fixed quark correlators. We utilize different strategies for Coulomb-gauge fixing, selecting two different groups of Gribov copies based on lattice gauge configurations. We examine the differences in the resulting spatial quark correlators in both vacuum and pion states. Our findings indicate that the statistical errors of the matrix elements from both Gribov copies, regardless of the correlation range, decrease proportionally to the square root of the number of gauge configurations. The difference between the strategies does not show statistical significance compared to the gauge noise, demonstrating that the effect of the Gribov copies can be neglected in practical lattice calculations of quark parton distributions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1991

The sensitivity of fracture location distribution in brittle materials

The Weibull weak-link theory allows for the computation of distribution functions for both the fracture location and the applied far-field stress. Several authors have suggested using the fracture location information from tests to infer Weibull parameters, and others have used the predictive capabilities of the theory to calculate average fracture locations for brittle bodies. By a simple set of example calculations, it is shown that the fracture location distribution function is distinctly more sensitive to perturbations in the stress state than the fracture stress distribution function is. In general, the average fracture location is more subject to stress perturbations than the average fracture stress. The results indicate that care must be exercised in applying fracture location theory.

Wetherhold, Robert C.↗
DOE OSTI2018

Partitioning Models for Scaling Parallel Sparse Matrix-Matrix Multiplication

We investigate outer-product--parallel, inner-product--parallel, and row-by-row-product--parallel formulations of sparse matrix-matrix multiplication (SpGEMM) on distributed memory architectures. For each of these three formulations, we propose a hypergraph model and a bipartite graph model for distributing SpGEMM computations based on one-dimensional (1D) partitioning of input matrices. Here, we also propose a communication hypergraph model for each formulation for distributing communication operations. The computational graph and hypergraph models adopted in the first phase aim at minimizing the total message volume and balancing the computational loads of processors, whereas the communication hypergraph models adopted in the second phase aim at minimizing the total message count and balancing the message volume loads of processors. That is, the computational partitioning models reduce the bandwidth cost and the communication hypergraph models reduce the latency cost. Our extensive parallel experiments on up to 2048 processors for a wide range of realistic SpGEMM instances show that although the outer-product--parallel formulation scales better, the row-by-row-product--parallel formulation is more viable due to its significantly lower partitioning overhead and competitive scalability. For computational partitioning models, our experimental findings indicate that the proposed bipartite graph models are attractive alternatives to their hypergraph counterparts because of their lower partitioning overhead. Finally, we show that by reducing the latency cost besides the bandwidth cost through using the communication hypergraph models, the parallel SpGEMM time can be further improved up to 32%.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Systems and methods for distributed power system model calibration

A computing device for distributed power system model calibration is provided. The computing device is programmed to receive event data and model response data associated with a model to simulate, wherein the model includes a plurality of parameters, divide the event data into a plurality of sets, wherein each set includes associated parameters, and transmit the plurality of sets of event data to a plurality of client nodes. Each client node of the plurality of client nodes is programmed to analyze a corresponding set of event data to determine updated parameters for the model. The computing device is further programmed to receive a plurality of updated parameters for the model from the plurality of client nodes and analyze the received plurality of updated parameters to determine at least one adjusted parameter.

Wang, Honggang↗
DOE OSTI2025

Cosmic Reionization on Computers: Statistical Properties of the Distributions of Mean Opacities

Quasar absorption lines provide a unique window to the relationship between galaxies and the intergalactic medium during the Epoch of Reionization. In particular, high redshift quasars enable measurements of the neutral hydrogen content of the universe. However, the limited sample size of observed quasar spectra, particularly at the highest redshifts, hampers our ability to fully characterize the intergalactic medium during this epoch from observations alone. In this work, we characterize the distributions of mean opacities of the intergalactic medium in simulations from the Cosmic Reionization on Computers (CROC) project. We find that the distribution of mean opacities along sightlines follows a non-trivial distribution that cannot be easily approximated by a known distribution. When comparing the cumulative distribution function of mean opacities measurements in subsamples of sample sizes similar to observational measurements from the literature, we find consistency between CROC and observations at redshifts $z\lesssim 5.7$. However, at higher redshifts ($z\gtrsim5.7$), the cumulative distribution function of mean opacities from CROC is notably narrower than those from observed quasar sightlines implying that observations probe a systematically more opaque intergalactic medium at higher redshifts than the intergalactic medium in CROC boxes at these same redshifts. This is consistent with previous analyses that indicate that the universe is reionized too early in CROC simulations.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1960

Investigation at Mach Numbers of 0.60 to 3.50 of Blended Wing-Body Combinations with Cambered and Twisted Wings with Diamond, Delta and Arrow Plan Forms

This investigation is a continuation of the experimental and theoretical evaluation of blended wing-body combinations. The basic diamond, delta, and arrow plan forms which had an aspect ratio of 2 with leading-edge sweeps of 45.00 deg., 59.04 deg., and 70.82 deg. and trailing edge of -45.00 deg., -18.43 deg., and 41.19 deg., respectively, are used herein as standards for evaluating the effects of camber and warp. The wing thickness distributions were computed by varying the section shape along with the body radii (blending process) to match the prescribed area distribution and wing plan form. The wing camber and warp were computed to try to obtain nearly elliptical spanwise and chordwise load distributions for each plan form and thus to obtain low drag due to lift for a range of Mach numbers for which the velocities normal to the wing leading edge are subsonic. Elliptical chordwise load distributions were not possible for the plan forms and design conditions selected, so these distributions were somewhat different for each plan form. The models were tested with transition fixed at Mach numbers from 0.60 to 3.50 and at Reynolds numbers, based on the mean aerodynamic chord of the wing, of roughly 4,000,000 to 9,000,000. At speeds where the velocities normal to the wing leading edges were supersonic, an increase in the experimental wave-drag coefficients due to camber and twist was evident, but this penalty decreased with increased sweep. Thus the minimum wave-drag coefficients for the cambered arrow model were almost identical with the zero-lift wave- drag coefficients for the uncambered arrow model at all test Mach numbers.

Holdaway, George H.↗
DOE OSTI2023

Design and implementation of I/O performance prediction scheme on HPC systems through large-scale log analysis

Abstract Large-scale high performance computing (HPC) systems typically consist of many thousands of CPUs and storage units used by hundreds to thousands of users simultaneously. Applications from large numbers of users have diverse characteristics, such as varying computation, communication, memory, and I/O intensity. A good understanding of the performance characteristics of each user application is important for job scheduling and resource provisioning. Among these performance characteristics, I/O performance is becoming increasingly important as data sizes rapidly increase and large-scale applications, such as simulation and model training, are widely adopted. However, predicting I/O performance is difficult because I/O systems are shared among all users and involve many layers of software and hardware stack, including the application, network interconnect, operating system, file system, and storage devices. Furthermore, updates to these layers and changes in system management policy can significantly alter the I/O behavior of applications and the entire system. To improve the prediction of the I/O performance on HPC systems, we propose integrating information from several different system logs and developing a regression-based approach to predict the I/O performance. Our proposed scheme can dynamically select the most relevant features from the log entries using various feature selection algorithms and scoring functions, and can automatically select the regression algorithm with the best accuracy for the prediction task. The evaluation results show that our proposed scheme can predict the write performance with up to 90% prediction accuracy and the read performance with up to 99% prediction accuracy using the real logs from the Cori supercomputer system at NERSC.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Cloud-based Architecture Capabilities Summary Report

In collaborating scientific research arena it is important to have an environment where analysts have access to a shared of information documents, software tools and be able to accurately maintain and track historical changes in models. A new cloud-based environment would be accessible remotely from anywhere regardless of computing platforms given that the platform has available of Internet access and proper browser capabilities. Information stored at this environment would be restricted based on user assigned credentials. This report reviews development of a Cloud-based Architecture Capabilities (CAC) as a web portal for PRA tools.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Optimizing the Energy Usage and Cognitive Value of Extreme-Scale Data-Analysis Approaches

This report serves as a record that we have successfully completed work on the proposal Optimizing the Energy Usage and Cognitive Value of Extreme Scale Analysis Approaches, or, more succinctly, ECX. This includes successful completion of all three phases of the project, findings as summarized below, strong publications across the fields represented in the proposal, and a set of artifacts (code, websites, and other documentation) available to the public. In total, the results of this project represent significant findings in each domain, and a toolkit that will allow the community to engage with this work, advancing it and contributing to it in the years ahead. They also form the basis for a successfully funded follow-on project.

97 MATHEMATICS AND COMPUTING↗