Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “latency”

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 181 records · Page 10

Accelerating Parallel Applications in Cloud Platforms via Adaptive Time-Slice Control

Cloud platforms can provide flexible and cost-effective environments for parallel applications. However, the resource over-commitment issues, i.e., cloud providers often provide much more executable virtual CPUs than available physical CPUs, still impede the synchronization operations of parallel applications, causing severe performance degradation. Existing methods optimize parallel applications by promoting the priorities of involved VMs. They cannot fully explore the performance of parallel applications, because they ignore the time-slice requirements of different phases of parallel applications. Furthermore, non-parallel applications experience unsatisfied performance because of low scheduling priorities. Given empirical analysis on time-slices of virtual machines (VMs), we find that shortening time-slices can mitigate synchronization overhead which incurs during communication phases, while over-short time-slices cause frequent cache misses in computation phases. Accordingly, we propose an Adaptive Time-slice Control (ATC) mechanism. ATC first detects the phases of parallel applications based on lock latency or cache misses. Then, ATC shortens time-slices during communication phases and prolongs time-slices during computation phases for parallel applications, and sets a uniform time-slice for non-parallel applications. Finally, we evaluate ATC using seven well-known benchmarks with 25+ applications. Experiments show that ATC obtains 1.5-75x performance gain for running parallel applications than state-of-the-art solutions, with nearly unaffected impact on non-parallel applications.

97 MATHEMATICS AND COMPUTING↗

EdgeAI: Machine learning via direct attached accelerator for streaming data processing at high shot rate x-ray free-electron lasers

We present a case for low batch-size inference with the potential for adaptive training of a lean encoder model. We do so in the context of a paradigmatic example of machine learning as applied in data acquisition at high data velocity scientific user facilities such as the Linac Coherent Light Source-II x-ray Free-Electron Laser. We discuss how a low-latency inference model operating at the data acquisition edge can capitalize on the naturally stochastic nature of such sources. We simulate the method of attosecond angular streaking to produce representative results whereby simulated input data reproduce high-resolution ground truth probability distributions. By minimizing the mean-squared error between the decoded output of the latent representation and the ground truth distributions, we ensure that the encoding layers and resulting latent representation maintains full fidelity for any downstream task, be it classification or regression. We present throughput results for data-parallel inference of various batch sizes, some with throughput exceeding 100 k images per second. We also show in situ training below 10 s per epoch for the full encoder–decoder model as would be relevant for streaming and adaptive real-time data production at our nation’s scientific light sources.

97 MATHEMATICS AND COMPUTING↗

Biophysical Screens Identify Fragments That Bind to the Viral DNA-Binding Proteins EBNA1 and LANA

The human gamma-herpesviruses Epstein–Barr virus (EBV) (HHV-4) and Kaposi’s sarcoma-associated herpesvirus (KSHV) (HHV-8) are responsible for a number of diseases, including various types of cancer. Epstein–Barr nuclear antigen 1 (EBNA1) from EBV and latency-associated nuclear antigen (LANA) from KSHV are viral-encoded DNA-binding proteins that are essential for the replication and maintenance of their respective viral genomes during latent, oncogenic infection. As such, EBNA1 and LANA are attractive targets for the development of small-molecule inhibitors. To this end, we performed a biophysical screen of EBNA1 and LANA using a fragment library by saturation transfer difference (STD)–NMR spectroscopy and surface plasmon resonance (SPR). We identified and validated a number of unique fragment hits that bind to EBNA1 or LANA. We also determined the high-resolution crystal structure of one fragment bound to EBNA1. Results from this screening cascade provide new chemical starting points for the further development of potent inhibitors for this class of viral proteins.

59 BASIC BIOLOGICAL SCIENCES↗

Wireless Pulse-Width Modulation Control of Power Converters Using Ultra-Wideband Technology for Distributed High-Voltage Systems: Preprint

