Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel, scaling”

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 757 records · Page 42

ACE3P Computations of Wakefield Coupling in the CLIC Two-Beam Accelerator

The Compact Linear Collider (CLIC) provides a path to a multi-TeV accelerator to explore the energy frontier of High Energy Physics. Its novel two-beam accelerator concept envisions rf power transfer to the accelerating structures from a separate high-current decelerator beam line consisting of power extraction and transfer structures (PETS). It is critical to numerically verify the fundamental and higher-order mode properties in and between the two beam lines with high accuracy and confidence. To solve these large-scale problems, SLAC's parallel finite element electromagnetic code suite ACE3P is employed. Using curvilinear conformal meshes and higher-order finite element vector basis functions, unprecedented accuracy and computational efficiency are achieved, enabling high-fidelity modeling of complex detuned structures such as the CLIC TD24 accelerating structure. In this paper, time-domain simulations of wakefield coupling effects in the combined system of PETS and the TD24 structures are presented. The results will help to identify potential issues and provide new insights on the design, leading to further improvements on the novel CLIC two-beam accelerator scheme.

43 PARTICLE ACCELERATORS↗

Recovery Act - CAREER: Sustainable Silicon -- Energy-Efficient VLSI Interconnect for Extreme-Scale Computing

The research goal of this CAREER proposal is to develop energy-efficient, VLSI interconnect circuits and systems that will facilitate future massively-parallel, high-performance computing. Extreme-scale computing will exhibit massive parallelism on multiple vertical levels, from thou­ sands of computational units on a single processor to thousands of processors in a single data center. Unfortunately, the energy required to communicate between these units at every level (on­ chip, off-chip, off-rack) will be the critical limitation to energy efficiency. Therefore, the PI's career goal is to become a leading researcher in the design of energy-efficient VLSI interconnect for future computing systems.

97 MATHEMATICS AND COMPUTING↗

Investigation on the Parallel Operation of Discrete SiC BJTs and JFETs

This paper presents an analysis of single discrete silicon carbide (SiC) JFET and BJT devices and their parallel operation. The static and dynamic characteristics of the devices were obtained over a wide range of temperature to study the scaling of device parameters. The static parameters like on-resistance, threshold voltage, current gains, transconductance, and leakage currents were extracted to show how these parameters would scale as the devices are paralleled. A detailed analysis of the dynamic current sharing between the paralleled devices during the switching transients and energy losses at different voltages and currents is also presented. The effect of the gate driver on the device transient behavior of the paralleled devices was studied, and it was shown that faster switching speeds of the devices could cause mismatches in current shared during transients.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Measurement of Flow Phenomena in a Lower Plenum Model of a Prismatic Gas-Cooled Reactor

Mean-velocity-field and turbulence data are presented that measure turbulent flow phenomena in an approximately 1:7 scale model of a region of the lower plenum of a typical prismatic gas-cooled reactor (GCR) similar to a General Atomics Gas-Turbine-Modular Helium Reactor (GTMHR) design. The data were obtained in the Matched-Index-of-Refraction (MIR) facility at Idaho National Laboratory (INL) and are offered for assessing computational fluid dynamics (CFD) software. This experiment has been selected as the first Standard Problem endorsed by the Generation IV International Forum. Results concentrate on the region of the lower plenum near its far reflector wall (away from the outlet duct). The flow in the lower plenum consists of multiple jets injected into a confined cross flow - with obstructions. The model consists of a row of full circular posts along its centerline with half-posts on the two parallel walls to approximate geometry scaled to that expected from the staggered parallel rows of posts in the reactor design. The model is fabricated from clear, fused quartz to match the refractive-index of the working fluid so that optical techniques may be employed for the measurements. The benefit of the MIR technique is that it permits optical measurements to determine flow characteristics in complex passages in and around objects to be obtained without locating intrusive transducers that will disturb the flow field and without distortion of the optical paths. An advantage of the INL system is its large size, leading to improved spatial and temporal resolution compared to similar facilities at smaller scales. A three-dimensional (3-D) Particle Image Velocimetry (PIV) system was used to collect the data. Inlet jet Reynolds numbers (based on the jet diameter and the time-mean bulk velocity) are approximately 4,300 and 12,400. Uncertainty analyses and a discussion of the standard problem are included. The measurements reveal developing, non-uniform, turbulent flow in the inlet jets and complicated flow patterns in the model lower plenum. Data include three-dimensional vector plots, data displays along the coordinate planes (slices) and presentations that describe the component flows at specific regions in the model. Information on inlet conditions is also presented.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Modulated heat pulse propagation and partial transport barriers in chaotic magnetic fields

