Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “compiler optimization”

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 307 records · Page 17

Promising approaches for the assembly of the catalytically active, recombinant Desulfomicrobium baculatum hydrogenase with substitutions at the active site

Background: Hydrogenases (H2ases) are metalloenzymes capable of the reversible conversion of protons and electrons to molecular hydrogen. Exploiting the unique enzymatic activity of H2ases can lead to advancements in the process of biohydrogen evolution and green energy production. Results: Here we created of a functional, optimized operon for rapid and robust production of recombinant [NiFe] Desulfomicrobium baculatum hydrogenase (Dmb H2ase). The conversion of the [NiFeSe] Dmb H2ase to [NiFe] type was performed on genetic level by site-directed mutagenesis. The native dmb operon includes two structural H2ase genes, coding for large and small subunits, and an additional gene, encoding a specific maturase (protease) that is essential for the proper maturation of the enzyme. Dmb, like all H2ases, needs intricate bio-production machinery to incorporate its crucial inorganic ligands and cofactors. Strictly anaerobic, sulfate reducer D. baculatum bacteria are distinct, in terms of their biology, from E. coli. Thus, we introduced a series of alterations within the native dmb genes. As a result, more than 100 elements, further compiled into 32 operon variants, were constructed. The initial requirement for a specific maturase was omitted by the artificial truncation of the large Dmb subunit. The assembly of the produced H2ase subunit variants was investigated both, in vitro and in vivo. This approach resulted in 4 recombinant [NiFe] Dmb enzyme variants, capable of H 2 evolution. The aim of this study was to overcome the gene expression, protein biosynthesis, maturation and ligand loading bottlenecks for the easy, fast, and cost-effective delivery of recombinant [NiFe] H2ase, using a commonly available E. coli strains. Conclusion: The optimized genetic constructs together with the developed growth and purification procedures appear to be a promising platform for further studies toward fully-active and O 2 tolerant, recombinant [NiFeSe] Dmb H2ase, resembling the native Dmb enzyme. It could likely be achieved by selective cysteine to selenocysteine substitution within the active site of the [NiFe] Dmb variant.

59 BASIC BIOLOGICAL SCIENCES↗

Efficient Trainability of Linear Optical Modules in Quantum Optical Neural Networks

The existence of “barren plateau landscapes” for generic discrete-variable quantum neural networks, which obstructs efficient gradient-based optimization of cost functions defined by global measurements, would be surprising in the case of generic linear optical modules in quantum optical neural networks due to the tunability of the intensity of continuous variable states and the relevant unitary group having exponentially smaller dimension. We demonstrate that coherent light in m modes can be generically compiled efficiently if the total intensity scales sublinearly with m, and extend this result to cost functions based on homodyne, heterodyne, or photon detection measurement statistics, and to noisy cost functions in the presence of attenuation. Here, we further demonstrate efficient trainability of m mode linear optical quantum circuits for variational mean field energy estimation of positive quadratic Hamiltonians for input states that do not have energy exponentially vanishing with m.

47 OTHER INSTRUMENTATION↗

Adaptive job and resource management for the growing quantum cloud

As the popularity of quantum computing continues to grow, efficient quantum machine access over the cloud is critical to both academic and industry researchers across the globe. And as cloud quantum computing demands increase exponentially, the analysis of resource consumption and execution characteristics are key to efficient management of jobs and resources at both the vendor-end as well as the client-end. While the analysis and optimization of job / resource consumption and management are popular in the classical HPC domain, it is severely lacking for more nascent technology like quantum computing.This paper proposes optimized adaptive job scheduling to the quantum cloud taking note of primary characteristics such as queuing times and fidelity trends across machines, as well as other characteristics such as quality of service guarantees and machine calibration constraints. Key components of the proposal include a) a prediction model which predicts fidelity trends across machine based on compiled circuit features such as circuit depth and different forms of errors, as well as b) queuing time prediction for each machine based on execution time estimations. Altogether, this proposal is evaluated on simulated IBM machines across a diverse set of quantum applications and system loading scenarios, and is able to reduce wait times by over 3x and improve fidelity by over 40% on specific usecases, when compared to traditional job schedulers.

