Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Compiler frameworks”

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 163 records · Page 9

Compile-time estimation of communication costs in multicomputers

An important problem facing numerous research projects on parallelizing compilers for distributed memory machines is that of automatically determining a suitable data partitioning scheme for a program. Any strategy for automatic data partitioning needs a mechanism for estimating the performance of a program under a given partitioning scheme, the most crucial part of which involves determining the communication costs incurred by the program. A methodology is described for estimating the communication costs at compile-time as functions of the numbers of processors over which various arrays are distributed. A strategy is described along with its theoretical basis, for making program transformations that expose opportunities for combining of messages, leading to considerable savings in the communication costs. For certain loops with regular dependences, the compiler can detect the possibility of pipelining, and thus estimate communication costs more accurately than it could otherwise. These results are of great significance to any parallelization system supporting numeric applications on multicomputers. In particular, they lay down a framework for effective synthesis of communication on multicomputers from sequential program references.

Gupta, Manish↗

IBPSA Project 2 BOPTEST: An update on the test cases available in the framework for testing advanced control strategies in buildings

Project 2 develops software infrastructure, test cases, and extensions for the Building Optimization Testing Framework (BOPTEST) to address the expanding needs of building and urban energy system controls through open international collaboration. This paper provides an overview of the new test cases available as of BOPTEST version 0.7.1. Each test case is developed using open-source Modelica libraries and Spawn of EnergyPlus, enabling the creation of high-fidelity building models that incorporate envelope dynamics, Heating Ventilation and Air Conditioning (HVAC) systems, and explicit control representations. Currently, eight test cases are available, with five additional cases under development. These test cases cover a wide range of climates, building types, and HVAC systems. This paper compiles and summarizes test case descriptions, cites original manuscripts that developed them for a more detailed description, and reports baseline control performance metrics. Furthermore, two example applications are presented: one illustrating different levels of control, from supervisory to low-level, and another demonstrating how Model Predictive Control (MPC) solutions must be adapted from continuous to integer to control some building actuators.

Zanetti, Ettore↗

An updated LLVM-based quantum research compiler with further OpenQASM support