Direct numerical simulations of the time dependent parallel heat transport equation modeling heat pulses driven by power modulation in three-dimensional chaotic magnetic fields are presented. The numerical method is based on the Fourier formulation of a Lagrangian-Green's function method that provides an accurate and efficient technique for the solution of the parallel heat transport equation in the presence of harmonic power modulation. The numerical results presented provide conclusive evidence that even in the absence of magnetic flux surfaces, chaotic magnetic field configurations with intermediate levels of stochasticity exhibit transport barriers to modulated heat pulse propagation. In particular, high-order islands and remnants of destroyed flux surfaces (Cantori) act as partial barriers that slow down or even stop the propagation of heat waves at places where the magnetic field connection length exhibits a strong gradient. Results on modulated heat pulse propagation in fully stochastic fields and across magnetic islands are also presented. In qualitative agreement with recent experiments in large helical device and DIII-D, it is shown that the elliptic (O) and hyperbolic (X) points of magnetic islands have a direct impact on the spatio-temporal dependence of the amplitude of modulated heat pulses.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Measurement of Turbulent Flow Phenomena for the Lower Plenum of a Prismatic Gas-Cooled Reactor

Mean velocity field and turbulence data are presented that measure turbulent flow phenomena in an approximately 1:7 scale model of a region of the lower plenum of a typical prismatic gas-cooled reactor (GCR) similar to a General Atomics design (Gas-Turbine-Modular Helium Reactor). The datawere obtained in the Matched-Index-of-Refraction (MIR) facility at Idaho National Laboratory (INL) and are offered as a benchmark for assessing computational fluid dynamics (CFD) software. This experiment has been selected as the first Standard Problem endorsed by the Generation IV International Forum. The primary objective of this paper is to document the experiment and present a sample of the data set that has been established for this standard problem. Present results concentrate on the region of the lower plenum near its far reflector wall (away from the outlet duct). The flowin the lower plenum consists of multiple jets injected into a confined crossflow—with obstructions. The model consists of a row of full circular posts along its centerline with half-posts on the two parallel walls to approximate flow scaled to that expected from the staggered parallel rows of posts in the reactor design. Posts, side walls and end walls are fabricated from clear, fused quartz to match the refractive index of the mineral oil working fluid so that optical techniques may be employed for the measurements. The benefit of the MIR technique is that it permits optical measurements to determine flow characteristics in complex passages and around objects to be obtained without locating intrusive transducers that will disturb the flow field and without distortion of the optical paths. An advantage of the INL system is its large size, leading to improved spatial and temporal resolution compared to similar facilities at smaller scales. A three-dimensional (3D) particle image velocimetry (PIV) system was used to collect the data. Inlet-jet Reynolds numbers (based on the hydraulic diameter of the jet and the timemean average flow rate) are approximately 4300 and 12,400. Uncertainty analysis and a discussion of the standard problem are included. The measurements reveal complicated flow patterns that include several large recirculation zones, reverse flow near the simulated reflector wall, recirculation zones in the upper portion of the plenum and complex flow patterns around the support posts. Data include three-dimensional PIV images of flow planes, data displays along the coordinate planes (slices) and presentations that describe the component flows at specific regions in the model.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Data Movement Dominates: Advanced Memory Technology to Address the Real Exascale Power Problem

