Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer architecture”

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 829 records · Page 46
All sourcesNASA NTRSDOE OSTI
NASA NTRS2023

The 50-Year Landsat Collection 2 Archive

The Landsat global consolidated data archive now exceeds 50 years. In recognition of the need for consistently processed data across the Landsat satellite series, the U.S. Geological Survey (USGS) initiated collection-based processing of the entire archive that was processed as Collection 1 in 2016. In preparation for the data from the now successfully launched Landsat 9, the USGS reprocessed the Landsat archive as Collection 2 in 2020. This paper describes the rationale for, and the contents and advancements provided by Collection 2, and highlights the differences between the Collection 1 and Collection 2 products. Notably, the Collection 2 products have improved geolocation and, for the first time, the USGS provides a global inventory of Level 2 surface reflectance and surface temperature products. Also for the first time, the USGS used a commercial cloud computing architecture to efficiently process the archive and enable direct cloud access of the Landsat products. The paper concludes with discussion of likely improvements expected in Collection 3 in preparation for the Landsat Next mission that is planned for launch in the early 2030s.

Christopher J Crawford↗
DOE OSTI2015

Progress in Fast, Accurate Multi-scale Climate Simulations

We present a survey of physical and computational techniques that have the potential to con- tribute to the next generation of high-fidelity, multi-scale climate simulations. Examples of the climate science problems that can be investigated with more depth include the capture of remote forcings of localized hydrological extreme events, an accurate representation of cloud features over a range of spatial and temporal scales, and parallel, large ensembles of simulations to more effectively explore model sensitivities and uncertainties. Numerical techniques, such as adaptive mesh refinement, implicit time integration, and separate treatment of fast physical time scales are enabling improved accuracy and fidelity in simulation of dynamics and allow more complete representations of climate features at the global scale. At the same time, part- nerships with computer science teams have focused on taking advantage of evolving computer architectures, such as many-core processors and GPUs, so that these approaches which were previously considered prohibitively costly have become both more efficient and scalable. In combination, progress in these three critical areas is poised to transform climate modeling in the coming decades.

climate modeling↗
DOE OSTI2015

Open Research Challenges with Big Data - A Data-Scientist s Perspective

In this paper, we discuss data-driven discovery challenges of the Big Data era. We observe that recent innovations in being able to collect, access, organize, integrate, and query massive amounts of data from a wide variety of data sources have brought statistical data mining and machine learning under more scrutiny and evaluation for gleaning insights from the data than ever before. In that context, we pose and debate the question - Are data mining algorithms scaling with the ability to store and compute? If yes, how? If not, why not? We survey recent developments in the state-of-the-art to discuss emerging and outstanding challenges in the design and implementation of machine learning algorithms at scale. We leverage experience from real-world Big Data knowledge discovery projects across domains of national security, healthcare and manufacturing to suggest our efforts be focused along the following axes: (i) the data science challenge - designing scalable and flexible computational architectures for machine learning (beyond just data-retrieval); (ii) the science of data challenge the ability to understand characteristics of data before applying machine learning algorithms and tools; and (iii) the scalable predictive functions challenge the ability to construct, learn and infer with increasing sample size, dimensionality, and categories of labels. We conclude with a discussion of opportunities and directions for future research.

Big data↗
DOE OSTI2014

MiniAero

MiniAero is an MPl+X proxy app for gas dynamics problems. MiniAero can be used as a representative limited gas dynamics application to assess future computer architectures and programming models

Ken Franko, Micah Howard↗
DOE OSTI2015

Processor Emulator with Benchmark Applications

A processor emulator and a suite of benchmark applications have been developed to assist in characterizing the performance of data-centric workloads on current and future computer architectures. Some of the applications have been collected from other open source projects. For more details on the emulator and an example of its usage, see reference [1].

Lloyd, G. Scott↗
DOE OSTI2014

Machine Learning in the Big Data Era: Are We There Yet?