97 MATHEMATICS AND COMPUTING↗

High Performance Approximate Computing

This code repository contains the implementation of the "High-Performance Approximate Computing" (HPAC) toolkit. The toolkit allows you to approximate your own C/C++. The developer uses "pragma's" to annotate code regions as approximate. The compiler extensions lower these pragmas to either compiletime approximate techniques or runtime approximation techniques. At execution time, the implemented runtime system decides which annotated regions it should approximate. HPAC also provides a set of script utilities. The utilities perform a grid search within approximation parameters and performance. The user can analyze the raw data to identify optimal approximation techniques for the application.

Parasyris, Konstantinos↗

Conceptual Model Update of Mercury Sources and Flux at Y-12 and Upper East Fork Poplar Creek, Oak Ridge,Tennessee

The interactions between the key processes that control the fate and transport of mercury (Hg) in the sediments, groundwater, and stream water within the Y-12 National Security Complex (Y-12) in Oak Ridge, Tennessee are complex, and many aspects are not well understood. In contaminated environments such as Y-12, conceptual models are frequently developed to aid in visualizing and understanding the dynamic nature of the hydrologic, geochemical, and physical environment. These conceptual models integrate data in an internally consistent manner to understand processes that control the fate and transport of contaminants. Over the past few decades of environmental investigation at Y-12, a number of conceptual models have been developed to identify and define various technical processes at various scales. The main purpose of the activities described in this report is to update the 2011 conceptual model for Upper East Fork Poplar Creek using the most recent Hg concentration and flux data and informed scientific interpretation. Emphasis was placed on improving the previous model by implementing a more detailed spatial and temporal approach to visualize transport pathways in the watershed and trends in flux and concentration over time, and to compare baseflow and stormflow system dynamics. Detailed descriptions of historical and current Hg sources and transport pathways are also provided for the east and west ends of the facility. This conceptual model will allow the US Department of Energy to evaluate past and present remedial activities and provide a strong technical basis for prioritizing and optimizing remedial responses in a cost-effective and efficient manner. Twenty years ago, Hg flux from Outfall (OF) 200 at the headwaters of East Fork Poplar Creek represented approximately 20% of the overall flux leaving Y-12. By the time of the 2011 conceptual model report, that percentage had increased to 70%–80%. Flux estimates compiled for this report using data from 2009 to 2018 show that OF200 accounted for roughly 60% of the flux leaving Y-12. The relative role of the four storm drain conduits to OF200 appeared similar to 2011, with OF163 being the greatest contributor to downstream flux. An increase in Hg concentrations and flux occurred throughout and downstream of west end storm drains in 2011 in response to a storm drain cleanout. Leading up to the 2011 storm drain cleanout, annual baseflow flux was higher at OF200A6 than at Station 17. From 2011 to 2018, the trend reversed with concentrations and flux being higher at Station 17 than at OF200A6. A spike in concentrations occurred in July 2018, potentially due to a one-time influx of Hg that occurred during COLEX decontamination and decommissioning activities at Y-12. This report includes recommendations for improving our conceptual understanding of Hg sources, transport pathways, and flux at Y-12. Important recommendations include further evaluation of transport pathways, concurrent measurement of Hg concentration and flux under baseflow and stormflow conditions at multiple sites, and research to understand the connections among periphyton and methylmercury concentration, bioavailability, and bioaccumulation. Ongoing facility decontamination and decommissioning efforts, site characterization, remedial actions, and research are facilitating the collection of new Hg data at Y-12. The conceptual model update provided herein takes advantage of the extensive recent Hg sampling to provide an updated assessment of Hg mass balance and support a refined understanding of Hg behavior at or near Y-12. This assessment should assist in future environmental management decisions and in mitigating the impacts of Hg on the surrounding environment.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Numerical Simulations of Noisy Variational Quantum Eigensolver Ansatz Circuits

