SEARCH · Engineering Papers

Results for “Applications”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,333 records · Page 74

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Design methodologies and engineering applications for ecosystem biomimicry: an interdisciplinary review spanning cyber, physical, and cyber-physical systems

Abstract Ecosystem biomimicry is a promising pathway for sustainable development. However, while typical form- and process-level biomimicry is prevalent, system-level ecosystem biomimicry remains a nascent practice in numerous engineering fields. This critical review takes an interdisciplinary approach to synthesize trends across case studies, evaluate design methodologies, and identify future opportunities when applying ecosystem biomimicry to engineering practices, including cyber systems (CS), physical systems (PS), and cyber-physical systems (CPS). After systematically sourcing publications from major databases, the papers were first analyzed at a meta level for their bibliographic context and for statistical correlations among categorical variables. Then, we investigated deeper into the engineering applications and design methodologies. Results indicate that CPS most frequently mimic organisms and ecosystems, while CS and PS frequently mimic populations-communities and molecules-tissues-organ systems, respectively (statistically highly significant). An indirect approach is most often used for mimicry at organizational levels from populations to ecosystems, while a direct approach frequently suits levels from molecules to organisms (highly significant). Dominant themes across engineering applications include symbiotic organism search algorithms for CS and ecological network analysis for CPS, while PS are highly diverse. For design methodologies, this work summarizes and details ten well-documented biomimetic process models among literature, which addresses an outdated concern for a lack of systematic methods for ecosystem biomimicry. In addition to the Biomimetics Standard ISO 18458, these methods include the Natural Step and Techno-Ecological Synergy framework, among others. Further, the analyses revealed future opportunities from less utilized design methods (e.g. interdisciplinary teams tackling indirect, ecosystem-level projects) to well-established engineering concepts ready for technological advancement (e.g. implementing membrane computing for physical applications). For future studies, this review provides a comprehensive reference for ecosystem biomimetic design practices and application opportunities across multiple engineering domains.

42 ENGINEERING↗

DOE OSTI2025

Lighting up yeast: overview of optogenetics in yeast and their applications to yeast biotechnology

Abstract Optogenetics is an empowering technology that uses light-responsive proteins to control biological processes. Because of its genetic tractability, abundance of genetic tools, and robust culturing conditions, Saccharomyces cerevisiae has served for many years as an ideal platform in which to study, develop, and apply a wide range of optogenetic systems. In many instances, yeast has been used as a steppingstone in which to characterize and optimize optogenetic tools to later be deployed in higher eukaryotes. More recently, however, optogenetic tools have been developed and deployed in yeast specifically for biotechnological applications, including in nonconventional yeasts. In this review, we summarize various optogenetic systems responding to different wavelengths of light that have been demonstrated in diverse yeast species. We then describe various applications of these optogenetic tools in yeast, particularly in metabolic engineering and recombinant protein production. Finally, we discuss emerging applications in yeast cybergenetics—the interfacing of yeast and computers for closed-loop controls of yeast bioprocesses—and the potential impact of optogenetics in other future biotechnological applications.

Biotechnology & Applied Microbiology↗

DOE OSTI2018

I/O load balancing for big data HPC applications

High Performance Computing (HPC) big data problems require efficient distributed storage systems. However, at scale, such storage systems often experience load imbalance and resource contention due to two factors: the bursty nature of scientific application I/O; and the complex I/O path that is without centralized arbitration and control. For example, the extant Lustre parallel file system-that supports many HPC centers-comprises numerous components connected via custom network topologies, and serves varying demands of a large number of users and applications. Consequently, some storage servers can be more loaded than others, which creates bottlenecks and reduces overall application I/O performance. Existing solutions typically focus on per application load balancing, and thus are not as effective given their lack of a global view of the system. In this paper, we propose a data-driven approach to load balance the I/O servers at scale, targeted at Lustre deployments. To this end, we design a global mapper on Lustre Metadata Server, which gathers runtime statistics from key storage components on the I/O path, and applies Markov chain modeling and a minimum-cost maximum-flow algorithm to decide where data should be placed. Evaluation using a realistic system simulator and a real setup shows that our approach yields better load balancing, which in turn can improve end-to-end performance.

Paul, Arnab K.↗

