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 541 records · Page 30
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

A catalogue of Locus Algorithm pointings for optimal differential photometry for 23 779 quasars

ABSTRACT This paper presents a catalogue of optimized pointings for differential photometry of 23 779 quasars extracted from the Sloan Digital Sky Survey (SDSS) Catalogue and a Score for each indicating the quality of the Field of View (FoV) associated with that pointing. Observation of millimagnitude variability on a time-scale of minutes typically requires differential observations with reference to an ensemble of reference stars. For optimal performance, these reference stars should have similar colour and magnitude to the target quasar. In addition, the greatest quantity and quality of suitable reference stars may be found by using a telescope pointing which offsets the target object from the centre of the FoV. By comparing each quasar with the stars which appear close to it on the sky in the SDSS Catalogue, an optimum pointing can be calculated, and a figure of merit, referred to as the ‘Score’ is calculated for that pointing. Highly flexible software has been developed to enable this process to be automated and implemented in a distributed computing paradigm, which enables the creation of catalogues of pointings given a set of input targets. Applying this technique to a sample of 40 000 targets from the fourth SDSS quasar catalogue resulted in the production of pointings and Scores for 23 779 quasars based on their magnitudes in the SDSS r-band. This catalogue is a useful resource for observers planning differential photometry studies and surveys of quasars to select those which have many suitable celestial neighbours for differential photometry.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Microscopic optical potentials for medium-mass isotopes derived at the first order of Watson multiple-scattering theory

We perform a first-principles calculation of optical potentials for nucleon elastic scattering off medium-mass isotopes. Fully based on a saturating chiral Hamiltonian, the optical potentials are derived by folding nuclear density distributions computed with self-consistent Green's function theory with a nucleon-nucleon t matrix computed with a consistent chiral interaction. The dependence on the folding interaction as well as the convergence of the target densities are investigated. Numerical results are presented and discussed for differential cross sections and analyzing powers, with focus on elastic proton scattering off calcium and nickel isotopes. Our optical potentials generally show a remarkable agreement with the available experimental data for laboratory energies in the range 65–200 MeV. We study the evolution of the scattering observables with increasing proton-neutron asymmetry by computing theoretical predictions of the cross section and analyzing power over the calcium and nickel isotopic chains. Published by the American Physical Society 2024

Physics↗
DOE OSTI2024

Comparing pion production in transport simulations of heavy-ion collisions at 270⁢𝐴 MeV under controlled conditions

Within the TMEP, we present a detailed study of the performance of different transport models in Sn+Sn collisions at 270A MeV, and put particular emphasis on the production of pions and Delta resonances, which have been used as probes of the nuclear symmetry energy. We prescribe a common and rather simple physics model, and follow in detail the results of 4 BUU models and 6 QMD models. The nucleonic evolution of the collision and the nucleonic observables in these codes do not completely converge, but the differences among the codes can be understood as being due to several reasons: the basic differences between BUU and QMD models in the representation of the phase-space distributions, computational differences in the mean-field evaluation, and differences in the adopted strategies for the Pauli blocking in the collision integrals. For pionic observables, we find that a higher maximum density leads to an enhanced pion yield and a reduced pi- pi+ yield ratio, while a more effective Pauli blocking generally leads to a slightly suppressed pion yield and an enhanced pi- pi+ yield ratio. We specifically investigate the effect of the Coulomb force, and find that it increases the total pi- pi+ yield ratio but reduces the ratio at high pion energies, although differences in its implementations do not have a dominating role in the differences among the codes. Taking into account only the results of codes that strictly follow the homework specifications, we find a convergence of the codes in the final charged pion yield ratio to a 1 sigma deviation of about 5%. Furthermore, the uncertainty is expected to be reduced to about 1.6% if the same or similar strategies and ingredients, i.e., an improved Pauli blocking and calculation of the non-linear term in the mean-field potential, are similarly used in all codes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2016

3D glasma initial state for relativistic heavy ion collisions

We extend the impact-parameter-dependent Glasma model to three dimensions using explicit small-x evolution of the two incoming nuclear gluon distributions. We compute rapidity distributions of produced gluons and the early-time energy momentum tensor as a function of space-time rapidity and transverse coordinates. Finally, we study rapidity correlations and fluctuations of the initial geometry and multiplicity distributions and make comparisons to existing models for the three-dimensional initial state.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2017

Li 6 in a three-body model with realistic Forces: Separable versus nonseparable approach

