Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Parallel applications”

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 1,783 records · Page 99

Curved Piezoelectric Actuators for Stretching Optical Fibers

Assemblies containing curved piezoceramic fiber composite actuators have been invented as means of stretching optical fibers by amounts that depend on applied drive voltages. Piezoceramic fiber composite actuators are conventionally manufactured as sheets or ribbons that are flat and flexible, but can be made curved to obtain load-carrying ability and displacement greater than those obtainable from the flat versions. In the primary embodiment of this invention, piezoceramic fibers are oriented parallel to the direction of longitudinal displacement of the actuators so that application of drive voltage causes the actuator to flatten, producing maximum motion. Actuator motion can be transmitted to the optical fiber by use of hinges and clamp blocks. In the original application of this invention, the optical fiber contains a Bragg grating and the purpose of the controlled stretching of the fiber is to tune the grating as part of a small, lightweight, mode-hop-free, rapidly tunable laser for demodulating strain in Bragg-grating strain-measurement optical fibers attached to structures. The invention could also be used to apply controllable tensile force or displacement to an object other than an optical fiber.

Allison, Sidney G.↗

New Techniques for High-Contrast Imaging with ADI: The ACORNS-ADI SEEDS Data Reduction Pipeline

We describe Algorithms for Calibration, Optimized Registration, and Nulling the Star in Angular Differential Imaging (ACORNS-ADI), a new, parallelized software package to reduce high-contrast imaging data, and its application to data from the Strategic Exploration of Exoplanets and Disks (SEEDS) survey. We implement seyeral new algorithms, includbg a method to centroid saturated images, a trimmed mean for combining an image sequence that reduces noise by up to approx 20%, and a robust and computationally fast method to compute the sensitivitv of a high-contrast obsen-ation everywhere on the field-of-view without introducing artificial sources. We also include a description of image processing steps to remove electronic artifacts specific to Hawaii2-RG detectors like the one used for SEEDS, and a detailed analysis of the Locally Optimized Combination of Images (LOCI) algorithm commonly used to reduce high-contrast imaging data. ACORNS-ADI is efficient and open-source, and includes several optional features which may improve performance on data from other instruments. ACORNS-ADI is freely available for download at www.github.com/t-brandt/acorns_-adi under a BSD license

Brandt, Timothy D.↗

Subscale Validation of the Subsurface Active Filtration of Exhaust (SAFE) Approach to NTP Ground Testing

Brief History of NTP: Project Rover Began in 1950s by Los Alamos Scientific Labs (now Los Alamos National Labs) and ran until 1970s Tested a series of nuclear reactor engines of varying size at Nevada Test Site (now Nevada National Security Site) Ranged in scale from 111 kN (25 klbf) to 1.1 MN (250 klbf) Included Nuclear Furnace-1 tests Demonstrated the viability and capability of a nuclear rocket engine test program One of Kennedys 4 goals during famous moon speech to Congress Nuclear Engines for Rocket Vehicle Applications (NERVA) Atomic Energy Commission and NASA joint venture started in 1964 Parallel effort to Project Rover was focused on technology demonstration Tested XE engine, a 245-kN (55-klbf) engine to demonstrate startup shutdown sequencing. Hot-hydrogen stream is passed directly through fuel elements potential for radioactive material to be eroded into gaseous fuel flow as identified in previous programs NERVA and Project Rover (1950s-70s) were able to test in open atmosphere similar to conventional rocket engine test stands today Nuclear Furance-1 tests employed a full scrubber system Increased government and environmental regulations prohibit the modern testing in open atmosphere. Since the 1960s, there has been an increasing cessation on open air testing of nuclear material Political and national security concerns further compound the regulatory environment

Test Facilities↗

An Approach to Solving Enclosure Radiation Problems in A Multi-Physics Context