DOE OSTI2015

An Efficient Silent Data Corruption Detection Method with Error-Feedback Control and Even Sampling for HPC Applications

The silent data corruption (SDC) problem is attracting more and more attentions because it is expected to have a great impact on exascale HPC applications. SDC faults are hazardous in that they pass unnoticed by hardware and can lead to wrong computation results. In this work, we formulate SDC detection as a runtime one-step-ahead prediction method, leveraging multiple linear prediction methods in order to improve the detection results. The contributions are twofold: (1) we propose an error feedback control model that can reduce the prediction errors for different linear prediction methods, and (2) we propose a spatial-data-based even-sampling method to minimize the detection overheads (including memory and computation cost). We implement our algorithms in the fault tolerance interface, a fault tolerance library with multiple checkpoint levels, such that users can conveniently protect their HPC applications against both SDC errors and fail-stop errors. We evaluate our approach by using large-scale traces from well-known, large-scale HPC applications, as well as by running those HPC applications on a real cluster environment. Experiments show that our error feedback control model can improve detection sensitivity by 34-189% for bit-flip memory errors injected with the bit positions in the range [20,30], without any degradation on detection accuracy. Furthermore, memory size can be reduced by 33% with our spatial-data even-sampling method, with only a slight and graceful degradation in the detection sensitivity.

Di, Sheng↗

DOE OSTI2015

An Approach to Selecting Thread + Process Mixes for Hybrid MPI + OpenMP Applications, In: 2015 IEEE International Conference on Cluster Computing

Hybrid MPI + OpenMP is a popular means of programming modern machines that feature substantial parallelism both off-node and on-node. Determining the right mix of the two programming models to use, however, is not as straightforward as simply using exclusively OpenMP on-node and limiting MPI to only inter-node communication. We present a step-by-step methodology to help make the decision of which mix of the two programming models to use. It starts with an estimate of the performance of a generic hybrid application on a given machine and incorporates additional available information about the specific application and the machine to provide guidance for selecting effective mixes of MPI processes and OpenMP threads to use when running that application on the machine in question. We validate our approach on four different applications on an IBM Blue Gene/Q, a Cray XK7, and a Cray XC30.

Computer Science↗

DOE OSTI2017

A Comprehensive Review of Permanent Magnet Transverse Flux Machines for Direct Drive Applications

The use of direct drive machines in renewable and industrial applications are increasing at a rapid rate. Transverse flux machines (TFM) are ideally suited for direct drive applications due to their high torque density. In this paper, a comprehensive review of the permanent magnet (PM) TFMs for direct drive applications is presented. The paper introduces TFMs and their operating principle and then reviews the different type of TFMs proposed in the literature. The TFMs are categorized according to the number of stator sides, types of stator cores and magnet arrangement in the rotor. The review covers different design topologies, materials used for manufacturing, structural and thermal analysis, modeling and design optimization and cogging torque minimization in TFMs. The paper also reviews various applications and comparisons for TFMs that have been presented in the literature.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2017

Developing Use Cases for Evaluation of ADMS Applications to Accelerate Technology Adoption: Preprint

Grid modernization for the distribution systems comprise of the ability to effectively monitor and manage unplanned events while ensuring reliable operations. Integration of Distributed Energy Resources (DERs) and proliferation of autonomous smart controllers like microgrids and smart inverters in the distribution networks challenge the status quo of distribution system operations. Advanced Distribution Management System (ADMS) technologies are being increasingly deployed to manage the complexities of operating distribution systems. The ability to evaluate the ADMS applications in specific utility environments and for future scenarios will accelerate wider adoption of the ADMS and will lower the risks and costs of their implementation. This paper addresses the first step - identify and define the use cases for evaluating these applications. The applications that are selected for this discussion include Volt-VAr Optimization (VVO), Fault Location Isolation and Service Restoration (FLISR), Online Power Flow (OLPF)/Distribution System State Estimation (DSSE) and Market Participation. A technical description and general operational requirements for each of these applications is presented. The test scenarios that are most relevant to the utility challenges are also addressed.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2013

SCORPIO: A scalable two-phase parallel I/O library with application to a large scale subsurface simulator