Energy is the fundamental barrier to Exascale supercomputing and is dominated by the cost of moving data from one point to another, not computation. Similarly, performance is dominated by data movement, not computation. The solution to this problem requires three critical technologies: 3D integration, optical chip-to-chip communication, and a new communication model. The central goal of the Sandia led "Data Movement Dominates" project aimed to develop memory systems and new architectures based on these technologies that have the potential to lower the cost of local memory accesses by orders of magnitude and provide substantially more bandwidth. Only through these transformational advances can future systems reach the goals of Exascale computing with a manageable power budgets. The Sandia led team included co-PIs from Columbia University, Lawrence Berkeley Lab, and the University of Maryland. The Columbia effort of Data Movement Dominates focused on developing a physically accurate simulation environment and experimental verification for optically-connected memory (OCM) systems that can enable continued performance scaling through high-bandwidth capacity, energy-efficient bit-rate transparency, and time-of-flight latency. With OCM, memory device parallelism and total capacity can scale to match future high-performance computing requirements without sacrificing data-movement efficiency. When we consider systems with integrated photonics, links to memory can be seamlessly integrated with the interconnection network-in a sense, memory becomes a primary aspect of the interconnection network. At the core of the Columbia effort, toward expanding our understanding of OCM enabled computing we have created an integrated modeling and simulation environment that uniquely integrates the physical behavior of the optical layer. The PhoenxSim suite of design and software tools developed under this effort has enabled the co-design of and performance evaluation photonics-enabled OCM architectures on Exascale computing systems.

97 MATHEMATICS AND COMPUTING↗

PARALLEL HOP: A SCALABLE HALO FINDER FOR MASSIVE COSMOLOGICAL DATA SETS

Modern N-body cosmological simulations contain billions (10{sup 9}) of dark matter particles. These simulations require hundreds to thousands of gigabytes of memory and employ hundreds to tens of thousands of processing cores on many compute nodes. In order to study the distribution of dark matter in a cosmological simulation, the dark matter halos must be identified using a halo finder, which establishes the halo membership of every particle in the simulation. The resources required for halo finding are similar to the requirements for the simulation itself. In particular, simulations have become too extensive to use commonly employed halo finders, such that the computational requirements to identify halos must now be spread across multiple nodes and cores. Here, we present a scalable-parallel halo finding method called Parallel HOP for large-scale cosmological simulation data. Based on the halo finder HOP, it utilizes message passing interface and domain decomposition to distribute the halo finding workload across multiple compute nodes, enabling analysis of much larger data sets than is possible with the strictly serial or previous parallel implementations of HOP. We provide a reference implementation of this method as a part of the toolkit {sup yt}, an analysis toolkit for adaptive mesh refinement data that include complementary analysis modules. Additionally, we discuss a suite of benchmarks that demonstrate that this method scales well up to several hundred tasks and data sets in excess of 2000{sup 3} particles. The Parallel HOP method and our implementation can be readily applied to any kind of N-body simulation data and is therefore widely applicable.

79 ASTRONOMY AND ASTROPHYSICS↗

Diving into Petascale Production File Systems through Large Scale Profiling and Analysis

As leadership computing facilities grow their storage capacity into the multi- petabyte range, the number of files and directories leap into the scale of billions. A complete profiling of such a parallel file system in a production environment presents a unique challenge. On one hand, the time, resources, and negative performance impact on production users can make regular profiling difficult. On the other hand, the result of such profiling can yield much needed understanding of the file system's general characteristics, as well as provide insight to how users write and access their data on a grand scale. This paper presents a lightweight and scalable profiling solution that can efficiently walk, analyze, and profile multi-petabyte parallel file systems. This tool has been deployed and is in regular use on very large-scale production parallel file systems at both Oak Ridge National Lab's Oak Ridge Leadership Facility (OLCF) and Lawrence Livermore National Lab's Livermore Computing (LC) facilities. We present the results of our initial analysis on the data collected from these two large-scale production systems, organized into three use cases: (1) file system snapshot and composition, (2) striping pattern analysis for Lustre, and (3) simulated storage capacity utilization in preparation for future file systems. Our analysis shows that on the OLCF file system, over 96% of user files exhibit the default stripe width, potentially limiting performance on large files by underutilizing storage servers and disks. Our simulated block analysis quantitatively shows the space overhead when doing a forklift system migration. It also reveals that due to the difference in system compositions (OLCF vs. LC), we can achieve better performance and space trade-offs by employing different native file system block sizes.

Wang, Feiyi↗

A massively-parallel electronic-structure calculations based on real-space density functional theory