In this paper, we discuss the machine learning challenges of the Big Data era. We observe that recent innovations in being able to collect, access, organize, integrate, and query massive amounts of data from a wide variety of data sources have brought statistical machine learning under more scrutiny and evaluation for gleaning insights from the data than ever before. In that context, we pose and debate the question - Are machine learning algorithms scaling with the ability to store and compute? If yes, how? If not, why not? We survey recent developments in the state-of-the-art to discuss emerging and outstanding challenges in the design and implementation of machine learning algorithms at scale. We leverage experience from real-world Big Data knowledge discovery projects across domains of national security and healthcare to suggest our efforts be focused along the following axes: (i) the data science challenge - designing scalable and flexible computational architectures for machine learning (beyond just data-retrieval); (ii) the science of data challenge the ability to understand characteristics of data before applying machine learning algorithms and tools; and (iii) the scalable predictive functions challenge the ability to construct, learn and infer with increasing sample size, dimensionality, and categories of labels. We conclude with a discussion of opportunities and directions for future research.

Big Data↗
DOE OSTI2014

A deterministic discrete ordinates transport proxy application

Kripke is a simple 3D deterministic discrete ordinates (Sn) particle transport code that maintains the computational load and communications pattern of a real transport code. It is intended to be a research tool to explore different data layouts, new programming paradigms and computer architectures.

Source record↗
DOE OSTI2014

OpenSoC Fabric

Recent advancements in technology scaling have shown a trend towards greater integration with large-scale chips containing thousands of processors connected to memories and other I/O devices using non-trivial network topologies. Software simulation proves insufficient to study the tradeoffs in such complex systems due to slow execution time, whereas hardware RTL development is too time-consuming. We present OpenSoC Fabric, an on-chip network generation infrastructure which aims to provide a parameterizable and powerful on-chip network generator for evaluating future high performance computing architectures based on SoC technology. OpenSoC Fabric leverages a new hardware DSL, Chisel, which contains powerful abstractions provided by its base language, Scala, and generates both software (C++) and hardware (Verilog) models from a single code base. The OpenSoC Fabric2 infrastructure is modeled after existing state-of-the-art simulators, offers large and powerful collections of configuration options, and follows object-oriented design and functional programming to make functionality extension as easy as possible.

Source record↗
DOE OSTI2017

DARMA v. Beta 0.5

DARMA is a portability layer for asynchronous many-task (AMT) runtime systems. AMT runtime systems show promise to mitigate challenges imposed by next generation high performance computing architectures. However, current runtime system technologies are not production-ready. DARMA is a portability layer that seeks to insulate application developers from idiosyncrasies of individual runtime systems, thereby facilitating application-developer use of these technologies. DARMA comprises a frontend application programming interface (API) for application developers, a backend API for runtime system developers, and a translation that translates frontend API calls into backend API calls. Application developers use C++ abstractions to annotate both data and tasks in their code. The DARMA translation layer uses C++ template metaprogramming to capture data-task dependencies, and provides this information to a potential backend runtime system via a series of backend API calls.

Hollman, David↗
DOE OSTI2017

Limits on the Efficiency of Event-Based Algorithms for Monte Carlo Neutron Transport

The traditional form of parallelism in Monte Carlo particle transport simulations, wherein each individual particle history is considered a unit of work, does not lend itself well to data-level parallelism. Event-based algorithms, which were originally used for simulations on vector processors, may offer a path toward better utilizing data-level parallelism in modern computer architectures. In this study, a simple model is developed for estimating the efficiency of the event-based particle transport algorithm under two sets of assumptions. Data collected from simulations of four reactor problems using OpenMC was then used in conjunction with the models to calculate the speedup due to vectorization as a function of two parameters: the size of the particle bank and the vector width. When each event type is assumed to have constant execution time, the achievable speedup is directly related to the particle bank size. We observed that the bank size generally needs to be at least 20 times greater than vector size in order to achieve vector efficiency greater than 90%. When the execution times for events are allowed to vary, however, the vector speedup is also limited by differences in execution time for events being carried out in a single event-iteration. For some problems, this implies that vector effciencies over 50% may not be attainable. While there are many factors impacting performance of an event-based algorithm that are not captured by our model, it nevertheless provides insights into factors that may be limiting in a real implementation.