This is a case study of the variational quantum eigensolver (VQE) method using numerical simulations to test the influence of noise on the accuracy of the underlying circuit ansatz. We investigate a computational chemistry application of VQE to calculate the electronic ground state and its energy for Sodium Hydride (NaH), a prototypical two-electron problem. Using a one-parameter ansatz derived from unitary coupled cluster (UCC) theory, we simulate the effects of noise on the energy expectation value and variance with respect to the ansatz parameter. These numerical simulations provide insights into the accuracy of the prepared quantum state and the efficiency of the classical optimizer that iteratively refines the ansatz. We conduct a comparative study between analytical results derived for the UCC ansatz in the absence of noise and the noisy numerical simulation results obtained using an isotropic depolarizing noise model for each gate. We also compare the relative increase in noise on logically equivalent UCC ansatz circuits generated by randomized compiling. Notably, we observe that the intrinsic variance in the energy due to the simplicity of the ansatz itself compares with the noise induced by the bare circuit.

Gowrishankar, Meenambika↗

Using Transparent Informed Prefetching (TIP) to reduce file read latency

As processor performance gains continue to outstrip Input/Output gains, I/O performance is becoming critical to overall system performance. File read latency is the most significant bottleneck for high performance I/O. Other aspects of I/O performance benefit from recent advances in disk bandwidth and throughput resulting from disk arrays, and in write performance derived from buffered write behind and the Log-structured File System. The access gap problem limiting improvements in read latency is exacerbated by distributed file systems operating over networks with diverse bandwidth. Focus is on extending the power of caching and prefetching to reduce file read latencies by exploiting hints from high-levels of a system. Such Transparent Informed Prefetching, TIP, and its benefits are described. It is argued that hints that disclose high level knowledge are a means for transferring optimization information across, without violating, module boundaries. How TIP can be used to convert the high throughput of new technologies such as disk arrays and log-structured file systems into low latency for applications is discussed. Our preliminary experiments show reductions in wall - clock execution time of 13 percent and 20 percent for a multiple module compilation tool (make) accessing data on a local disk and remote Coda file server, respectively, and a reduction of 30 percent for a text search (grep) remotely accessing many small files.

Patterson, R. H.↗

Shape Memory Alloy Actuator Design: CASMART Collaborative Best Practices

Upon examination of shape memory alloy (SMA) actuation designs, there are many considerations and methodologies that are common to them all. A goal of CASMART's design working group is to compile the collective experiences of CASMART's member organizations into a single medium that engineers can then use to make the best decisions regarding SMA system design. In this paper, a review of recent work toward this goal is presented, spanning a wide range of design aspects including evaluation, properties, testing, modeling, alloy selection, fabrication, actuator processing, design optimization, controls, and system integration. We have documented each aspect, based on our collective experiences, so that the design engineer may access the tools and information needed to successfully design and develop SMA systems. Through comparison of several case studies, it is shown that there is not an obvious single, linear route a designer can adopt to navigate the path of concept to product. SMA engineering aspects will have different priorities and emphasis for different applications.

Benafan, Othmane↗

Overview of Code Verification

The verified code for the SIFT Executive is not the code that executes on the SIFT system as delivered. The running versions of the SIFT Executive contain optimizations and special code relating to the messy interface to the hardware broadcast interface and to packing of data to conserve space in the store of the BDX930 processors. The running code was in fact developed prior to and without consideration of any mechanical verification. This was regarded as necessary experimentation with the SIFT hardware and special purpose Pascal compiler. The Pascal code sections cover: the selection of a schedule from the global executive broadcast, scheduling, dispatching, three way voting, and error reporting actions of the SIFT Executive. Not included in these sections of Pascal code are: the global executive, five way voting, clock synchronization, interactive consistency, low level broadcasting, and program loading, initialization, and schedule construction.

Source record↗

Development of Energy Storage: Cost models