Based on the real-space finite-difference method, we have developed a first-principles density functional program that efficiently performs large-scale calculations on massively-parallel computers. In addition to efficient parallel implementation, we also implemented several computational improvements, substantially reducing the computational costs of O(N{sup 3}) operations such as the Gram-Schmidt procedure and subspace diagonalization. Using the program on a massively-parallel computer cluster with a theoretical peak performance of several TFLOPS, we perform electronic-structure calculations for a system consisting of over 10,000 Si atoms, and obtain a self-consistent electronic-structure in a few hundred hours. We analyze in detail the costs of the program in terms of computation and of inter-node communications to clarify the efficiency, the applicability, and the possibility for further improvements.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A New View on Origin, Role and Manipulation of Large Scales in Turbulent Boundary Layers

The potential of passive 'manipulators' for altering the large scale turbulent structures in boundary layers was investigated. Utilizing smoke wire visualization and multisensor probes, the experiment verified that the outer scales could be suppressed by simple arrangements of parallel plates. As a result of suppressing the outer scales in turbulent layers, a decrease in the streamwise growth of the boundary layer thickness was achieved and was coupled with a 30 percent decrease in the local wall friction coefficient. After accounting for the drag on the manipulator plates, the net drag reduction reached a value of 20 percent within 55 boundary layer thicknesses downstream of the device. No evidence for the reoccurrence of the outer scales was present at this streamwise distance thereby suggesting that further reductions in the net drag are attainable. The frequency of occurrence of the wall events is simultaneously dependent on the two parameters, Re2 delta sub 2 and Re sub x. As a result of being able to independently control the inner and outer boundary layer characteristics with these manipulators, a different view of these layers emerged.

Corke, T. C.↗

Physical interpretation of the angle-dependent magnetic helicity spectrum in the solar wind: The nature of turbulent fluctuations near the proton gyroradius scale

Motivated by recent observations of distinct parallel and perpendicular signatures in magnetic helicity measurements segregated by wave period and angle between the local magnetic field and the solar wind velocity, this paper undertakes a comparison of three intervals of Ulysses data with synthetic time series generated from a physically motivated turbulence model. From these comparisons, it is hypothesized that the observed signatures result from a perpendicular cascade of Alfvénic fluctuations and a local, non-turbulent population of ion-cyclotron or whistler waves generated by temperature anisotropy instabilities. By constraining the model's free parameters through comparison to in situ data, it is found that, on average, ∼95% of the power near dissipative scales is contained in a perpendicular Alfvénic cascade and that the parallel fluctuations are propagating nearly unidirectionally. The effects of aliasing on magnetic helicity measurements are considered and shown to be significant near the Nyquist frequency.

79 ASTRONOMY AND ASTROPHYSICS↗

Visualization Co-Processing of a CFD Simulation

OVERFLOW, a widely used CFD simulation code, is combined with a visualization system, pV3, to experiment with an environment for simulation/visualization co-processing on a SGI Origin 2000 computer(O2K) system. The shared memory version of the solver is used with the O2K 'pfa' preprocessor invoked to automatically discover parallelism in the source code. No other explicit parallelism is enabled. In order to study the scaling and performance of the visualization co-processing system, sample runs are made with different processor groups in the range of 1 to 254 processors. The data exchange between the visualization system and the simulation system is rapid enough for user interactivity when the problem size is small. This shared memory version of OVERFLOW, with minimal parallelization, does not scale well to an increasing number of available processors. The visualization task takes about 18 to 30% of the total processing time and does not appear to be a major contributor to the poor scaling. Improper load balancing and inter-processor communication overhead are contributors to this poor performance. Work is in progress which is aimed at obtaining improved parallel performance of the solver and removing the limitations of serial data transfer to pV3 by examining various parallelization/communication strategies, including the use of the explicit message passing.

Vaziri, Arsi↗

PaKman: Scalable Assembly of Large Genomes on Distributed Memory Machines

