Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Bandwidth”

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,063 records · Page 59

Liquid metasurface‐based periodically stacked radome design

Abstract We present liquid metasurface‐based periodically stacked radome design. Radome is a layer placed above the antenna to protect it from weather disturbances. The layer protects the antenna but reduces its gain. Periodic stacking of liquid metasurface based radome improve the antenna parameters like gain and bandwidth. Microstrip patch antenna is used as basic antenna to check the improvement in gain. The comparison of microstrip patch antenna, patch antenna with simple multilayer radome, patch antenna with liquid metasurface multilayer radome and patch antenna with liquid metasurface periodically stacked multilayer radome is presented in the manuscript. The improvement in terms of gain is clearly visible from the comparison of results for all the designs. Efficiency is also increasing by adding liquid metasurface periodically stacked multilayer radome to patch antenna.

Patel, Shobhit K.↗

A low-communication, parallel algorithm for solving PDEs based on range decomposition

This work proposes a new, low-communication algorithm for solving PDEs on massively parallel computers. The range decomposition (RD) algorithm exposes coarse-grain parallelism by applying nested iteration and adaptive mesh refinement locally before performing a global communication step. Just a few such steps are observed to be sufficient to obtain accuracy within a small multiple of discretization error. The target applications are petascale and exascale machines, where hierarchical parallelism is required and traditional parallel numerical PDE communication patterns are costly because of message latency. The RD algorithm uses a partition of unity to equally distribute the error, and thus, the work. The computational advantages of this approach are that the decomposed problems can be solved in parallel without any communication until the partitioned solutions are summed. This offers potential advantages in the paradigm of expensive communication but very cheap computation. This paper introduces the method and explains the details of the communication step. Two performance models are developed, showing that the latency cost associated with a traditional parallel implementation of nested iteration is proportional to log(P) 2 , whereas the RD method reduces the communication latency to log(P), while maintaining similar bandwidth costs. Numerical results for two problems, Laplace and advection diffusion, demonstrate the enhanced performance, and a heuristic argument explains why the method converges quickly.

97 MATHEMATICS AND COMPUTING↗

The High-Pressure Characterization of Energetic Materials: 1-Methyl-5-

Pressure-volume relations and optical Raman and Infrared spectra of polycrystalline 1MNT have been obtained under quasi-hydrostatic conditions up to 16 and 40 GPa, respectively, by using diamond anvil cell, synchrotron-based angle-resolved X-ray diffraction, and microspectroscopy. The X-ray measurements show that the pressure-volume relations remain smooth up to 16 GPa at room temperature, while vibrational measurements show no evidence of a phase transition to near 40 GPa. Anomalous increases of several vibrational intensities and bandwidths suggest that subtle molecular distortions and structural modifications occur in the crystal as pressure increases. Decompression experiments indicate the structural modifications are reversible.

36 MATERIALS SCIENCE↗

In Situ MOF Pyrolysis Construction of Hierarchical Porous Co‐Nanoparticles/Carbon Cloth Composites for Enhanced Electromagnetic Wave Shielding and Absorption

The development of high-performance electromagnetic protection materials integrating broadband absorption and effective shielding capabilities is hindered by challenges in simultaneously optimizing multiple electromagnetic properties through conventional material designs. This study pioneers a hierarchical porous Co nanoparticle/carbon cloth (Co/CC) composite via controlled annealing of a Co-MOF precursor on carbon cloth. The Co-MOF served a dual role as both magnetic source and pore-forming agent, enabling in situ generation of uniformly dispersed Co nanoparticles and creation of abundant pores/interfaces on the CC fibers during pyrolysis. This unique architecture synergistically enhanced dielectric loss (via interfacial/dipolar polarization) and magnetic loss (via natural resonance, exchange interactions, and eddy currents), significantly improving impedance matching. The hierarchical pores further functioned as integrated “absorption–reflection” units for efficient electromagnetic energy attenuation. Consequently, the Co/CC composite annealed at 800°C (Co/CC-800) achieves minimum reflection loss (−40.69 dB) and 120% effective absorption bandwidth extension (6.16 GHz) as a filler, and exhibits superior electromagnetic interference shielding effectiveness (46.66 dB) as an integrated component. Significantly, Co/CC-800 demonstrated robust photothermal and electrothermal conversion capabilities, ensuring operational stability in ice-covered and humid harsh environments. This work pioneers a pore-structure-mediated strategy to harmonize dielectric–magnetic synergy, providing a new paradigm for designing advanced multifunctional electromagnetic protection materials.