Background: Deuteron induced reactions are widely used to probe nuclear structure and astrophysical information. Those (d, p) reactions may be viewed as three-body reactions and described with Faddeev techniques. Purpose: Faddeev equations in momentum space have a long tradition of utilizing separable interactions in order to arrive at sets of coupled integral equations in one variable. However, it needs to be demonstrated that their solution based on separable interactions agrees exactly with solutions based on nonseparable forces. Methods: Momentum space Faddeev equations are solved with nonseparable and separable forces as coupled integral equations. Results: The ground state of 6 Li is calculated via momentum space Faddeev equations using the CD-Bonn neutron-proton force and a Woods-Saxon type neutron(proton)- 4 He force. For the latter the Pauli-forbidden S -wave bound state is projected out. This result is compared to a calculation in which the interactions in the two-body subsystems are represented by separable interactions derived in the Ernst-Shakin-Thaler (EST) framework. Conclusions: We find that calculations based on the separable representation of the interactions and the original interactions give results that agree to four significant figures for the binding energy, provided that energy and momentum support points of the EST expansion are chosen independently. The momentum distributions computed in both approaches also fully agree with each other.

6 ≤ A ≤ 19↗
DOE OSTI2018

Tomosaic : efficient acquisition and reconstruction of teravoxel tomography data using limited-size synchrotron X-ray beams

X-rays offer high penetration with the potential for tomography of centimetre-sized specimens, but synchrotron beamlines often provide illumination that is only millimetres wide. Here an approach is demonstrated termed Tomosaic for tomographic imaging of large samples that extend beyond the illumination field of view of an X-ray imaging system. This includes software modules for image stitching and calibration, while making use of existing modules available in other packages for alignment and reconstruction. The approach is compatible with conventional beamline hardware, while providing a dose-efficient method of data acquisition. By using parallelization on a distributed computing system, it provides a solution for handling teravoxel-sized or larger datasets that cannot be processed on a single workstation in a reasonable time. Using experimental data, the package is shown to provide good quality three-dimensional reconstruction for centimetre-sized samples with sub-micrometre pixel size.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2017

TGE: Machine Learning Based Task Graph Embedding for Large-Scale Topology Mapping

Task mapping is an important problem in parallel and distributed computing. The goal in task mapping is to find an optimal layout of the processes of an application (or a task) onto a given network topology. We target this problem in the context of staging applications. A staging application consists of two or more parallel applications (also referred to as staging tasks) which run concurrently and exchange data over the course of computation. Task mapping becomes a more challenging problem in staging applications, because not only data is exchanged between the staging tasks, but also the processes of a staging task may exchange data with each other. We propose a novel method, called Task Graph Embedding (TGE), that harnesses the observable graph structures of parallel applications and network topologies. TGE employs a machine learning based algorithm to find the best representation of a graph, called an embedding, onto a space in which the task-to-processor mapping problem can be solved. We evaluate and demonstrate the effectiveness of TGE experimentally with the communication patterns extracted from runs of XGC, a large-scale fusion simulation code, on Titan.

Choi, Jong Youl↗
DOE OSTI2018

Neural Networks and Graph Algorithms with Next-Generation Processors

The use of graphical processors for distributed computation revolutionized the field of high performance scientific computing. As the Moore's Law era of computing draws to a close, the development of non-Von Neumann systems: neuromorphic processing units, and quantum annealers; again are redefining new territory for computational methods. While these technologies are still in their nascent stages, we discuss their potential to advance computing in two domains: machine learning, and solving constraint satisfaction problems. Each of these processors utilize fundamentally different theoretical models of computation. This raises questions about how to best use them in the design and implementation of applications. While many processors are being developed with a specific domain target, the ubiquity of spin-glass models and neural networks provides an avenue for multi-functional applications. This provides hints at the future infrastructure needed to integrate many next-generation processing units into conventional high-performance computing systems.

Hamilton, Kathleen↗
DOE OSTI2013

Trelliscope: A System for Detailed Visualization in Analysis of Large Complex Data

Visualization plays a critical role in the statistical model building and data analysis process. Data analysts, well-versed in statistical and machine learning methods, visualize data to hypothesize and validate models. These analysts need flexible, scalable visualization tools that are not decoupled from their analysis environment. In this paper we introduce Trelliscope, a visualization framework for statistical analysis of large complex data. Trelliscope extends Trellis, an effective visualization framework that divides data into subsets and applies a plotting method to each subset, arranging the results in rows and columns of panels. Trelliscope provides a way to create, arrange and interactively view panels for very large datasets, enabling flexible detailed visualization for data of any size. Scalability is achieved using distributed computing technologies coupled with . We discuss the underlying principles, design, and scalable architecture of Trelliscope, and illustrate its use on three analysis projects in the domains of proteomics, high energy physics, and power systems engineering.

Hafen, Ryan P.↗
DOE OSTI2016

Analyzing large data sets from XGC1 magnetic fusion simulations using apache spark