Romano, Paul K.↗
DOE OSTI2019

Parameter Determination of the Non-Local Granular Fluidity Model for Wood Chips by Comparison to Well-Defined Experimental Flow Systems

Unlike simple liquids and gases, the bulk flow and transport of granular materials remain poorly understood by physicists and pose many problems for engineers in designing and operating bulk-solids handling equipment. Discrete element methods (DEM) are currently considered the state-of-the-art for simulating the flow of granular materials, but DEM is limited in system size to about a few million particles due to high computational costs, even when run on current high-performance computing architectures. Continuum models are needed to simulate the flows of bulk solids in industrial-scale vessels and equipment, e.g., grain silos and coal-ash disposal piles. The focus of this work is the so-called nonlocal granular fluidity (NLGF) model that has been previously shown to reproduce observed nonlocal behaviors that arise when granular phenomena occur on length scales that are near the scale of the system geometry, e.g., the jamming of hopper outlets and the stop-height of piles on inclines [PNAS, 110(17), 6730-6735]. We have implemented the NLGF constitutive model in OpenFOAM CFD software, performed simulations of well-defined flow systems, and compared the results to experimental data. Experimental systems include a ring-shear tester, pile formation, flow on an incline, and discharge of a hopper. The tested material was loblolly pine wood chips that were milled and sieved to a size range of roughly 0.05-0.25 inches in diameter. The NLGF model parameters were tuned to achieve reasonable agreement between simulation and experimental results. Further, we evaluate the mapping between measurable material properties (bulk friction angle, particle-particle friction, compressibility, grain diameter, etc.) with NLGF model parameters, some of which have direct analogs (friction parameters and grain diameter) while others are constructs of the model (nonlocal amplitude and timescale of fluidity evolution).

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2021

Parallelizing the Unpacking and Clustering of Detector Data for Reconstruction of Charged Particle Tracks on Multi-core CPUs and Many-core GPUs

We present results from parallelizing the unpacking and clustering steps of the raw data from the silicon strip modules for reconstruction of charged particle tracks. Throughput is further improved by concurrently processing multiple events using nested OpenMP parallelism on CPU or CUDA streams on GPU. The new implementation along with earlier work in developing a parallelized and vectorized implementation of the combinatoric Kalman filter algorithm has enabled efficient global reconstruction of the entire event on modern computer architectures. We demonstrate the performance of the new implementation on Intel Xeon and NVIDIA GPU architectures.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Bringing OpenCL to Commodity RISC-V CPUs

The importance of open-source hardware has been increasing in recent years with the introduction of the RISC-V Open ISA. This has also accelerated the push for support of the open-source software stack from compiler tools to full-blown operating systems. Parallel computing with today’s Application Programming Interfaces such as OpenCL has proven to be effective at leveraging the parallelism in commodity multi-core processors and programmable parallel accelerators. However, to the best of our knowledge, there is currently no publicly available implementation of OpenCL targeting commodity RISC-V processors that is accessible to the open-source community. Besides opening RISC-V to the existing rich variety of scientific parallel applications, OpenCL also provides access to a unique genre of benchmarks useful in computer architecture research. In this work, we extended an Open-source implementation of OpenCL to target RISC-V CPUs. Our work not only cover commodity multi-core RISC-V processors, but also plethora of low- profile embedded RISC-V CPUs that often do not support atomic instructions or multi-threading.

Tine, Blaise↗
DOE OSTI2022

Evaluating HPC Kernels for Processing in Memory