Thermal protection system analysis of complex features or damage sites can sometimes require modeling of high temperature enclosures. Implementing efficient and accurate view-factor algorithms required to model such problems is complex. The current work leverages the Non-equilibrium Radiation (NERO) software, which solves the radiation transport equation in a finite-volume scheme, to alleviating challenges often faced with view-factor calculations. By assuming heat transfer occurs only between grey bodies and that the medium is non-participating, computational cost of the method is significantly reduced. The enclosure physics are modeled through emitting and reflecting boundary conditions in NERO. The emitted radiative flux is dependent on the wall temperature which is a solution to the material response, obtained from Icarus, in this context. The Ares framework manages the time-advancement and exchange of the necessary data between the solvers. The surface energy balance is modified to account for the enclosure terms within the material response boundary condition. The methodology was verified against analytical solutions including radiating parallel plates, a hollow cylinder (shown in Fig. 1), and a hemisphere. Application of the methodology to inform the design of components of the Dragonfly system will be shown.

Ablation↗

PCM-Based Durable Write Cache for Fast Disk I/O

Flash based solid-state devices (FSSDs) have been adopted within the memory hierarchy to improve the performance of hard disk drive (HDD) based storage system. However, with the fast development of storage-class memories, new storage technologies with better performance and higher write endurance than FSSDs are emerging, e.g., phase-change memory (PCM). Understanding how to leverage these state-of-the-art storage technologies for modern computing systems is important to solve challenging data intensive computing problems. In this paper, we propose to leverage PCM for a hybrid PCM-HDD storage architecture. We identify the limitations of traditional LRU caching algorithms for PCM-based caches, and develop a novel hash-based write caching scheme called HALO to improve random write performance of hard disks. To address the limited durability of PCM devices and solve the degraded spatial locality in traditional wear-leveling techniques, we further propose novel PCM management algorithms that provide effective wear-leveling while maximizing access parallelism. We have evaluated this PCM-based hybrid storage architecture using applications with a diverse set of I/O access patterns. Our experimental results demonstrate that the HALO caching scheme leads to an average reduction of 36.8% in execution time compared to the LRU caching scheme, and that the SFC wear leveling extends the lifetime of PCM by a factor of 21.6.

99 GENERAL AND MISCELLANEOUS↗

Routing performance analysis and optimization within a massively parallel computer

An apparatus, program product and method optimize the operation of a massively parallel computer system by, in part, receiving actual performance data concerning an application executed by the plurality of interconnected nodes, and analyzing the actual performance data to identify an actual performance pattern. A desired performance pattern may be determined for the application, and an algorithm may be selected from among a plurality of algorithms stored within a memory, the algorithm being configured to achieve the desired performance pattern based on the actual performance data.

97 MATHEMATICS AND COMPUTING↗

Supporting the Development of Resilient Message Passing Applications using Simulation

An emerging aspect of high-performance computing (HPC) hardware/software co-design is investigating performance under failure. The work in this paper extends the Extreme-scale Simulator (xSim), which was designed for evaluating the performance of message passing interface (MPI) applications on future HPC architectures, with fault-tolerant MPI extensions proposed by the MPI Fault Tolerance Working Group. xSim permits running MPI applications with millions of concurrent MPI ranks, while observing application performance in a simulated extreme-scale system using a lightweight parallel discrete event simulation. The newly added features offer user-level failure mitigation (ULFM) extensions at the simulated MPI layer to support algorithm-based fault tolerance (ABFT). The presented solution permits investigating performance under failure and failure handling of ABFT solutions. The newly enhanced xSim is the very first performance tool that supports ULFM and ABFT.

Engelmann, Christian↗

Damselfly Network Simulator

Damselfly is a model-based parallel network simulator. It can simulate communication patterns of High Performance Computing applications on different network topologies. It outputs steady-state network traffic for a communication pattern, which can help in studying network congestion and its impact on performance.

Source record↗

Sensitivity Analysis of a Wireless Power Transfer (WPT) System for Electric Vehicle Application

This paper presents a detailed parametric sensitivity analysis for a wireless power transfer (WPT) system in electric vehicle application. Specifically, several key parameters for sensitivity analysis of a series-parallel (SP) WPT system are derived first based on analytical modeling approach, which includes the equivalent input impedance, active / reactive power, and DC voltage gain. Based on the derivation, the impact of primary side compensation capacitance, coupling coefficient, transformer leakage inductance, and different load conditions on the DC voltage gain curve and power curve are studied and analyzed. It is shown that the desired power can be achieved by just changing frequency or voltage depending on the design value of coupling coefficient. However, in some cases both have to be modified in order to achieve the required power transfer.