Apache Spark is explored as a tool for analyzing large data sets from the magnetic fusion simulation code XGCI. Implementation details of Apache Spark on the NERSC Edison supercomputer are discussed, including binary file reading, and parameter setup. Here, an unsupervised machine learning algorithm, k-means clustering, is applied to XGCI particle distribution function data, showing that highly turbulent spatial regions do not have common coherent structures, but rather broad, ring-like structures in velocity space.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Ocelot: An Interactive, Efficient Distributed Compression-As-a-Service Platform With Optimized Data Compression Techniques

Large volumes of data generated by scientific simulations, genome sequencing, and other applications need to be moved among clusters for data collection/analysis. Data compression techniques have effectively reduced data storage and transfer costs. However, users' requirements on interactively controlling both data quality and compression ratios are non-trivial to fulfill. Here, we propose a novel Compression-as-a-Service (CaaS) platform called Ocelot with four important contributions: (1) It offers real-time visualization, interactive compression, and transfer of scientific datasets. (2) It incorporates new strategies for compressing diverse types of datasets more effectively than traditional methods. (3) It provides an effective method for estimating the compression ratio and execution time of compression tasks. (4) Experiments on multiple real-world datasets on geographically distributed computers show that Ocelot can significantly improve data transfer efficiency with a performance gain of more than 10x in computing clusters with relatively slow networks.

compression as a service (CaaS)↗
DOE OSTI2015

Influence of molecular clustering on the interpretation of diffractograms of hydrocarbon films from tokamak T-10

The influence of molecular clustering on the formerly suggested interpretation of diffraction patterns of hydrocarbon films formed in the vacuum vessel of the tokamak T-10 is analyzed numerically. The simulation of clustering of simple hydrocarbon molecules C(D, H){sub 4}, C{sub 2}(D, H){sub 4}, and C{sub 6}(D, H){sub 6} and molecules composed of curved graphene (fullerenes and toroidal nanotubes) is carried out with the rigid body molecular dynamics method. It is shown that formerly neglected atomic correlations C–C and C–D(H) in the amorphous hydrocarbon component decrease the calculated values of the scattered intensity in the range of scattering vector modulus 5 < q < 20 nm{sup –1} because of homogenization of scatters on the spatial scale of ∼1 nm. The allowance for these correlations does not change the diffraction patterns in the range q > 20 nm{sup –1}. The results suggest the necessity to introduce to the procedure of determining the structural content of the films, similar to those from the tokamak T-10, the clusters formed by the van der Waals adhesion of hydrocarbon molecules to “graphene” nanoparticles. This simplifies the mathematical optimization to the former level of complexity—but for an extended ensemble of objects—and makes it possible to calculate the diffraction patterns of these objects using the distributed computing resources. A modified algorithm of structural content identification on the basis of joint X-ray and neutron diffractometry is suggested.

36 MATERIALS SCIENCE↗
DOE OSTI2016

INTEGRATION OF PANDA WORKLOAD MANAGEMENT SYSTEM WITH SUPERCOMPUTERS

Abstract The Large Hadron Collider (LHC), operating at the international CERN Laboratory in Geneva, Switzerland, is leading Big Data driven scientific explorations. Experiments at the LHC explore the funda- mental nature of matter and the basic forces that shape our universe, and were recently credited for the dis- covery of a Higgs boson. ATLAS, one of the largest collaborations ever assembled in the sciences, is at the forefront of research at the LHC. To address an unprecedented multi-petabyte data processing challenge, the ATLAS experiment is relying on a heterogeneous distributed computational infrastructure. The ATLAS experiment uses PanDA (Production and Data Analysis) Workload Management System for managing the workflow for all data processing on over 140 data centers. Through PanDA, ATLAS physicists see a single computing facility that enables rapid scientific breakthroughs for the experiment, even though the data cen- ters are physically scattered all over the world. While PanDA currently uses more than 250000 cores with a peak performance of 0.3+ petaFLOPS, next LHC data taking runs will require more resources than Grid computing can possibly provide. To alleviate these challenges, LHC experiments are engaged in an ambitious program to expand the current computing model to include additional resources such as the opportunistic use of supercomputers. We will describe a project aimed at integration of PanDA WMS with supercomputers in United States, Europe and Russia (in particular with Titan supercomputer at Oak Ridge Leadership Com- puting Facility (OLCF), Supercomputer at the National Research Center Kurchatov Institute , IT4 in Ostrava, and others). The current approach utilizes a modified PanDA pilot framework for job submission to the supercomputers batch queues and local data management, with light-weight MPI wrappers to run single- threaded workloads in parallel on Titan s multi-core worker nodes. This implementation was tested with a variety of Monte-Carlo workloads on several supercomputing platforms. We will present our current accom- plishments in running PanDA WMS at supercomputers and demonstrate our ability to use PanDA as a portal independent of the computing facility s infrastructure for High Energy and Nuclear Physics, as well as other data-intensive science applications, such as bioinformatics and astro-particle physics.