In this study, we present a new approach for wireless pulse-width modulation (PWM) control of a power converter, applicable to numerous power converters within a complex electrical distribution system. This method eliminates the need for multiple physical connections of gating/PWM signals among distributed converter modules. By using ultra-wideband-based communication, the PWM control signals can be wirelessly transmitted from a central controller to multiple converters simultaneously and seamlessly. System stability is thoroughly analyzed, and experimental results validate the efficacy of the wireless control scheme for a buck converter operating at a 50-kHz switching frequency. The minimum latency obtained from this setup is 5.38 mus. This control concept offers easier implementation of distributed control in high-voltage power systems, especially in multilevel architectures, even under harsh conditions with ambient noise.

ADVANCED PROPULSION SYSTEMS↗

Exploring Functional Materials by Understanding Beam‐Sample Interactions

Abstract Ultra‐low‐dose electron diffraction is performed with a double metal cyanide catalyst (DMC) to understand how electron irradiation stimulates structural alterations in functional materials. The commonly fading diffraction patterns with dose accumulation depend on the irradiated area and the beam current even when below 50 femto Amperes. Heat generation is observed and modeled by statistical, inelastic scattering events to describe how phonon excitations modulate radiation hardness. Specifically, the characteristic 1/e‐decay of Bragg intensities from DMC is delayed from 6 to 30 eÅ −2 at room temperature, which is comparable to the effect of embedding radiation soft matter in ice. DMC's radiation hardness is enhanced by a latency dose that forms during a phase transformation. This unifying model predicts that a critical dose rate exists for any material that varies between 0.1 and 10 4 eÅ −2 s −1 because of a material dependent competition of heat generation and spread. It shows that Brillouin scattering causes time dependent perturbations in electron irradiated solids that trigger time‐temperature‐transformations on a time scale of nanoseconds to microseconds at room temperature, which is not included in traditional models describing the decay of Bragg intensities by radiolysis.

Kisielowski, Christian↗

Synergistic Enzyme Mixtures to Realize Near-Complete Depolymerization in Biodegradable Polymer/Additive Blends

Embedding catalysts inside of plastics affords accelerated chemical modification with programmable latency and pathways. Nanoscopically embedded enzymes can lead to near-complete degradation of polyesters via chain-end mediated processive depolymerization. The overall degradation rate and pathways have a strong dependence on the morphology of semicrystalline polyesters. Yet, most studies to date focus on pristine polymers instead of mixtures that contain additives and other components despite their nearly universal use in plastic production. Here, for this study, additives are introduced to purposely change the morphology of polycaprolactone (PCL) by increasing the bending and twisting of crystalline lamellae. These morphological changes immobilize chain ends preferentially at the crystalline/amorphous interfaces and limit chain-end accessibility by the embedded processive enzyme. This chain-end redistribution reduces the polymer-to-monomer conversion from >95% to less than 50%, causing formation of highly crystalline plastic pieces, including microplastics. By synergizing both random chain scission and processive depolymerization, it is feasible to navigate morphological changes in polymer/additive blends and to achieve near-complete depolymerization. The random scission enzymes in the amorphous domains create new chain ends that are subsequently bound and depolymerized by processive enzymes. Present studies further highlight the importance to consider how the host polymer's morphologies affect the reactions catalyzed by embedded catalytic species.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Conductive Ink with Circular Life Cycle for Printed Electronics

Electronic waste carries energetic costs and an environmental burden rivaling that of plastic waste due to the rarity and toxicity of the heavy-metal components. Recyclable conductive composites are introduced for printed circuits formulated with polycaprolactone (PCL), conductive fillers, and enzyme/protectant nanoclusters. Circuits can be printed with flexibility (breaking strain ≈80%) and conductivity (≈2.1 × 10 4 S m -1 ). These composites are degraded at the end of life by immersion in warm water with programmable latency. Approximately 94% of the functional fillers can be recycled and reused with similar device performance. The printed circuits remain functional and degradable after shelf storage for at least 7 months at room temperature and one month of continuous operation under electrical voltage. Here, the present studies provide composite design toward recyclable and easily disposable printed electronics for applications such as wearable electronics, biosensors, and soft robotics.