Inefficient parallel I/O is known to be a major bottleneck among scientific applications employed on supercomputers as the number of processor cores grows into the thousands. Our prior experience indicated that parallel I/O libraries such as HDF5 that rely on MPI-IO do not scale well beyond 10K processor cores, especially on parallel file systems (like Lustre) with single point of resource contention. Our previous optimization efforts for a massively parallel multi-phase and multi-component subsurface simulator (PFLOTRAN) led to a two-phase I/O approach at the application level where a set of designated processes participate in the I/O process by splitting the I/O operation into a communication phase and a disk I/O phase. The designated I/O processes are created by splitting the MPI global communicator into multiple sub-communicators. The root process in each sub-communicator is responsible for performing the I/O operations for the entire group and then distributing the data to rest of the group. This approach resulted in over 25X speedup in HDF I/O read performance and 3X speedup in write performance for PFLOTRAN at over 100K processor cores on the ORNL Jaguar supercomputer. This research describes the design and development of a general purpose parallel I/O library called Scorpio that incorporates our optimized two-phase I/O approach. The library provides a simplified higher level abstraction to the user, sitting atop existing parallel I/O libraries (such as HDF5) and implements optimized I/O access patterns that can scale on larger number of processors. Performance results with standard benchmark problems and PFLOTRAN indicate that our library is able to maintain the same speedups as before with the added flexibility of being applicable to a wider range of I/O intensive applications.

Sreepathi, Sarat↗

DOE OSTI2019

An Efficient Bayesian Method for Advancing the Application of Deep Learning in Earth Science

Despite their wide and successful applications, deep learning (DL) models are prone to overfitting for small training datasets, produce a poor predictive performance for uncertain data, and provide point estimations without any indication of the accuracy and credibility. These limitations of the deterministic DL models hinder their effective application in Earth system science where the labelled data are sparse, noisy and incomplete with large uncertainty and where the predictive uncertainty quantification is needed for scientific understanding and policy decision making. Integration of Bayesian inference into DL models adds an estimate of uncertainty and regularization in the predictions. However, traditional Bayesian methods are computationally unaffordable and inflexible for high-dimensional problems, which limits their application to DL systems that typically have millions of model parameters. In this effort, we propose an efficient and general-purpose Bayesian inference method to advance DL model optimization and uncertainty quantification, so as to facilitate the adoption of DL in Earth sciences. In a demonstration, we integrate the proposed Bayesian method with a feedforward neural network (NN) to build a fast-to-evaluate surrogate of the complex Energy Exascale Earth System Land Model for efficient modeling. The formulated Bayesian NN, using a small number of training data, produces an accurate prediction with high credibility, whereas with the same small training size, the deterministic NN cannot yield a reasonable estimation and does not provide confidence information. The proposed Bayesian method is computationally efficient and flexible, capable of integration with diverse network variants such as convolutional NNs and recurrent NNs to advance the application of DL in Earth sciences.

Lu, Dan↗

DOE OSTI2017

Control and Analysis for a Self-Excited Induction Generator for Wind Turbine and Electrolyzer Applications

Self-Excited Induction Generation(SEIG) is very rugged, simple, lightweight, and it is easy and inexpensive to implement, very simple to control, and requires a very little maintenance. In this variable-speed operation, the SEIG needs a power electronics interface to convert from the variable frequency output voltage of the generator to a DC output voltage for battery or other DC applications. In our study, a SEIG is connected to the power electronics interface such as diode rectifier and DC/DC converter and then an electrolyzer is connected as a final DC load for fuel cell applications. An equivalent circuit model for an electrolyzer is utilized for our application. The control and analysis for the proposed system is carried out by using PSCAD and MATLAB software. This study would be useful for designing and control analysis of power interface circuits for SEIG for a variable speed wind turbine generation with fuel cell applications before the actual implementation.

17 WIND ENERGY↗

DOE OSTI2013

Integrating Online Compression to Accelerate Large-Scale Data Analytics Applications