dielectric‐magnetic synergy↗

Filtering adaptive output feedback control for multivariable nonlinear systems with mismatched uncertainties and unmodeled dynamics

This article synthesizes a filtering adaptive output feedback controller for multivariable nonlinear systems with mismatched uncertainties and unmodeled dynamics. The multivariable nonlinear systems under consideration have both matched and mismatched uncertainties, which satisfy the semiglobal Lipschitz condition. The unmodeled dynamics are bounded-input bounded-output stable. By adopting an estimation/cancellation strategy, a piecewise constant adaptive law drives the estimation error to zero at every time instant, which yields the adaptive parameters; a disturbance rejection control law is designed to compensate the nonlinear uncertainties within the bandwidth of low-pass filters. The matched uncertainties are cancelled directly by adopting their opposite in the control signal, while a dynamic inversion of the system is required to eliminate the effect of the mismatched uncertainties on the output. A feedforward control law is designed to track a given command. Since the virtual reference system defines the best performance that can be achieved by the closed-loop system, the uniform performance bounds are derived for the states and control signals via comparison. Both numerical and practical examples are provided to illustrate the effectiveness of the proposed filtering adaptive output feedback control architecture, comparisons with the model reference adaptive control demonstrates the superiority of the proposed control method.

filtering adaptive control, mismatched uncertainit↗

Moderate Velocity Ball Impact of a Mock High-Explosive

Modeling of thermal and mechanical events in high-explosive materials is complicated by the composite nature of the material, which experiences viscoelastic and plastic deformations and sustains damage in the form of microcracks that can dominate its overall behavior. A mechanical event of interest is projectile interaction with the material, which leads to extreme local deformation and adiabatic heating, which can potentially lead to adverse outcomes in an energetic material. Simulations of such an event predicted large local temperature rises near the path of a spherical projectile, but these were experimentally unconfirmed and hence potentially non-physical. This work concerns the experimental verification of local temperatures both at the surface and in the wake of a spherical projectile penetrating a mock (unreactive) high-explosive at {approx}700 m/s. Fast response thermocouples were embedded radially in a mid-plane of a cylindrical target, which was bonded around the thermocouples with epoxy and recorded by an oscilloscope through a low-pass filter with a bandwidth of 500 Hz. A peak temperature rise of 70 K was measured both at the equator of the projectile and in its wake, in good agreement with the temperature predicted in the minimally distorted elements at those locations by a finite element model in ABAQUS employing the ViscoSCRAM constitutive model. Further work is needed to elucidate the extreme temperature rises in material undergoing crushing or fragmentation, which is difficult to predict with meshed finite element methods due to element distortion, and also challenging to quantify experimentally.

36 MATERIALS SCIENCE↗

Porting DMRG++ Scientific Application to OpenPOWER

With the rapidly changing microprocessor designs and architectural diversity (multi-cores, many-cores, accelerators) for the next generation HPC systems, scientific applications must adapt to the hardware, to exploit the different types of parallelism and resources available in the architecture. To get the benefit of all the in-node hardware threads, it is important to use a single programming model to map and coordinate the available work to the different heterogeneous execution units in the node (e.g., multi-core hardware threads (latency optimized), accelerators (bandwidth optimized), etc.).Our goal is to show that we can manage the node complexity of these systems by using OpenMP for in-node parallelization by exploiting different “programming styles” supported by OpenMP 4.5 to program CPU cores and accelerators. Finding out the suitable programming-style (e.g., SPMD style, multi-level tasks, accelerator programming, nested parallelism, or a combination of these) using the latest features of OpenMP to maximize performance and achieve performance portability across heterogeneous and homogeneous systems is still an open research problem.We developed a mini-application, Kronecker Product (KP), from the original DMRG++ application (sparse matrix algebra) computational motif to experiment with different OpenMP programming styles on an OpenPOWER architecture and present their results in this paper.

Chatterjee, Ronnie↗

Evaluating LULESH Kernels on OpenCL FPGA