36 MATERIALS SCIENCE↗

Electronic Bottleneck Suppression in Next‐Generation Networks with Integrated Photonic Digital‐to‐Analog Converters

Digital‐to‐analog converters (DAC) are indispensable functional units in signal processing instrumentation and wide‐band telecommunication links for both civil and military applications. As photonic systems are capable of high data throughput and low latency, an increasingly found system limitation stems from the required domain crossing such as digital to analog and electronic to optical. A photonic DAC implementation, in contrast, enables a seamless signal conversion with respect to both energy efficiency and short signal delay, often requiring bulky discrete optical components and electric–optic transformation, hence introducing inefficiencies. Herein, a novel coherent parallel photonic DAC concept along with a 4‐bit experimental prototype capable of performing this DAC without optic–electric–optic domain crossing is introduced. This new paradigm guarantees a linear intensity weighting among bits when operating at high sampling rates (50 GHz), featuring an exceptional sampling efficiency (> 100 GS ) and small footprint (≈1 mm 2 ) in an 8‐bit implementation. Importantly, this photonic DAC enables seamless interfaces of next‐generation data processing hardware with high relevance in data centers, task‐specific compute accelerators such as neuromorphic engines, and network edge processing applications.

Meng, Jiawei↗

Evaluation of a scientific data search infrastructure

The ability to search over large scientific datasets has become crucial to next-generation scientific discoveries as data generated from scientific facilities grow dramatically. In previous work, we developed and deployed ScienceSearch, a search infrastructure for scientific data which uses machine learning to automate metadata creation. Our current deployment is deployed atop a container based platform at a HPC center. In this article, we present an evaluation and discuss our experiences with the ScienceSearch infrastructure. Specifically, we present a performance evaluation of ScienceSearch's infrastructure focusing on scalability trends. The obtained results show that ScienceSearch is able to serve up to 130 queries/min with latency under 3 s. We discuss our infrastructure setup and evaluation results to provide our experiences and a perspective on opportunities and challenges of our search infrastructure.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

NCAPH drives breast cancer progression and identifies a gene signature that predicts luminal a tumour recurrence

Luminal A tumours generally have a favourable prognosis but possess the highest 10-year recurrence risk among breast cancers. Additionally, a quarter of the recurrence cases occur within 5 years post-diagnosis. Identifying such patients is crucial as long-term relapsers could benefit from extended hormone therapy, while early relapsers might require more aggressive treatment. We conducted a study to explore non-structural chromosome maintenance condensin I complex subunit H’s (NCAPH) role in luminal A breast cancer pathogenesis, both in vitro and in vivo, aiming to identify an intratumoural gene expression signature, with a focus on elevated NCAPH levels, as a potential marker for unfavourable progression. Our analysis included transgenic mouse models overexpressing NCAPH and a genetically diverse mouse cohort generated by backcrossing. A least absolute shrinkage and selection operator (LASSO) multivariate regression analysis was performed on transcripts associated with elevated intratumoural NCAPH levels. We found that NCAPH contributes to adverse luminal A breast cancer progression. The intratumoural gene expression signature associated with elevated NCAPH levels emerged as a potential risk identifier. Transgenic mice overexpressing NCAPH developed breast tumours with extended latency, and in Mouse Mammary Tumor Virus (MMTV)-NCAPH ErbB2 double-transgenic mice, luminal tumours showed increased aggressiveness. High intratumoural Ncaph levels correlated with worse breast cancer outcome and subpar chemotherapy response. A 10-gene risk score, termed Gene Signature for Luminal A 10 (GSLA10), was derived from the LASSO analysis, correlating with adverse luminal A breast cancer progression. The GSLA10 signature outperformed the Oncotype DX signature in discerning tumours with unfavourable outcomes, previously categorised as luminal A by Prediction Analysis of Microarray 50 (PAM50) across three independent human cohorts. This new signature holds promise for identifying luminal A tumour patients with adverse prognosis, aiding in the development of personalised treatment strategies to significantly improve patient outcomes.