Energy storage technologies offer a promising solution to electric grid stability issues associated with the integration of variable renewable generators. The capability to match the electrical power output to instantaneous fluctuations in grid demand is crucial to ensure continuity of service. Including energy storage capability in an integrated energy system (IES) can provide the flexibility needed to meet variable electric demand and reduce the load following demands place on the reactor. In this report, economic data collected for energy storage (ES) technologies are described to support the objective of assessing the profitability of ES integration within the IES framework. In particular, there is a growing interest in thermal energy storage (TES) given its unique capability for long-duration storage for improving electricity reliability at a low levelized cost. It is common practice to evaluate the total lifetime cost and profitability before commercializing new technologies. In this report we identify and examine the models needed to better understand the economics of thermal energy storage. We extend the TES cost model in RAVEN in the context of a balance of plant (BOP) that incorporates thermal storage. To focus the discussion, following a general overview of the most promising TES technologies, we consider a use case that involves a sensible heat, two-tank, molten-salt system. Structural and operational details are reported to identify the source of construction capital expenditure and operation and maintenance cost. A detailed description of the different cost items is provided as well as the cost scaling with different storage capacity and power ratings for capacity optimization purpose. In addition, the capital expenditure and the recurring cost of representative two-tank, molten salt coupled with concentrated solar plants are provided for readers’ reference. The ES use case is noteworthy as it is in the pilot stage of commercialization. We identify those areas that would benefit from an increased economic focus to obtain a more complete compilation of cost data. We also describe the thermal coupling issues that arise from integration of the two-tank molten salt thermal energy storage system with a BOP, which is the subject of our current research. Some components of costs will need to be evaluated through dedicated technoeconomic analysis in future modeling activities using modeling procedures proposed in this report. With the data presented and the procedures described in this report, sufficiently accurate models can be implemented for the solution of both the power dispatch and the capacity expansion problems within the RAVEN-based HYBRID framework.

25 ENERGY STORAGE↗

Preliminary Enhanced LAW Glass Formulation Algorithm

This report summarizes the Preliminary Enhanced Low-Activity Waste Glass Formulation Algorithm (GFA), its background information, and the calculations it performs. The Preliminary Enhanced Low-Activity Waste GFA is a tool developed in MATLAB to formulate glass for a given waste composition while attempting to maximize waste loading. It is intended for use at the Waste Treatment and Immobilization Plant, where nuclear waste will be vitrified into glass. The formulated glass is required to satisfy several processing and product quality constraints. In addition, calculations must account for associated uncertainties in constraint prediction and measurement. The GFA adheres to Pacific Northwest National Laboratory nuclear quality assurance procedures and has been validated and verified. In this second revision to the report, two constraints: the lithium and zirconia target constraints were amended to Table 3.1 and programmed into the algorithm. Additionally, three sections were added. Section 3.2.1 includes the Enhanced LAW Correlation Rules, an addition to the glass optimality criteria. Section 4.0 discusses a stepped process approach taken to ensure the algorithm can adequately react to differences between its recommended output and the actual measurements and transfers made during plant operation, and calculation of specific radionuclide concentrations. Section 5.2 describes changes to the user interaction with the algorithm program including the addition of a graphical user interface and compilation of the software.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

On the Efficacy of Source Code Optimizations for Cache-Based Systems

Obtaining high performance without machine-specific tuning is an important goal of scientific application programmers. Since most scientific processing is done on commodity microprocessors with hierarchical memory systems, this goal of "portable performance" can be achieved if a common set of optimization principles is effective for all such systems. It is widely believed, or at least hoped, that portable performance can be realized. The rule of thumb for optimization on hierarchical memory systems is to maximize temporal and spatial locality of memory references by reusing data and minimizing memory access stride. We investigate the effects of a number of optimizations on the performance of three related kernels taken from a computational fluid dynamics application. Timing the kernels on a range of processors, we observe an inconsistent and often counterintuitive impact of the optimizations on performance. In particular, code variations that have a positive impact on one architecture can have a negative impact on another, and variations expected to be unimportant can produce large effects. Moreover, we find that cache miss rates - as reported by a cache simulation tool, and confirmed by hardware counters - only partially explain the results. By contrast, the compiler-generated assembly code provides more insight by revealing the importance of processor-specific instructions and of compiler maturity, both of which strongly, and sometimes unexpectedly, influence performance. We conclude that it is difficult to obtain performance portability on modern cache-based computers, and comment on the implications of this result.

VanderWijngaart, Rob F.↗