FPGAs are becoming promising heterogeneous computing components for high-performance computing. In this paper, we evaluate the resource utilizations, performance, and performance per watt of our implementations of the LULESH kernels in OpenCL on an Arria10-based FPGA platform. LULESH is a complex proxy application in the CORAL benchmark suite. We choose two representative kernels “CalcFBHourglassForceForElems” and “EvalEOSForElems” from the application in our study. Compared with the baseline implementations, our optimizations improve the performance by a factor of 1.65X and 2.96X for the two kernels on the FPGA, respectively. Using directives for accelerator programming, we also evaluate the performance of the kernels on an Intel Xeon 16-core CPU and an Nvidia K80 GPU. We find that the FPGA, constrained by the memory bandwidth, can perform 1.05X to 3.4X better than the CPU and GPU for small problem sizes. For the first kernel, the performance per watt on the FPGA is 1.59X and 7.1X higher than that on an Intel Xeon 16-core CPU and an Nvidia K80 GPU, respectively. For the second kernel, the performance per watt on the GPU is 1.82X higher than that on the FPGA. However, the performance per watt on the FPGA is 1.77X higher than that on the CPU.

FPGA↗

A Quantitative Approach to Architecting All-Flash Lustre File Systems

New experimental and AI-driven workloads are moving into the realm of extreme-scale HPC systems at the same time that high-performance flash is becoming cost-effective to deploy at scale. This confluence poses a number of new technical and economic challenges and opportunities in designing the next generation of HPC storage and I/O subsystems to achieve the right balance of bandwidth, latency, endurance, and cost. In this work, we present quantitative models that use workload data from existing, disk-based file systems to project the architectural requirements of all-flash Lustre file systems. Using data from NERSC’s Cori I/O subsystem, we then demonstrate the minimum required capacity for data, capacity for metadata and data-on-MDT, and SSD endurance for a future all-flash Lustre file system.

Lockwood, GK↗

High Resolution Data Analysis: Plans and Prospects [Book Chapter]

Herein, a report on the progress on the high resolution data analysis of the ADMX experimental results is presented. In this paper, tools are developed and tested on a blind injection mimicking a Maxwellian like signal in the frequency domain. This blind injection will be used as a test bed which can be later implemented on all the high resolution data. The high resolution data is stored in the Fermilab server. In this analysis a PostgreSQL query was made to ensure the blind injection is in the middle of the frequency spectrum and 19 such files were found. The time series data is read using a c++ program. An apodization function is applied on the time series data and zero filled to reduce the frequency spacing in order to achieve a better interpolation. A FFTW header is used to compute the Fourier transform of the time series data. A Savitzky–Golay filter is applied on the unnormalized power which then can be used to remove the spectral shape. Each frequency spectrum has a bandwidth of 50 kHz.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Cross Inference of Throughput Profiles Using Micro Kernel Network Method

Dedicated network connections are being increasingly deployed in cloud, centralized and edge computing and data infrastructures, whose throughput profiles are critical indicators of the underlying data transfer performance. Due to the cost and disruptions to physical infrastructures, network emulators, such as Mininet, are often used to generate measurements needed to estimate throughput profiles, typically expressed as a function of the connection round trip time. The profiles estimated using measurements from such emulated networks are usually inaccurate for high bandwidth and high latency connections, since they do not accurately reflect the critical network transport dynamics mainly due to computing and memory constraints of the host. We present a machine learning (ML) method to estimate the throughput profiles using emulation measurements to closely match the testbed and production network profiles. In particular, we propose a micro Kernel Network (mKN) that provides baseline throughput measurements on the host running Mininet emulations, which are used to learn a regression map that converts them to the corresponding testbed measurement estimates. Once initially learned, this map is applied to measurements from subsequent network emulations on the same host. We present experimental measurements to illustrate this approach, and derive generalization equations for the proposed mKN-ML method. Using a four-site scenario emulation, we show the effectiveness of this method in providing accurate concave throughput profiles from inaccurate convex or non-smooth ones indicated by Mininet emulation.

Rao, Nageswara↗

Extending OpenSHMEM with Aggregation Support for Improved Message Rate Performance