Abstract—With growing dataset sizes, and as computing cycles are increasing faster than storage and wide-area bandwidths, compression appears like a promising approach for improving the performance of large-scale data analytics applications. In this context, this paper makes the following contributions. First, we develop a new compression methodology, which exploits the similarities between spatial and/or temporal neighbors in a simulation dataset, and enables high compression ratios and low decompression costs. Second, we have developed a framework that can be used to incorporate a variety of compression and decompression algorithms. This framework also supports a simple API to allow integration with an existing application or data processing middleware. Once a compression algorithm is implemented, this framework can allow multi-threaded retrieval, multi-threaded data decompression, and use of informed prefetching and caching. By integrating this framework with a data-intensive middleware, we have applied our compression methodology and framework to three applications over two datasets, including a GCRM climate model dataset. We obtained an average compression ratio of 51.68%, and up to 53.27% improvement in execution time of data analysis applications.

Big Data, I/O, HPC↗

DOE OSTI2019

Exploring MPI Communication Models for Graph Applications Using Graph Matching as a Case Study

Traditional implementations of parallel graph operations on distributed memory platforms are written using Message Passing Interface (MPI) point to point communication primitives such as Send-Recv (blocking and nonblocking). Apart from this classical model, the MPI community has over the years added other communication models; however, their suitability for handling the irregular traffic workloads typical of graph operations remain comparatively less explored. Our aim in this paper is to study these relatively underutilized communication models of MPI for graph applications. More specifically, we evaluate MPI’s one-sided programming, or Remote Memory Access (RMA), and nearest neighborhood collectives using a process graph topology. There are features in these newer models that are intended to better map to irregular communication patterns, as exemplified in graph algorithms. As a concrete application for our case study, we use distributed memory implementations of a weighted graph matching algorithm to investigate performances of MPI-3 RMA and neighborhood collective operations compared to nonblocking Send- Recv. A matching in a graph is a subset of edges such that no two matched edges are incident on the same vertex. A maximum weight matching is a matching of maximum weight computed as the sum of the weights of matched edges. Algorithms for optimal matching have quadratic complexity and are difficult to parallelize. More importantly, execution of graph matching is dominated by high volume of irregular memory accesses, making it an ideal candidate for studying the effects of various MPI communication models on graph applications at scale. Our neighborhood collectives and RMA implementations yields up to 6× speedup over traditional optimized nonblocking Send-Recv implementations, on thousands of cores of the NERSC Cori supercomputer. We believe the lessons learned from this case study can be adopted to benefit a wider range of graph application codes.

Ghosh, Sayan↗

DOE OSTI2012

Modeling and Predicting Performance of High Performance Computing Applications on Hardware Accelerators

Computers with hardware accelerators, also referred to as hybrid-core systems, speedup applications by offloading certain compute operations that can run faster on accelerators. Thus, it is not surprising that many of top500 supercomputers use accelerators. However, in addition to procurement cost, significant programming and porting effort is required to realize the potential benefit of such accelerators. Hence, before building such a system it is prudent to answer the question 'what is the projected performance benefit from accelerators for the workloads of interest?'. We address this question by way of a performance-modeling framework that predicts realizable application performance on accelerators rapidly and accurately without going to the considerable effort of porting and tuning. The modeling framework first automatically identifies commonly found compute patterns in scientific applications which we term idioms, which may benefit by accelerator technology. Next the framework models the predicted speedup of those idioms if they were to be ported to and run on hardware accelerators. As a proof of concept we characterize two kinds of accelerators 1) the FPGA accelerators on a Convey HC-1 system and 2) an NVIDIA FERMI GPU accelerator. We model performance of the idioms gather/scatter and stream and our predictions show that where these occur in two full-scale HPC applications, Milc and HYCOM, gather/scatter speeds up by as much as 15X, and stream by as much as 14X, whereas the overall compute time of Milc improves by 3.4% and HYCOM by 20%.

Computer Science↗

DOE OSTI2013

Toward Abstracting the Communication Intent in Applications to Improve Portability and Productivity