Memory subsystems contribute significantly to the performance and energy efficiency of high-performance computing (HPC) applications. Traditional memory technologies with conventional organization (e.g., DRAM) are struggling to keep up with the increasing memory requirements of modern applications. Techniques such as multilayer cache hierarchy and out-of-order execution are still falling short of mitigating the penalty incurred by memory accesses. Processing-in-memory (PIM), which involves moving memory-intensive kernels to memory for execution instead of bringing the data to the processing unit, is emerging as a promising technique. PIM has recently received traction among computer architecture researchers, and the increasing research activity surrounding this technique indicates its potential to alleviate main memory performance bottlenecks. In this paper, we characterize and identify memory-intensive HPC kernels, perform a first-order evaluation of the PIM technique for selected HPC kernels, quantify performance deviation, and analyze the key factors that affect PIM efficiency.

Asifuzzaman, Kazi↗
DOE OSTI2023

Biomass Feedstock Flow Modeling at Exascale

Variable biomass feedstock handling in hoppers and screw conveyors can cause upstream failures and disrupt downstream conversion operations. Understanding how particle size, shape, and moisture content affect feedstock flowability is important for efficient biorefinery operation. We present the use of our open-source discrete element method (DEM) solver for predicting flows in large scale hoppers and assess its performance on state-of-the-art high performance computing platforms that use heterogenous computing architectures.

bioenergy↗
DOE OSTI2023

Mu2e - Research & Development

Current efforts are being conducted at Fermi National Laboratory to study potential violations in accepted theory that would otherwise suggest a restructuring of our fundamental understanding of the universe. Mu2e is one of these frontier projects that studies Charged Lepton Flavor Violation (CLFV) which if observed, would suggest physics beyond the Standard Model. Therefore, this note encompasses several projects that contribute to the fruition of Mu2e investigations. Due to the broad range of disciplinary inconsistencies that each project requires, all the work is being presented as a means of justifying contribution to Mu2e. The projects are comprised of a simulation exploring the extinction level of proton pulses after Recycler ring re-bunching by using G4beamline to simulate an 8GeV proton beam interaction with a titanium target, three Cherenkov radiation-based detectors and 2/3-fold and 3/3-fold coincidence rate analysis. Additionally, supplemental work for the implementation of a Micro Telecommunications Computing Architecture (TCA) crate to establish a peak finding algorithm to ensure that the out-of-time beam is less than 10$^{−10}$ fractional level along with single-layer inefficiency analysis on scintillation counters for the Cosmic-Ray Veto (CRV) analysis to ensure the overall inefficiency is 10$^{−4}$. Preliminary results have been achieved for the G4beamline simulation 2/3-fold and 3/3-fold coincidences which are in the order of 10$^{−9}$ and 10$^{−10}$, respectively. Only preliminary results of a triangular counter and four rectangular di-counters for the CRV have been realized. The microTCA crate development is still ongoing.

43 PARTICLE ACCELERATORS↗
DOE OSTI2022

The LLNL nuclear data infrastructure for the GNDS data format

The next generation of nuclear data infrastructure tools at the Livermore National Laboratory (LLNL) consists of pipeline of codes that read and process nuclear data from evaluated files saved in the new GNDS (Generalised Nuclear Data Structure) nuclear data format. The processing code FUDGE (For Updating Data and Generating Evaluations) is at the front-end of this pipeline as it reads and process the evaluated data for use in downstream transport codes. FUDGE is Python based with C and C++ extensions for computationally intensive tasks. As is the case for the evaluated data, the processed output is also saved in the GNDS format and the GIDI+ API is provided as the interface between the processed data and the transport codes. GIDI+ is a C++ based suite of codes and it includes GIDI (General Interaction Data Interface), a library for reading and writing GNDS data, and MCGIDI which is the cross section lookup, and reaction and product distribution sampling interface between Monte Carlo transport codes and the GNDS data. GIDI provides methods for easy access to the multi-group processed GNDS data and this is demonstrated through its implementation in ARDRA, the LLNL deterministic transport code. The evaluation and sampling methods in MCGIDI are available as both CPU and GPU methods which facilitates the use of MCGIDI in both traditional CPU-based as well as the next generation mixed model computational architectures. This is demonstrated through the GIDI+ implementation in MERCURY, the LLNL Monte Carlo transport code. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