OpenSHMEM is a highly efficient one-sided communication API that implements the PGAS parallel programming model, and is known for its low latency communication operations that can be mapped efficiently to RDMA capabilities of network interconnects. However, applications that use OpenSHMEM can be sensitive to point-to-point message rates, as many-to-many communication patterns can generate large amounts of small messages which tend to overwhelm network hardware that has predominantly been optimised for bandwidth over message rate. Additionally, many important emerging classes of problems such as data analytics are similarly troublesome for the irregular access patterns they employ. Message aggregation strategies have been proven to significantly enhance network performance, but their implementation often involves complex restructuring of user code, making them unwieldy. This paper shows how to combine the best qualities of message aggregation within the communication model of OpenSHMEM such that applications with small and irregular access patterns can improve network performance while maintaining their algorithmic simplicity. We do this by providing a path to a message aggregation framework called conveyors through a minimally intrusive OpenSHMEM extension introducing aggregation contexts that fit more naturally to the OpenSHMEM atomics, gets, and puts model. We test these extensions using four of the bale 3.0 applications which contain essential many-to-many access patterns to show how they can produce performance improvements of up to 65×.

Welch, Aaron↗

Now Broadcasting in Planck Definition

If reality has finite information content, space has finite fidelity. The quantum wave function that encodes spatial relationships may be limited to information that can be transmitted in a "Planck broadcast", with a bandwidth given by the inverse of the Planck time, about $2\times 10^{43}$ bits per second. Such a quantum system can resemble classical space-time on large scales, but locality emerges only gradually and imperfectly. Massive bodies are never perfectly at rest, but very slightly and slowly fluctuate in transverse position, with a spectrum of variation given by the Planck time. This distinctive new kind of noise associated with quantum geometry would not have been noticed up to now, but may be detectable in a new kind of experiment.

Hogan, Craig↗

Data Movement in Data-Intensive High Performance Computing.

The cost of executing a floating point operation has been decreasing for decades at a much higher rate than that of moving data. Bandwidth and latency, two key metrics that determine the cost of moving data, have degraded significantly relative to processor cycle time and execution rate. Despite the limitation of sub-micron processor technology and the end of Dennard scaling, this trend will continue in the short-term making data movement a performance-limiting factor and an energy/power efficiency concern. Even more so in the context of large-scale and data-intensive systems and workloads. This chapter gives an overview of the aspects of moving data across a system, from the storage system to the computing system down to the node and processor level, with case study and contributions from researchers at the San Diego Supercomputer Center, the Oak Ridge National Laboratory, the Pacific Northwest National Laboratory, and the University of Delaware.

Data Movement↗

Optimizing Excited-State Electronic-Structure Codes for Intel Knights Landing: A Case Study on the BerkeleyGW Software

We profile and optimize calculations performed with the BerkeleyGW code on the Xeon-Phi architecture. BerkeleyGW depends both on hand-tuned critical kernels as well as on BLAS and FFT libraries. We describe the optimization process and performance improvements achieved. We discuss a layered parallelization strategy to take advantage of vector, thread and node-level parallelism. We discuss locality changes (including the consequence of the lack of L3 cache) and effective use of the on-package high-bandwidth memory. We show preliminary results on Knights-Landing including a roofline study of code performance before and after a number of optimizations. We find that the GW method is particularly well-suited for many-core architectures due to the ability to exploit a large amount of parallelism over plane-wave components, band-pairs, and frequencies.

97 MATHEMATICS AND COMPUTING↗

SharP Unified Memory Allocator: An Intent-Based Memory Allocator for Extreme-Scale Systems

The pre-exascale systems will soon be deployed with a deep, complex memory hierarchy composed of many heterogeneous memories. This presents multiple challenges for users including: how to allocate data objects with locality between memories and devices for the various memories in these systems, which includes DRAM, High-bandwidth Memory (HBM), and non-volatile random access memory (NVRAM), and how to perform these allocations while providing portability for their application. Currently, the user can make use of multiple, disjoint libraries to allocate data objects on these memories. However, it is difficult to obtain locality between memories and devices when using libraries that are unaware of each other. This paper presents the Unified Memory Allocator (UMA) of the SHARed data-structure centric Programming abstraction (SharP) library, which provides a unified interface for memory allocations across DRAM, HBM, and NVRAM and is extensible to support future memory types. In addition, the SharP UMA allows for portability between systems by supporting both explicit and implicit, intent-based memory allocations. To demonstrate the ease of use of the SharP UMA, we have extended both Open MPIand OpenSHMEM-Xto support SharP. We validate this work by evaluating the performance implications and intent-based approach with synthetic benchmarks as well as adaptations of the Graph500 benchmark.

Aderholdt, William↗