De novo genome assembly is a fundamental problem in the field of bioinformatics, that aims to assemble the DNA sequence of an unknown genome from numerous short DNA fragments (aka reads) obtained from it. With the advent of high-throughput sequencing technologies, billions of reads can be generated in a matter of hours, necessitating efficient parallelization of the assembly process. While multiple parallel solutions have been proposed in the past, conducting a large- scale assembly at scale remains a challenging problem because of the inherent complexities associated with data movement, and irregular access footprints of memory and I/O operations. In this paper, we present a novel algorithm, called PaKman, to address the problem of performing large-scale genome assemblies on a distributed memory parallel computer. Our approach focuses on improving performance through a combination of novel data structures and algorithmic strategies for reducing the communication and I/O footprint during the assembly process. A key aspect of our algorithm is its graph data structure, which comprises fat nodes (or what we call "macro-nodes") that reduce the communication burden during contig generation. We present an extensive performance and qualitative evaluation of our algorithm, including comparisons to other state-of-the-art parallel assemblers. Our results demonstrate the ability to achieve near-linear speedups on up to 8K cores (tested); outperform state-of-the-art distributed memory and shared memory tools in performance while delivering comparable (if not better) quality; and reduce time to solution significantly. For instance, PaKman is able to complete an assembly of the full human genome in just over a minute on 8K cores.

Ghosh, Priyanka↗

On the memory attribution problem: A solution and case study using MPI

As parallel applications running on large–scale computing systems become increasingly memory constrained, the ability to attribute memory usage to the various components of the application is becoming increasingly important. We present the design and implementation of memnesia, a novel memory usage profiler for parallel and distributed message–passing applications. Our approach captures both application– and message–passing library–specific memory usage statistics from unmodified binaries dynamically linked to a message–passing communication library. Using microbenchmarks and proxy applications, we evaluated our profiler across three Message Passing Interface (MPI) implementations and two hardware platforms. Furthermore, the results show that our approach and the corresponding implementation can accurately quantify memory resource usage as a function of time, scale, communication workload, and software or hardware system architecture, clearly distinguishing between application and MPI library memory usage at a per–process level. With this new capability, we show that job size, communication workload, and hardware/software architecture influence peak runtime memory usage. In practice, this tool provides a potentially valuable source of information for application developers seeking to measure and optimize memory usage.

97 MATHEMATICS AND COMPUTING↗

Parallel Hybrid Metaheuristics with Distributed Intensification and Diversification for Large-scale Optimization in Big Data Statistical Analysis

Important insights into many problems that are traditionally analyzed via statistical models can be obtained by re-formulating and evaluating within a large-scale optimization framework. The theoretical underpinnings of the statistical model often shift the goal of the solution space traversal from a traditional search for a single optimal solution to a traversal with the purpose of yielding a set of high quality, independent solutions. We examine statistical frameworks with astronomical solution spaces where the independence requirement constitutes a significant additional challenge for standard optimization methodologies. We design a hybrid metaheuristic with specialized intensification and diversification protocols in the base search algorithm. We extend our algorithm to the high-performance-computing realm using the Stampede2 supercomputer. We experimentally demonstrate the effectiveness of our algorithm to utilize multiple processors to collaboratively hill climb, broadcast messages to one another regarding landscape characteristics, diversify across the solution landscape, and request aid in climbing particularly difficult peaks.

Cho, Wendy K. Tam↗

Active workflow system for near real-time extreme-scale science. In: PPAA '14 Proceedings of the first workshop on Parallel programming for analytics applications

In recent years, streaming-based data processing has been gaining substantial traction for dealing with overwhelming data generated by real-time applications, from both enterprise sources and scientific computing. In this work, however, we look at an emerging class of scientific data with Near Real-Time (NRT) requirement, in which data is typically generated in a bursty fashion with the near real-time constraints being applied primarily between bursts, rather than within a stream. A key challenge for this types of data sources is that the processing time per data element is not uniform, and not always feasible to predict. Given the observations on the increasing unpredictability of compute load and system dynamics, this work looks to adapt streaming-based approach to the context of this new class of large experiments and simulations that have complex run-time control and analysis issues. In particular, we deploy a novel two-tier scheme for handling the increasing unpredictability of runtime behaviors: Instead of relying on determining what and where to run the scientific workflows beforehand or partial dynamically, the decision will also be adaptively enhanced online according to system runtime status. This is enabled by embedding workflow along with data streams. Specifically, we break data outputs generated from experiments or simulations into multiple self-describing "chunks", which we call active data objects. As such, if there is a transient hotspot observed, a data object with unfinished workflow pipeline can break its previous schedule and search for a least loaded location to continue the execution. Our preliminary experiment results based on synthetic workloads demonstrate the proposed active workflow system as a very promising solution by outperforming the state-of-the-art semi-dynamic workflow schedulers with an improved workflow completion time, as well as a good scalability.

Zhang, Yanwei↗