60 APPLIED LIFE SCIENCES↗

Topology property analysis and application of stable time-delay regions for linear multiple time-delay systems

This study examines the relationship between the topology of stable time-delay regions and the stability analysis of an linear multiple time delay system. To analyze the topology of stable time-delay regions, we construct a function with a value equal to zero for the time-delay points on the boundaries of stable time-delay regions. The function is continuous and differentiable in the whole defining field with a global minimum of zero so that we can locate the boundaries by minimizing the value of the function. Based on the topology analysis, we proposed a performance validation approach for controllers that are designed to stabilize the system using feedback signals with time delays. The method based on the topology analysis is simple and reliable so that can deal with a linear time-invariant system with high order and multiple time delays (more than 3). The example case study shows that the above method is reliable and enables ultra-low latency coordination and control for the future power grid with ubiquitous power electronics.

24 POWER TRANSMISSION AND DISTRIBUTION↗

HSV ‐1 ICP0 dimer domain adopts a novel β‐barrel fold

Abstract Infected cell protein 0 (ICP0) is an immediate‐early regulatory protein of herpes simplex virus 1 (HSV‐1) that possesses E3 ubiquitin ligase activity. ICP0 transactivates viral genes, in part, through its C‐terminal dimer domain (residues 555–767). Deletion of this dimer domain results in reduced viral gene expression, lytic infection, and reactivation from latency. Since ICP0's dimer domain is associated with its transactivation activity and efficient viral replication, we wanted to determine the structure of this specific domain. The C‐terminus of ICP0 was purified from bacteria and analyzed by X‐ray crystallography to solve its structure. Each subunit or monomer in the ICP0 dimer is composed of nine β‐strands and two α‐helices. Interestingly, two adjacent β‐strands from one monomer “reach” into the adjacent subunit during dimer formation, generating two β‐barrel‐like structures. Additionally, crystallographic analyses indicate a tetramer structure is formed from two β‐strands of each dimer, creating a “stacking” of the β‐barrels. The structural protein database searches indicate the fold or structure adopted by the ICP0 dimer is novel. The dimer is held together by an extensive network of hydrogen bonds. Computational analyses reveal that ICP0 can either form a dimer or bind to SUMO1 via its C‐terminal SUMO‐interacting motifs but not both. Understanding the structure of the dimer domain will provide insights into the activities of ICP0 and, ultimately, the HSV‐1 life cycle.

Biochemistry & Molecular Biology↗

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↗

Adrastea: An Efficient FPGA Design Environment for Heterogeneous Scientific Computing and Machine Learning

We present Adrastea, an efficient FPGA design environment for developing scientific machine learning applications. FPGA development is challenging, from deployment, proper toolchain setup, programming methods, interfacing FPGA kernels, and more importantly, the need to explore design space choices to get the best performance and area usage from the FPGA kernel design. Adrastea provides an automated and scalable design flow to parameterize, implement, and optimize complex FPGA kernels and associated interfaces. We show how virtualization of the development environment via virtual machines is leveraged to simplify the setup of the FPGA toolchain while deploying the FPGA boards and while scaling up the automated design space exploration to leverage multiple machines concurrently. Adrastea provides an automated build and test environment of FPGA kernels. By exposing design space hyper-parameters, Adrastea can automatically search the design space in parallel to optimize the FPGA design for a given metric, usually performance or area. Adrastea simplifies the task of interfacing with the FPGA kernels with a simplified interface API. To demonstrate the capabilities of Adrastea, we implement a complex random forest machine learning kernel with 10,000 input features while achieving extremely low computing latency without loss of prediction accuracy, which is required by a scientific edge application at SNS. We also demonstrate Adrastea using an FFT kernel and show that for both applications Adrastea is able to systematically and efficiently evaluate different design options, which reduced the time and effort required to develop the kernel from months of manual work to days of automatic builds.

Young, Aaron↗

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↗

ProZES: the methodology and software tool for assessment of assigned share of radiation in probability of cancer occurrence