IRIS-GNN: Leveraging Graph Neural Networks for Scheduling on Truly Heterogeneous Runtime Systems

The diversity of accelerators in computer systems poses significant challenges for software developers, such as managing vendor-specific compiler toolchains, code fragmentation requiring different kernel implementations, and performance portability issues. To address these, the Intelligent Runtime System (IRIS) was developed. IRIS works across various systems, from smartphones to supercomputers, enabling automatic performance scaling based on available accelerators. It introduces abstract tasks for seamless execution transitions between accelerators while ensuring memory consistency and task dependencies. Although IRIS simplifies system details, optimal dynamic scheduling still requires user input to understand workload structures. To address this, we introduce a new scheduling policy for IRIS, termed IRIS-GNN, which is the first IRIS hybrid policy that operates in conjunction with the dynamic policies. This policy employs a Graph-Neural Network (GNN) to conduct Graph Classification of any task graphs submitted to IRIS. This GNN analyzes the structure and attributes of the task graph, categorizing it as either locality, concurrency, or mixed. This classification subsequently guides the selection of the dynamic policy used by IRIS. We provide a comparison of the performance of IRIS-GNN against the complete spectrum of IRIS’s dynamic policies, assess the overhead introduced by the GNN within this scheduling framework, and ultimately explore its practical application in real-world scenarios.

Johnston, Beau↗

QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation

The rapid development of quantum computing (QC) in the NISQ era urgently demands a low-level benchmark suite and insightful evaluation metrics for characterizing the properties of prototype NISQ devices, the efficiency of QC programming compilers, schedulers and assemblers, and the capability of quantum system simulators in a classical computer. In this work, we fill this gap by proposing a low-level, easy-to-use benchmark suite called QASMBench based on the OpenQASM assembly representation. It consolidates commonly used quantum routines and kernels from a variety of domains including chemistry, simulation, linear algebra, searching, optimization, arithmetic, machine learning, fault tolerance, cryptography, and so on, trading-off between generality and usability. To analyze these kernels in terms of NISQ device execution, in addition to circuit width and depth, we propose four circuit metrics including gate density, retention lifespan, measurement density, and entanglement variance, to extract more insights about the execution efficiency, the susceptibility to NISQ error, and the potential gain from machine-specific optimizations. Applications in QASMBench can be launched and verified on several NISQ platforms, including IBM-Q, Rigetti, IonQ and Quantinuum. For evaluation, we measure the execution fidelity of a subset of QASMBench applications on 12 IBM-Q machines through density matrix state tomography, comprising 25K circuit evaluations. In addition we also compare the fidelity of executions among the IBM-Q machines, the IonQ QPU and the Rigetti Aspen M-1 system.

97 MATHEMATICS AND COMPUTING↗

On the Efficacy of Source Code Optimizations for Cache-Based Systems

Obtaining high performance without machine-specific tuning is an important goal of scientific application programmers. Since most scientific processing is done on commodity microprocessors with hierarchical memory systems, this goal of "portable performance" can be achieved if a common set of optimization principles is effective for all such systems. It is widely believed, or at least hoped, that portable performance can be realized. The rule of thumb for optimization on hierarchical memory systems is to maximize temporal and spatial locality of memory references by reusing data and minimizing memory access stride. We investigate the effects of a number of optimizations on the performance of three related kernels taken from a computational fluid dynamics application. Timing the kernels on a range of processors, we observe an inconsistent and often counterintuitive impact of the optimizations on performance. In particular, code variations that have a positive impact on one architecture can have a negative impact on another, and variations expected to be unimportant can produce large effects. Moreover, we find that cache miss rates-as reported by a cache simulation tool, and confirmed by hardware counters-only partially explain the results. By contrast, the compiler-generated assembly code provides more insight by revealing the importance of processor-specific instructions and of compiler maturity, both of which strongly, and sometimes unexpectedly, influence performance. We conclude that it is difficult to obtain performance portability on modern cache-based computers, and comment on the implications of this result.

VanderWijngaart, Rob F.↗

Union: A Unified HW-SW Co-Design Ecosystem in MLIR for Evaluating Tensor Operationson Spatial Accelerators