electric vehicle↗

The Design of Stable, Low-Mass Support and Cooling Structures

Designs of stable, low-mass support and cooling structures for intelligent trackers should take into account the additional power dissipation associated with local trigger generation, high speed communications, and power delivery, as well as the spatial distributions of heat sources. For many applications, a modular design can alleviate cooling and support issues and allow parallel fabrication at multiple locations. A proposed design for CMS phase 2 upgrade track trigger formation will be used to illustrate the extent to which design requirements are specific to intelligent tracking, ways in which those design requirements might be met, and implications for local tracker geometry, material selection, structural stability, and the material budget.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Manipulation of Scattering Spectra with Topology of Light and Matter

Structured lights, including beams carrying spin and orbital angular momenta, radially and azimuthally polarized vector beams, as well as spatiotemporal optical vortices, have attracted significant interest due to their unique amplitude, phase front, polarization, and temporal structures, enabling a variety of applications in optical and quantum communications, micromanipulation, and super-resolution imaging. In parallel, structured optical materials, metamaterials, and metasurfaces consisting of engineered unit cells—meta-atoms, opened new avenues for manipulating the flow of light and optical sensing. While several studies explored structured light effects on the individual meta-atoms, their shapes are largely limited to simple spherical geometries. However, the synergy of the structured light and complex-shaped meta-atoms has not been fully explored. Here, in this paper, the role of the helical wavefront of Laguerre–Gaussian beams in the excitation and suppression of higher-order resonant modes inside all-dielectric meta-atoms of various shapes, aspect ratios, and orientations, is demonstrated and the excitation of various multipolar moments that are not accessible via unstructured light illumination is predicted. The presented study elucidates the role of the complex phase distribution of the incident light in shape-dependent resonant scattering, which is of utmost importance in a wide spectrum of applications ranging from remote sensing to spectroscopy.

42 ENGINEERING↗

Development of Large-Dimension Configuration-Interaction Shell-Model Code

The project period was devoted to several developments in the technical capabilities of the BIGSTIC large-dimension configuration-interaction shell-model code, written in Fortran 90. The specific computational goals for the project period were: (1) store Lanczos vectors on core in RAM to minimize I/O; (2) rewrite reorthogonalization with Lanczos vectors stored in core, consult with personnel at LLNL, LBL, ORNL, Iowa State University to maximize performance; (3) restrict creation of N-body jumps to those needed by an individual node; and (4) distribute 3-body interaction over many cores. Significant progress was made towards these goals, especially (1) and (2), although in the process they discovered intermediate tasks that had to be accomplished first. The achievements were as follows - I put into place structures and algorithms to facility fragmenting very large-dimension Lanczos intermediate vectors. Only by fragmenting the vectors can we carry out (1) and (2). In addition, I reorganized the action of the Hamiltonian matrix and created a new division of operations for MPI. Based upon earlier work, I made plans of a revised algorithm for distribution of work with MPI, with a particular eye towards breaking up the Lanczos vectors. I introduce a new derived type (opbundles) which collects the parameters for the Hamiltonian, and rewrote the application routines to use it. It has been validated and verified. I made progress towards revised MPI parallelization. Using the opbundles, I was able to compute a distribution of work over compute nodes, which should be very efficient. This new distribution is easier to derive and more efficient, in principle, than the old distribution. Furthermore, it should make applications with fragmented Lanczos vectors easier. Implementation is still in progress.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Trends in data locality abstractions for HPC systems