ProZES is a software tool for estimating the probability that a given cancer was caused by preceding exposure to ionising radiation. ProZES calculates this probability, the assigned share, for solid cancers and hematopoietic malignant diseases, in cases of exposures to low-LET radiation, and for lung cancer in cases of exposure to radon. User-specified inputs include birth year, sex, type of diagnosed cancer, age at diagnosis, radiation exposure history and characteristics, and smoking behaviour for lung cancer. Cancer risk models are an essential part of ProZES. Linking disease and exposure to radiation involves several methodological aspects, and assessment of uncertainties received particular attention. ProZES systematically uses the principle of multi-model inference. Models of radiation risk were either newly developed or critically re-evaluated for ProZES, including dedicated models for frequent types of cancer and, for less common diseases, models for groups of functionally similar cancer sites. The low-LET models originate mostly from the study of atomic bomb survivors in Hiroshima and Nagasaki. Risks predicted by these models are adjusted to be applicable to the population of Germany and to different time periods. Adjustment factors for low dose rates and for a reduced risk during the minimum latency time between exposure and cancer are also applied. The development of the methodology and software was initiated and supported by the German Federal Ministry for the Environment, Nature Conservation and Nuclear Safety (BMU) taking up advice by the German Commission on Radiological Protection (SSK, Strahlenschutzkommission). These provide the scientific basis to support decision making on compensation claims regarding malignancies following occupational exposure to radiation in Germany.

97 MATHEMATICS AND COMPUTING↗

Toward memory-efficient melt pool monitoring: a classification framework using event-based imaging and sparse sensing technique

Vision sensors like CMOS and CCD cameras are often used for in-process monitoring of melt pools in laser-based additive and welding processes, but they require transferring large amounts of data and computational processing resources. Event-based neuromorphic imagery, on the other hand, detects only the change in pixel intensity, thus potentially reducing the data amount and latency. With an event imager, this study develops a framework for melt pool condition classification, including image construction, time scale selection, optimal pixel selection, and sparse classification, to achieve a highly memory-efficient scheme. These are based on sparse sensing techniques with singular value decomposition (SVD) and QR pivoting, the two fundamental matrix transformations for linear dimensionality reduction. The framework is then validated by classifying a controlled experiment by exciting various mode shapes of liquid gallium pools of varying depths (3, 6, and 8 mm). At 200 pixels, the classifier can reach overall accuracy of 75%, while at 2000 pixels (0.013% of the total possible pixels), the accuracy is nearly 90% (89.86%). At the same number of pixels, random selection can only achieve 46% and 67%, respectively. The memory savings of the sparsely sampled event data compared to a conventional imager is about 500 times. In addition to performance, implementation and limitations of the framework are also discussed.

42 ENGINEERING↗

Charged Particle Tracking via Edge-Classifying Interaction Networks

Recent work has demonstrated that geometric deep learning methods such as graph neural networks (GNNs) are well suited to address a variety of reconstruction problems in high-energy particle physics. In particular, particle tracking data are naturally represented as a graph by identifying silicon tracker hits as nodes and particle trajectories as edges, given a set of hypothesized edges, edge-classifying GNNs identify those corresponding to real particle trajectories. In this work, we adapt the physics-motivated interaction network (IN) GNN toward the problem of particle tracking in pileup conditions similar to those expected at the high-luminosity Large Hadron Collider. Assuming idealized hit filtering at various particle momenta thresholds, we demonstrate the IN’s excellent edge-classification accuracy and tracking efficiency through a suite of measurements at each stage of GNN-based tracking: graph construction, edge classification, and track building. The proposed IN architecture is substantially smaller than previously studied GNN tracking architectures; this is particularly promising as a reduction in size is critical for enabling GNN-based tracking in constrained computing environments. Furthermore, the IN may be represented as either a set of explicit matrix operations or a message passing GNN. Efforts are underway to accelerate each representation via heterogeneous computing resources towards both high-level and low-latency triggering applications.

accelerator physics↗