To meet the extreme compute demands for deep learning across commercial and scientific applications, dataflow accelerators are becoming increasingly popular. While these“domain-specific” accelerators are not fully programmable like CPUs and GPUs, they retain varying levels of flexibility with respect to data orchestration, i.e., dataflow and tiling optimizations to enhance efficiency. There are several challenges when designing new algorithms and mapping approaches to execute the algorithms for a target problem on new hardware. Previous works have addressed these challenges individually. To address this challenge as a whole, in this work, we present an HW-SW co-design ecosystem for spatial accelerators called Union within the popular MLIR compiler infrastructure. Our framework allows exploring different algorithms and their mappings on several accelerator cost models. Union also includes a plug-and-play library of accelerator cost models and mappers which can easily be extended. The algorithms and accelerator cost models are connected via a novel mapping abstraction that captures the map space of spatial accelerators which can be systematically pruned based on constraints from the hardware, workload, and mapper. We demonstrate the value of Union for the community with several case studies which examine offloading different tensor operations (CONV/GEMM/Tensor Contraction) on diverse accelerator architectures using different mapping schemes.

Jeong, Geonhwa↗

Wireless Channel Characterization in the Airport Surface Environment

Given the anticipated increase in air traffic in the coming years, modernization of the National Airspace System (NAS) is a necessity. Part of this modernization effort will include updating current communication, navigation, and surveillance (CNS) systems to deal with the increased traffic as well as developing advanced CNS technologies for the systems. An example of such technology is the integrated CNS (ICNS) network being developed by the Advanced CNS Architecture and Systems Technology (ACAST) group for use in the airport surface environment. The ICNS network would be used to convey voice/data between users in a secure and reliable manner. The current surface system only supports voice and does so through an obsolete physical infrastructure. The old system is vulnerable to outages and costly to maintain. The proposed ICNS network will include a wireless radio link. To ensure optimal performance, a thorough and accurate characterization of the channel across which the link would operate is necessary. The channel is the path the signal takes from the transmitter to the receiver and is prone to various forms of interference. Channel characterization involves a combination of analysis, simulation, and measurement. My work this summer was divided into four tasks. The first task required compiling and reviewing reference material that dealt with the characterization and modeling of aeronautical channels. The second task involved developing a systematic approach that could be used to group airports into classes, e.g. small airfields, medium airports, large open airports, large cluttered airports, etc. The third task consisted of implementing computer simulations of existing channel models. The fourth task entailed measuring possible interference sources in the airport surface environment via a spectrum analyzer.

Neville, Joshua T.↗

Advances in statistical methods for cancer surveillance research: an age-period-cohort perspective

Background: Analysis of Lexis diagrams (population-based cancer incidence and mortality rates indexed by age group and calendar period) requires specialized statistical methods. However, existing methods have limitations that can now be overcome using new approaches. Methods: We assembled a “toolbox” of novel methods to identify trends and patterns by age group, calendar period, and birth cohort. We evaluated operating characteristics across 152 cancer incidence Lexis diagrams compiled from United States (US) Surveillance, Epidemiology and End Results Program data for 21 leading cancers in men and women in four race and ethnicity groups (the “cancer incidence panel”). Results: Nonparametric singular values adaptive kernel filtration (SIFT) decreased the estimated root mean squared error by 90% across the cancer incidence panel. A novel method for semi-parametric age-period-cohort analysis (SAGE) provided optimally smoothed estimates of age-period-cohort (APC) estimable functions and stabilized estimates of lack-of-fit (LOF). SAGE identified statistically significant birth cohort effects across the entire cancer panel; LOF had little impact. As illustrated for colon cancer, newly developed methods for comparative age-period-cohort analysis can elucidate cancer heterogeneity that would otherwise be difficult or impossible to discern using standard methods. Conclusions: Cancer surveillance researchers can now identify fine-scale temporal signals with unprecedented accuracy and elucidate cancer heterogeneity with unprecedented specificity. Birth cohort effects are ubiquitous modulators of cancer incidence in the US. The novel methods described here can advance cancer surveillance research.

60 APPLIED LIFE SCIENCES↗