The cost of data movement has always been an important concern in high performance computing (HPC) systems. It has now become the dominant factor in terms of both energy consumption and performance. Support for expression of data locality has been explored in the past, but those efforts have had only modest success in being adopted in HPC applications for various reasons. However, with the increasing complexity of the memory hierarchy and higher parallelism in emerging HPC systems, locality management has acquired a new urgency. Developers can no longer limit themselves to low-level solutions and ignore the potential for productivity and performance portability obtained by using locality abstractions. Fortunately, the trend emerging in recent literature on the topic alleviates many of the concerns that got in the way of their adoption by application developers. Data locality abstractions are available in the forms of libraries, data structures, languages and runtime systems; a common theme is increasing productivity without sacrificing performance. Furthermore, this paper examines these trends and identifies commonalities that can combine various locality concepts to develop a comprehensive approach to expressing and managing data locality on future large-scale high-performance computing systems.

97 MATHEMATICS AND COMPUTING↗

Parallel membership queries on very large scientific data sets using bitmap indexes

© 2019 John Wiley & Sons, Ltd. Many scientific applications produce very large amounts of data as advances in hardware fuel computing and experimental facilities. Managing and analyzing massive quantities of scientific data is challenging as data are often stored in specific formatted files, such as HDF5 and NetCDF, which do not offer appropriate search capabilities. In this research, we investigated a special class of search capability, called membership query, to identify whether queried elements of a set are members of an attribute. Attributes that naturally have classification values appear frequently in scientific domains such as category and object type as well as in daily life such as zip code and occupation. Because classification attribute values are discrete and require random data access, performing a membership query on a large scientific data set creates challenges. We applied bitmap indexing and parallelization to membership queries to overcome these challenges. Bitmap indexing provides high performance not only for low cardinality attributes but also for high cardinality attributes, such as floating-point variables, electric charge, or momentum in a particle physics data set, due to compression algorithms such as Word-Aligned Hybrid. We conducted experiments, in a highly parallelized environment, on data obtained from a particle accelerator model and a synthetic data set.

Yildiz, Beytullah↗

Parallelized multiple nozzle system and method to produce layered droplets and fibers for microencapsulation

The present disclosure relates to a nozzle system for use in a microfluidic production application for producing at least one of particles, capsules or fibers. The system has a main body portion having a compressed fluid inlet and a core fluid inlet, and a plurality of parallel arranged core fluid nozzles that receive the core fluid and create a plurality of core fluid streams. At least one compressed fluid inlet associated with the main body channels compressed fluid to areas adjacent ends of the core fluid nozzles. An apertured plate having a plurality of apertures is arranged near the ends of the core fluid nozzles, with each aperture being uniquely associated with a single one of the core fluid nozzles. The compressed fluid acts on the core fluid streams exiting the core fluid nozzles to help create, with the apertures, at least one of core fluid droplets or core fluid fibers from the core fluid streams.

Ye, Congwang↗

Performance Analysis of Speculative Parallel Adaptive Local Timestepping for Conservation Laws

Stable simulation of conservation laws, such as those used to model fluid dynamics and plasma physics applications, requires the satisfaction of the so-called Courant-Friedrichs-Lewy condition. By allowing regions of the mesh to advance with different timesteps that locally satisfy this stability constraint, significant work reduction can be attained when compared to a time integration scheme using a single timestep size. However, parallelizing this algorithm presents considerable difficulty. Since the stability condition depends on the state of the system, dependencies become dynamic and potentially non-local. In this article, we present an adaptive local timestepping algorithm using an optimistic (Timewarp-based) parallel discrete event simulation. We introduce waiting heuristics to limit misspeculation and a semi-static load balancing scheme to eliminate load imbalance as parts of the mesh require finer or coarser timesteps. Last, we outline an interface for separating the physics of the specific conservation law from the temporal integration allowing for productive adoption of our proposed algorithm. We present a misspeculation study for three conservation laws, demonstrating both the productivity of the local timestepping API, for which 74% of the lines of code are reused across different conservation laws, and the robustness of the waiting heuristics—at most 1.5% of element updates are rolled back. Our performance studies demonstrate up to a 2.8× speedup versus a baseline unoptimized local timestepping approach, a 4x improvement in per-node throughput compared to an MPI parallelization of synchronous timestepping, and scalability up to 3,072 cores on NERSC’s Cori Haswell partition.

97 MATHEMATICS AND COMPUTING↗

Small File Aggregation with PLFS [Slides]