Abstract Quantum computing is a rapidly growing field with the potential to change how we solve previously intractable problems. Emerging hardware is approaching a complexity that requires increasingly sophisticated programming and control. Scaffold is an older quantum programming language that was originally designed for resource estimation for far-future, large quantum machines, and ScaffCC is the corresponding LLVM-based compiler. For the first time, we provide a full and complete overview of the language itself, the compiler as well as its pass structure. While previous works Abhari et al (2015 Parallel Comput. 45 2–17), Abhari et al (2012 Scaffold: quantum programming language https://cs.princeton.edu/research/techreps/TR-934-12 ), have piecemeal descriptions of different portions of this toolchain, we provide a more full and complete description in this paper. We also introduce updates to ScaffCC including conditional measurement and multidimensional qubit arrays designed to keep in step with modern quantum assembly languages, as well as an alternate toolchain targeted at maintaining correctness and low resource count for noisy-intermediate scale quantum (NISQ) machines, and compatibility with current versions of LLVM and Clang. Our goal is to provide the research community with a functional LLVM framework for quantum program analysis, optimization, and generation of executable code.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

QECC-Synth: A Layout Synthesizer for Quantum Error Correction Codes on Sparse Architectures

Quantum Error Correction (QEC) codes are essential for achieving fault-tolerant quantum computing (FTQC). However, their implementation faces significant challenges due to disparity between required dense qubit connectivity and sparse hardware architectures. Current approaches often either underutilize QEC circuit features or focus on manual designs tailored to specific codes and architectures, limiting their capability and generality. In response, we introduce QECC-Synth, an automated compiler for QEC code implementation that addresses these challenges. We leverage the ancilla bridge technique tailored to the requirements of QEC circuits and introduces a systematic classification of its design space flexibilities. We then formalize this problem using the MaxSAT framework to optimize these flexibilities. Evaluation shows that our method significantly outperforms existing methods while demonstrating broader applicability across diverse QEC codes and hardware architectures.

Yin, Keyi [University of California, San Diego]↗

Computing the Properties of Matter with Leadership Computing Resources (Closeout Report for DE-SC0018121)

In order to add more capabilities to Halide, we have designed a new framework called Tiramisu and integrated this framework into Halide. Since Tiramisu enables Halide to target heterogeneous architectures, our development efforts have been refocused on Tiramisu. Most high-performance computer systems today are complex and increasingly heterogeneous; they may have CPUs, GPUs and FPGAs. Achieving best performance requires taking full advantage of all these different architectures. To address this issue, we have designed Tiramisu, an optimization framework that enables Halide (and other DSLs) to target heterogeneous architectures. Tiramisu is an optimization framework that takes as input a high level, architecture-independent representation of code and a set of scheduling and data mapping commands that guide code transformation. The input can either be generated by a domain-specific language (DSL) compiler such as Halide or directly written by a programmer. Tiramisu then applies the user-specified code and data-layout transformations and generates an architecture-specific, low-level intermediate representation (IR) that takes advantage of modern architectural features such as multicore parallelism, non-uniform memory (NUMA) hierarchies, clusters, and accelerators like GPUs and FPGAs. We integrated Tiramisu within Halide and implemented a representative set of benchmarks to evaluate this integration. Tiramisu is now open source and is available for public use (http://tiramisu-compiler.org/). A paper about Tiramisu was published, it shows that Tiramisu extends Halide with many new capabilities and that Tiramisu can generate efficient code for multicores, GPUs, FPGAs and distributed heterogeneous systems. The performance of code generated by the Tiramisu backends matches or exceeds hand optimized reference implementations. For example, the multicore backend matches the highly optimized Intel MKL library on many kernels and shows speedups reaching 4x over the original Halide. In addition to making Tiramisu more robust, we have used Tiramisu to implement a set of representative tensor operation for constructing baryon building blocks required for multi baryon contractions in LQCD. In order to implement this code, we needed to generalize Tiramisu in two ways: first we needed to support indirect array accesses, and second, we needed to add support for complex numbers to Tiramisu. The code generated by Tiramisu is 6x faster than the reference code. Our efforts towards an MPI based multi-node version of tiramisu have matured and the resulting code scales well on multiple nodes (tests up to 512 KNL nodes have been undertaken).

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Aerodynamic Assessment of Flight-Determined Subsonic Lift and Drag Characteristics of Seven Lifting-Body and Wing-Body Reentry Vehicle Configurations

This report examines subsonic flight-measured lift and drag characteristics of seven lifting-body and wing-body reentry vehicle configurations with truncated bases. The seven vehicles are the full-scale M2-F1, M2-F2, HL-10, X-24A, X-24B, and X-15 vehicles and the Space Shuttle Enterprise. Subsonic flight lift and drag data of the various vehicles are assembled under aerodynamic performance parameters and presented in several analytical and graphical formats. These formats are intended to unify the data and allow a greater understanding than individually studying the vehicles allows. Lift-curve slope data are studied with respect to aspect ratio and related to generic wind-tunnel model data and to theory for low-aspect-ratio platforms. The definition of reference area is critical for understanding and comparing the lift data. The drag components studied include minimum drag coefficient, lift-related drag, maximum lift-to drag ratio, and, where available, base pressure coefficients. The influence of forebody drag on afterbody and base drag at low lift is shown to be related to Hoerner's compilation for body, airfoil, nacelle, and canopy drag. This feature may result in a reduced need of surface smoothness for vehicles with a large ratio of base area to wetted area. These analyses are intended to provide a useful analytical framework with which to compare and evaluate new vehicle configurations of the same generic family.

Saltzman, Edwin J.↗

Neotectonics of the Caribbean

Burke et al. (1980) have considered geologic and seismic data from Jamaica, while Mann et al. (1984) have examined data from Hispaniola. The present investigation is concerned with the neotectonics of the entire Caribbean region, taking into account the recent results in the northeastern Caribbean and a more comprehensive compilation of seismicity and neotectonic structures from other areas than has been available to most previous authors. It is hoped that this study will complement seismic network results in helping to pinpoint areas of seismic hazard. It is also intended to provide a framework for high-precision geodetic surveys of Caribbean plate motion using measurements from satellites and astronomical observations.

Mann, P.↗

Rapidly Re-Configurable Flight Simulator Tools for Crew Vehicle Integration Research and Design

While simulation is a valuable research and design tool, the time and difficulty required to create new simulations (or re-use existing simulations) often limits their application. This report describes the design of the software architecture for the Reconfigurable Flight Simulator (RFS), which provides a robust simulation framework that allows the simulator to fulfill multiple research and development goals. The core of the architecture provides the interface standards for simulation components, registers and initializes components, and handles the communication between simulation components. The simulation components are each a pre-compiled library 'plug-in' module. This modularity allows independent development and sharing of individual simulation components. Additional interfaces can be provided through the use of Object Data/Method Extensions (OD/ME). RFS provides a programmable run-time environment for real-time access and manipulation, and has networking capabilities using the High Level Architecture (HLA).

Schutte, Paul C.↗

Rapidly Re-Configurable Flight Simulator Tools for Crew Vehicle Integration Research and Design

While simulation is a valuable research and design tool, the time and difficulty required to create new simulations (or re-use existing simulations) often limits their application. This report describes the design of the software architecture for the Reconfigurable Flight Simulator (RFS), which provides a robust simulation framework that allows the simulator to fulfill multiple research and development goals. The core of the architecture provides the interface standards for simulation components, registers and initializes components, and handles the communication between simulation components. The simulation components are each a pre-compiled library 'plugin' module. This modularity allows independent development and sharing of individual simulation components. Additional interfaces can be provided through the use of Object Data/Method Extensions (OD/ME). RFS provides a programmable run-time environment for real-time access and manipulation, and has networking capabilities using the High Level Architecture (HLA).

Pritchett, Amy R.↗

General Mission Analysis Tool (GMAT) Architectural Specification. Draft

Early in 2002, Goddard Space Flight Center (GSFC) began to identify requirements for the flight dynamics software needed to fly upcoming missions that use formations of spacecraft to collect data. These requirements ranged from low level modeling features to large scale interoperability requirements. In 2003 we began work on a system designed to meet these requirement; this system is GMAT. The General Mission Analysis Tool (GMAT) is a general purpose flight dynamics modeling tool built on open source principles. The GMAT code is written in C++, and uses modern C++ constructs extensively. GMAT can be run through either a fully functional Graphical User Interface (GUI) or as a command line program with minimal user feedback. The system is built and runs on Microsoft Windows, Linux, and Macintosh OS X platforms. The GMAT GUI is written using wxWidgets, a cross platform library of components that streamlines the development and extension of the user interface Flight dynamics modeling is performed in GMAT by building components that represent the players in the analysis problem that is being modeled. These components interact through the sequential execution of instructions, embodied in the GMAT Mission Sequence. A typical Mission Sequence will model the trajectories of a set of spacecraft evolving over time, calculating relevant parameters during this propagation, and maneuvering individual spacecraft to maintain a set of mission constraints as established by the mission analyst. All of the elements used in GMAT for mission analysis can be viewed in the GMAT GUI or through a custom scripting language. Analysis problems modeled in GMAT are saved as script files, and these files can be read into GMAT. When a script is read into the GMAT GUI, the corresponding user interface elements are constructed in the GMAT GUI. The GMAT system was developed from the ground up to run in a platform agnostic environment. The source code compiles on numerous different platforms, and is regularly exercised running on Windows, Linux and Macintosh computers by the development and analysis teams working on the project. The system can be run using either a graphical user interface, written using the open source wxWidgets framework, or from a text console. The GMAT source code was written using open source tools. GSFC has released the code using the NASA open source license.

Hughes, Steven P.↗

Discovery and problem solving: Triangulation as a weak heuristic

Recently the artificial intelligence community has turned its attention to the process of discovery and found that the history of science is a fertile source for what Darden has called compiled hindsight. Such hindsight generates weak heuristics for discovery that do not guarantee that discoveries will be made but do have proven worth in leading to discoveries. Triangulation is one such heuristic that is grounded in historical hindsight. This heuristic is explored within the general framework of the BACON, GLAUBER, STAHL, DALTON, and SUTTON programs. In triangulation different bases of information are compared in an effort to identify gaps between the bases. Thus, assuming that the bases of information are relevantly related, the gaps that are identified should be good locations for discovery and robust analysis.

Rochowiak, Daniel↗

Towards On-Chip Learning for Low Latency Reasoning with End-to-End Synthesis

The Software Defined Architectures (SODA) Synthesizer is an open-source compiler-based tool able to automatically generate domain-specialized systems targeting Application-Specific Integrated Circuits (ASICs) or Field Programmable Gate Arrays (FPGAs) starting from high-level programming. SODA is composed of a frontend, SODA-OPT, which leverages the multilevel intermediate representation (MLIR) framework to interface with productive programming tools (e.g., machine learning frame-works), identify kernels suitable for acceleration, and perform high-level optimizations, and of a state-of-the-art high-level synthesis backend, Bambu from the PandA framework, to generate custom accelerators. One specific application of the SODA Synthesizer is the generation of accelerators to enable ultra-low latency inference and control on autonomous systems for scientific discovery (e.g., electron microscopes, sensors in particle accelerators, etc.). This paper provides an overview of the flow in the context of the generation of accelerators for edge processing to be integrated in transmission electron microscopy (TEM) devices, focusing on use cases from precision material synthesis. We show the tool in action with an example of design space exploration for inference on reconfigurable devices with a conventional deep neural network model (LeNet). Finally, we discuss the research directions and opportunities enabled by SODA in the area of autonomous control for scientific experimental workflows.

Castellana, Vito G.↗

Automating NISQ Application Design with Meta Quantum Circuits with Constraints (MQCC)

Near-term intermediate scale quantum (NISQ) computers are likely to have very restricted hardware resources, where precisely controllable qubits are expensive, error-prone, and scarce. Programmers of such computers must therefore balance trade-offs among a large number of (potentially heterogeneous) factors specific to the targeted application and quantum hardware. To assist them, we propose Meta Quantum Circuits with Constraints (MQCC), a meta-programming framework for quantum programs. Programmers express their application as a succinct collection of normal quantum circuits stitched together by a set of (manually or automatically) added meta-level choice variables, whose values are constrained according to a programmable set of quantitative optimization criteria. MQCC’s compiler generates the appropriate constraints and solves them via an SMT solver, producing an optimized, runnable program. We showcase a few MQCC’s applications for its generality including an automatic generation of efficient error syndrome extraction schemes for fault-tolerant quantum error correction with heterogeneous qubits and an approach to writing approximate quantum Fourier transformation and quantum phase estimation that smoothly trades off accuracy and resource use. We also illustrate that MQCC can easily encode prior one-off NISQ application designs-–multi-programming (MP), crosstalk mitigation (CM)—as well as a combination of their optimization goals (i.e., a combined MP-CM).

97 MATHEMATICS AND COMPUTING↗

Strategic Energy Management Program Persistence and Cost Effectiveness An Analysis of the SEM Program Landscape

This study examines the relationship between strategic energy management (SEM) programs and their persistence and cost effectiveness, with analysis based on interview data from 24 SEM program administrators, SEM program evaluations, and other reports. The 80 interview questions focused on the topics of program design, energy savings, energy savings persistence, cost effectiveness, and customer SEM persistence. The generosity of interview respondents provided a wealth of data, resulting in a report of sufficient length to warrant inclusion of this brief guide of the report structure. The major sections are listed below with brief descriptions. Individual sections of this report are mainly stand-alone and do not require reading of other sections. As a result, there is some duplication between sections, but with differing levels of detail. Executive Summary: Presents three key conclusions of this work with a short description of potential actions to advance the understanding of each key finding. Brief Observations: Lists a large number of bulleted observations resulting from this research, arranged by the five major topic areas included in the interviews. Analysis details are provided in the Analysis of Interview Results section. Foundations for this Research: Provides an overview of SEM, SEM frameworks, SEM programs, the topics of persistence and cost effectiveness, and the focus of this research. Methodology: Details the approach and strategy of this research, providing background information relevant to the formulation of interview questions and the identification of which SEM programs to interview. Observations from Compiled Evaluations and Other Reports: Reports observations from the collection and analysis of program evaluations, annual reports, utility planning documents, and SEM-related white papers. This section, presented in bullet form, highlights challenges in data collection and ultimately a comparison of program practices as they pertain to persistence and cost effectiveness. Analysis of Interview Results: Presents detailed analysis of responses from SEM program administrators, arranged by the five major categories examined: program design, energy savings, energy savings persistence, cost effectiveness, and customer SEM persistence. Interview questions are generally grouped together into subsections when it makes sense to examine them together. SEM Programs Challenge Traditional Cost-Effectiveness Metrics: Details an analysis based on five key factors showing that applying traditional cost-effectiveness metrics to SEM programs is not straightforward. This invites the opportunity to consider whether traditional cost-effectiveness metrics are applicable to SEM programs, either individually or at large. Resolution of Research Hypotheses: Tabulates a set of hypotheses that were developed to address the fundamental nature of the research at hand. Analysis of responses to multiple questions informs an understanding of each hypothesis and can be used to better understand the SEM program environment at large.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Design of Controller Hardware-In-the-Loop Model of Microgrid with Modular Building Blocks and Automated Design Script

The scalability of controller hardware-in-the-loop (CHIL) simulation is critical for validating control coordination and energy management in microgrids with distributed energy resources, especially as these modern systems become more complex and decentralized. This paper presents a CHIL modeling methodology that combines modular building blocks with an automated design script to streamline the development of high-fidelity microgrid models. Standardized subsystem templates for resources, converters, and buses are integrated with a Python-based script that compiles structured JSON configuration files into simulation-ready initialization code. The proposed approach reduces development time, improves model consistency, and enhances simulation fidelity. The methodology is validated on a Typhoon HIL604 platform and is broadly applicable to real-time simulation of complex, networked microgrid systems. This framework establishes a foundation for automated, scalable CHIL validation and accelerates the design of next-generation distributed energy systems.

Kim, Namwon [ORNL] (ORCID:0000000200438489)↗

Reservoir Sediment Management and Monitoring Database

Overview This dataset compiles dam sediment management and monitoring information from surveys, case studies, and journal articles. Additionally, features described by the National Inventory of Dams (i.e., presence of sluice gates) are included to indicate known infrastructure features that may address sediment releases. The location and description of records from downstream monitoring gages are catalogued in order to help with tracking conditions over time (e.g., before and after management actions, as operations change, etc.). The data help address national scale understanding of challenges and solutions related to the accumulation of sediment behind a dam as well as downstream passage. Sediment trapping causes problems as it reduces storage capacity, disrupts dam and reservoir function, impedes access for recreation, alters water quality/habitat conditions, and contributes to riverbank and coastal erosion within the reservoir. Data compilation from a variety of sources is a first step towards assessing system-wide efficacy of management solutions. This dataset was developed under the Water Power Technologies Office funded effort which began as a Seedling on Reservoir Sedimentation Data, and was supported by the Reservoir Sedimentation Modeling Framework and Data Analysis project. These projects have addressed challenges in describing sediment transport, trapping, and management at dams throughout the US. Methodology An outer join on dams/reservoirs with surveys and survey reports (documented in the RESSED database, USBR or USACE databases, project websites, etc.) with the National Inventory of Dams, based on the NIDID to determine dams with documented management and/or sluice gates. Additional dams with documented management activity were identified through review of technical articles from the past 25 years in Journal of Hydrology, Journal of Water Resources Planning and Management, Geomorphology, Journal of Hydraulic Engineering, Water, Journal of Cleaner Production, International Journal of Sediment Research, Nature Scientific Reports, Earth Surface Processes and Landforms, and Environmental Science and Pollution Research. Individual records were created for each survey or management activity documented. To evaluate downstream sediment monitoring records, the nhdPlusTools and dataRetrieval packages in R were used to find gages within 10km of each dam in the management database. Length of record and location of matched gages were retrieved for those parameters relevant to sediment concentration or total sediment discharge.

Hansen, Carly [ORNL] (ORCID:0000000193280838)↗

HERA Modeling and Simulation Exercise: BISON Results

A Modeling and Simulation (M&S) exercise is being performed for the High burnup Experiments for Reactivity initiated Accident (HERA) project under the Nuclear Energy Agency (NEA) Framework for Irradiation Experiments (FIDES) program. The goal of the M&S exercise is to improve M&S and experiment integration, facilitate community involvement in experiment design and interpretation, facilitate community collaboration, and aid in ensuring program data meet fuel performance code needs. The M&S exercise will compile and compare results from over 20 international organizations using 14 different fuel performance codes. This paper presents the results from the BISON fuel performance code generated by the Idaho National Laboratory participants.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Towards Automated Generation of Chiplet-Based Systems

The Software Defined Architectures (SODA) Synthesizer is an open-source compiler-based tool able to automatically generate domain-specialized systems targeting Application- Specific Integrated Circuits (ASICs) or Field Programmable Gate Arrays (FPGAs) starting from high-level programming. SODA is composed of a high-level frontend, SODA-OPT, which leverages the multilevel intermediate representation (MLIR) framework to interface with productive programming tools (e.g., machine learning frameworks), identify kernels suitable for acceleration, and perform high-level optimizations, and of a state-of-the-art high-level synthesis backend, Bambu from the PandA framework, to generate custom accelerators. One specific application of the SODA Synthesizer is the generation of accelerators to enable ultra-low latency inference and control on autonomous systems for scientific discovery (e.g., electron microscopes, sensors in particle accelerators, etc.). This talk will discuss ongoing work on the SODA synthesizer to enable no-human-in-the-loop generation and design space exploration of the chiplets for highly specialized artificial intelligence accelerators. Connecting these highly specialized chiplets to general-purpose cores or programmable accelerators will allow to quickly deploy autonomous systems for scientific discovery.

Limaye, Ankur M.↗