Programming with communication libraries such as the Message Passing Interface (MPI) obscures the high-level intent of the communication in an application and makes static communication analysis difficult to do. Compilers are unaware of communication libraries' specifics, leading to the exclusion of communication patterns from any automated analysis and optimizations. To overcome this, communication patterns can be expressed at higher-levels of abstraction and incrementally added to existing MPI applications. In this paper, we propose the use of directives to clearly express the communication intent of an application in a way that is not specific to a given communication library. Our communication directives allow programmers to express communication among processes in a portable way, giving hints to the compiler on regions of computations that can be overlapped with communication and relaxing communication constraints on the ordering, completion and synchronization of the communication imposed by specific libraries such as MPI. The directives can then be translated by the compiler into message passing calls that efficiently implement the intended pattern and be targeted to multiple communication libraries. Thus far, we have used the directives to express point-to-point communication patterns in C, C++ and Fortran applications, and have translated them to MPI and SHMEM.

Mintz, Tiffany M.↗

DOE OSTI2015

Prometheus: Scalable and Accurate Emulation of Task-Based Applications on Many-Core Systems.

Modeling the performance of non-deterministic parallel applications on future many-core systems requires the development of novel simulation and emulation techniques and tools. We present “Prometheus”, a fast, accurate and modular emulation framework for task-based applications. By raising the level of abstraction and focusing on runtime synchronization, Prometheus can accurately predict applications’ performance on very large many-core systems. We validate our emulation framework against two real platforms (AMD Interlagos and Intel MIC) and report error rates generally below 4%. We, then, evaluate Prometheus’ performance and scalability: our results show that Prometheus can emulate a task-based application on a system with 512K cores in 11.5 hours. We present two test cases that show how Prometheus can be used to study the performance and behavior of systems that present some of the characteristics expected from exascale supercomputer nodes, such as active power management and processors with a high number of cores but reduced cache per core.

exascale systems↗

DOE OSTI2017

Application Modernization at LLNL and the Sierra Center of Excellence

We repport that in 2014, Lawrence Livermore National Laboratory began acquisition of Sierra, a pre-exascale system from IBM and Nvidia. It marks a significant shift in direction for LLNL by introducing the concept of heterogeneous computing via GPUs. LLNL’s mission requires application teams to prepare for this paradigm shift. Thus, the Sierra procurement required a proposed Center of Excellence that would align the expertise of the chosen vendors with laboratory personnel that represent the application developers, system software, and tool providers in a concentrated effort to prepare the laboratory’s codes in advance of the system transitioning to production in 2018. Finally, this article presents LLNL’s overall application strategy, with a focus on how LLNL is collaborating with IBM and Nvidia to ensure a successful transition of its mission-oriented applications into the exascale era.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

A Comprehensive Review of Permanent Magnet Transverse Flux Machines: Use in Direct-Drive Applications

The use of direct-drive machines in renewable and industrial applications is increasing at a rapid rate. Transverse flux machines (TFMs) are ideally suited for direct-drive applications due to their high torque density. This article presents a comprehensive review of permanent magnet (PM) TFMs for direct-drive applications. It introduces TFMs and their operating principle and reviews the different types of TFMs proposed in the literature. TFMs are categorized by the number of stator sides, types of stator cores, and magnet arrangement in the rotor. The review covers different design topologies, materials used for manufacturing, structural and thermal analyses, modeling, design optimization, and cogging torque minimization in TFMs. The article also examines various applications and comparisons for TFMs presented in the literature.

air gaps↗

DOE OSTI2022

Seamless Wireless Communication Platform for Internet of Things Applications

The rapid growth of the Internet of Things (IoT) devices resulted in the proliferation of wireless technologies to cater to their increasing data rate requirements and support multiple applications. However, such ever-increasing wireless technologies present numerous challenges such as incompatible wireless standards, increased energy consumption, and insecure communication. The traditional gateways proposed in the literature suffers from limitations such as computational complexity, resource requirements, increased cost, and device size. We vision an era of seamless wireless communication to alleviate the aforementioned challenges in IoT applications. through three inter-dependent functionalities namely detection and identification of wireless technologies, energy-efficient transmit power control, and secure end-to-end communication. To prove the concept, a new gateway is proposed to achieve these three functionalities with only physical layer measurements so that the different communication protocols in the higher layers can be avoided. Novel schemes are conceptualized for resource-limited seamless IoT applications. Moreover, the conceptual seamless IoT platform is validated through software-based computer simulation and software-defined radio-based testbed implementation. Finally, the preliminary analysis demonstrates that the proposed platform has great potential in advancing seamless IoT applications.

97 MATHEMATICS AND COMPUTING↗