Today’s computational science demands have resulted in ever larger parallel computers, and storage systems have grown to match these demands. Parallel file systems used in this environment are increasingly specialized to extract the highest possible performance for large I/O operations, at the expense of other potential workloads. While some applications have adapted to I/O best practices and can obtain good performance on these systems, the natural I/O patterns of many applications result in the generation of a huge number of small files, the creation of which is poorly served by current parallel file systems at very large scale. This paper describes a new technique for optimizing small file access in parallel file systems for these very large scale systems. The idea is to use a virtual parallel log-structure file system on the compute nodes in order to aggregate large numbers of small files in compute node memory and then stream their data sequentially to a much smaller number of physical files on an underlying parallel file system. The technique is implemented and evaluated using PLFS as the aggregating middleware. We evaluate our system with micro-benchmarks on a local OSX filesystem and with an MPI extension of the standard Postmark to provide results at scale on both Lustre and PanFS parallel filesystems. We observe as much as a 33x improvement in small file create rates on a single host, and 30x improvement in small file write rates, compared to a baseline Lustre configuration on a leadership computing platform using 16,384 cores and achieve an unprecedented create rate of 200 million files per second.

97 MATHEMATICS AND COMPUTING↗

PREPARING FOR EXASCALE: ORNL Leadership Computing Application Requirements and Strategy

In 2009 the Oak Ridge Leadership Computing Facility (OLCF), a U.S. Department of Energy (DOE) facility at the Oak Ridge National Laboratory (ORNL) National Center for Computational Sciences (NCCS), elicited petascale computational science requirements from leading computational scientists in the international science community. This effort targeted science teams whose projects received large computer allocation awards on OLCF systems. A clear finding of this process was that in order to reach their science goals over the next several years, multiple projects will require computational resources in excess of an order of magnitude more powerful than those currently available. Additionally, for the longer term, next-generation science will require computing platforms of exascale capability in order to reach DOE science objectives over the next decade. It is generally recognized that achieving exascale in the proposed time frame will require disruptive changes in computer hardware and software. Processor hardware will become necessarily heterogeneous and will include accelerator technologies. Software must undergo the concomitant changes needed to extract the available performance from this heterogeneous hardware. This disruption portends to be substantial, not unlike the change to the message passing paradigm in the computational science community over 20 years ago. Since technological disruptions take time to assimilate, we must aggressively embark on this course of change now, to insure that science applications and their underlying programming models are mature and ready when exascale computing arrives. This includes initiation of application readiness efforts to adapt existing codes to heterogeneous architectures, support of relevant software tools, and procurement of next-generation hardware testbeds for porting and testing codes. The 2009 OLCF requirements process identified numerous actions necessary to meet this challenge: (1) Hardware capabilities must be advanced on multiple fronts, including peak flops, node memory capacity, interconnect latency, interconnect bandwidth, and memory bandwidth. (2) Effective parallel programming interfaces must be developed to exploit the power of emerging hardware. (3) Science application teams must now begin to adapt and reformulate application codes to the new hardware and software, typified by hierarchical and disparate layers of compute, memory and concurrency. (4) Algorithm research must be realigned to exploit this hierarchy. (5) When possible, mathematical libraries must be used to encapsulate the required operations in an efficient and useful way. (6) Software tools must be developed to make the new hardware more usable. (7) Science application software must be improved to cope with the increasing complexity of computing systems. (8) Data management efforts must be readied for the larger quantities of data generated by larger, more accurate science models. Requirements elicitation, analysis, validation, and management comprise a difficult and inexact process, particularly in periods of technological change. Nonetheless, the OLCF requirements modeling process is becoming increasingly quantitative and actionable, as the process becomes more developed and mature, and the process this year has identified clear and concrete steps to be taken. This report discloses (1) the fundamental science case driving the need for the next generation of computer hardware, (2) application usage trends that illustrate the science need, (3) application performance characteristics that drive the need for increased hardware capabilities, (4) resource and process requirements that make the development and deployment of science applications on next-generation hardware successful, and (5) summary recommendations for the required next steps within the computer and computational science communities.

applications requirements↗