De, K↗
DOE OSTI2023

Artificial Intelligence for a Resilient and Flexible Power Grid

Recent widespread and extreme natural disasters as well as the drive towards clean sustainable energy sources necessitate a transformational operational and technological approaches to improve power grid resilience. Convergence of artificial intelligence (AI), distributed computing, and connectivity technologies enables these new approaches to deliver a sustainable electric grid. In particular, AI-based techniques can enable proactive decision-making by processing massive amounts of data to deliver intelligence at various levels of the system, edge devices to control room. In this chapter, we will explore the potential applications AI-based technology will unlock and challenges to address to achieve a sustainable, flexible power grid.

Omitaomu, Femi↗
DOE OSTI2024

Operational experience and R&D results using the Google Cloud for High-Energy Physics in the ATLAS experiment

The ATLAS experiment at CERN relies on a Worldwide Distributed Computing Grid infrastructure to support its physics program at the Large Hadron Collider. ATLAS has integrated cloud computing resources to complement its Grid infrastructure and conducted an R&D program on Google Cloud Platform. These initiatives leverage key features of commercial cloud providers: lightweight configuration and operation, elasticity and availability of diverse infrastructures. Here this paper examines the seamless integration of cloud computing services as a conventional Grid site within the ATLAS workflow management and data management systems, while also offering new setups for interactive, parallel analysis. It underscores pivotal results that enhance the on-site computing model and outlines several R&D projects that have benefited from large-scale, elastic resource provisioning models. Furthermore, this study discusses the impact of cloud-enabled R&D projects in three domains: accelerators and AI/ML, ARM CPUs and columnar data analysis techniques.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2016

Are Lock-Free Concurrent Algorithms Practically Wait-Free?

Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is generally a very complex task, and the resulting algorithms are not always efficient. Although obtaining efficient wait-free algorithms has been a long-time goal for the theory community, most nonblocking commercial code is only lock-free. This article suggests a simple solution to this problem. We show that for a large class of lock-free algorithms, under scheduling conditions that approximate those found in commercial hardware architectures, lock-free algorithms behave as if they are wait-free. In other words, programmers can continue to design simple lock-free algorithms instead of complex wait-free ones, and in practice, they will get wait-free progress. Our main contribution is a new way of analyzing a general class of lock-free algorithms under a stochastic scheduler. Our analysis relates the individual performance of processes to the global performance of the system using Markov chain lifting between a complex per-process chain and a simpler system progress chain. We show that lock-free algorithms are not only wait-free with probability 1 but that in fact a general subset of lock-free algorithms can be closely bounded in terms of the average number of steps required until an operation completes. Here, to the best of our knowledge, this is the first attempt to analyze progress conditions, typically stated in relation to a worst-case adversary, in a stochastic model capturing their expected asymptotic behavior.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Dimensionality Reduction Library v 0.2

Dimensionality Reduction Library is a C++ library for dimensionality reduction. In the context of this library, dimensionality reduction is considered to consist of 1)estimation of the intrinsic dimensionality using sampled data, 2) Finding maps that reduce the dimensionality of data (forward map) or increase the dimensionality of data (reverse map) and 3) mapping arbitray coordinates to high and low dimensionalities. The library is intended to provide a consistent interface to multiple dimensionality reduction algorithms with an efficient C++ interface that runs efficiently on multicore architectures. A few routines have been optimized with an option for GPU acceleration or distributed computation. Currently the library offers intrinsic dimensionality estimation using point-PCA reconstruction error and/ residual variance. The following dimensionality reduction methods have been implemented: Principal Component Analysis Multidimensional Scaling Locally Linear Embedding IsoMap Autoencoder Neutral Networks An executable is also supplied that can be built to allow for command-line access to the library routines. A description for an application of the library for molecular structure analysis has been published.

BROWN, WILLIAM↗
DOE OSTI2018

DBSchema_DMS

PRISM Data Management System database schema. This is a collection of DDL files that define the database schema used by the Data Management System (DMS) component of the Pan-Omics Research Information Storage and Management system (PRISM) at the Pacific Northwest National Laboratory (PNNL). PRISM incorporates a diverse set of analysis tools and allows a wide range of operations to be incorporated, leveraing a state machine that is accessible to independent, distributed computational nodes. The system has scaled well as data volume has increased since 2002, while allowing adaptability for incorporating new and improved data analysis tools for more effective proteomics research.

Monroe, Matthew↗