Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Automatic”

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 649 records · Page 36

Automatic Cloud Bursting under FermiCloud

Cloud computing is changing the infrastructure upon which scientific computing depends from supercomputers and distributed computing clusters to a more elastic cloud-based structure. The service-oriented focus and elasticity of clouds can not only facilitate technology needs of emerging business but also shorten response time and reduce operational costs of traditional scientific applications. Fermi National Accelerator Laboratory (Fermilab) is currently in the process of building its own private cloud, FermiCloud, which allows the existing grid infrastructure to use dynamically provisioned resources on FermiCloud to accommodate increased but dynamic computation demand from scientists in the domains of High Energy Physics (HEP) and other research areas. Cloud infrastructure also allows to increase a private cloud’s resource capacity through “bursting” by borrowing or renting resources from other community or commercial clouds when needed. This paper introduces a joint project on building a cloud federation to support HEP applications between Fermi National Accelerator Laboratory and Korea Institution of Science and Technology Information, with technical contributions from the Illinois Institute of Technology. In particular, this paper presents two recent accomplishments of the joint project: (a) cloud bursting automation and (b) load balancer. Automatic cloud bursting allows computer resources to be dynamically reconfigured to meet users’ demands. The load balance algorithm which the cloud bursting depends on decides when and where new resources need to be allocated. Our preliminary prototyping and experiments have shown promising success, yet, they also have opened new challenges to be studied

Wu, Hao↗

Data Jockey: Automatic Data Management for HPC Multi-Tiered Storage Systems

We present the design and implementation of Data Jockey, a data management system for HPC multi-tiered storage systems. As a centralized data management control plane, Data Jockey automates bulk data movement and placement for scientific workflows and integrates into existing HPC storage infrastructures. Data Jockey simplifies data management by eliminating human effort in programming complex data movements, laying datasets across multiple storage tiers when supporting complex workflows, which in turn increases the usability of multitiered storage systems emerging in modern HPC data centers.Specifically, Data Jockey presents a new data management scheme called “goal driven data management” that can automatically infer low-level bulk data movement plans from declarative high-level goal statements that come from the lifetime of iterative runs of scientific workflows. While doing so, Data Jockey aims to minimize data wait times by taking responsibility for datasets that are unused or to be used, and aggressively utilizing the capacity of the upper, higher performant storage tiers.We evaluated a prototype implementation of Data Jockey under a synthetic workload based on a year’s worth of Oak Ridge Leadership Computing Facility’s (OLCF) operational logs. Our evaluations suggest that Data Jockey leads to higher utilization of the upper storage tiers while minimizing the programming effort of data movement compared to human involved, per-domain adhoc data management scripts.

Shin, Woong↗

Union: An Automatic Workload Manager for Accelerating Network Simulation

With the rapid growth of the machine learning applications, the workloads of future HPC systems are anticipated to be a mix of scientific simulation, big data analytics, and machine learning applications. Simulation is a great research vehicle to understand the performance implications of co-running scientific applications with big data and machine learning workloads on large-scale systems. In this paper, we present Union, a workload manager that provides an automatic framework to facilitate hybrid workload simulation in CODES. Furthermore, we use Union, along with CODES, to investigate various hybrid workloads composed of traditional simulation applications and emerging learning applications on two dragonfly systems. The experiment results show that both message latency and communication time are important performance metrics to evaluate network interference. Network interference on HPC applications is more reflected by the message latency variation, whereas ML application performance depends more on the communication time.

heterogeneous workloads↗

Automatic Extraction of Network Configurations for Realistic Simulation and Validation

Popular HPC network interconnection simulators such as SST Macro provide a variety of configurable parameters to explore the design space of hardware components such as network links and switches. While such knobs provide flexibility to explore design trade-offs for novel hardware, manually configuring simulations for existing hardware to focus on topology exploration can be cumbersome and error-prone, leading to widely inaccurate simulations. This challenge is compounded when specifications of various (proprietary) technologies are not readily available or are intentionally omitted. In this work, we provide a methodology to automatically tune the simulation configuration of the multiple network models running within SST Macro using Bayesian optimization. We perform this optimization in the context of multiple messaging regimes (i.e., small to large and latency to bandwidth-bound messages) and provide a detailed analysis of the simulation error for four systems. With our automated framework, we achieve a 5x improvement in accuracy over best-effort configurations based on available hardware specifications.

Suetterlein, Joshua D.↗

Automatic Code Generation for High-Performance Graph Algorithms

Graph problems are common across fields of scientific computing and social sciences. However, despite their importance, implementing graph algorithms effectively on modern computing systems is a challenging task that requires significant programming effort and generally results in customized implementations. Current computing and memory hierarchies are not architected for irregular computations resulting in challenges for graph algorithms to achieve high performance on those architectures. In this paper, we present GraphX, a novel compiler framework and DSL designed to simplify the development of efficient graph algorithms and achieve high performance on modern computing systems. GraphX consists of a DSL for efficient implementation of graph algorithms, various optimizations, such as support for sparse linear algebra and workspace transformations, optimized graph primitives, including semiring and masking, and a high-performance code generation engine. Using GraphX, users can implement graph algorithms using a semantically-rich language with graph-oriented operators. GraphX uses these semantics to automatically generate efficient code for target architectures, increasing performance and portability across architectures. The composable nature of GraphX makes it possible to extend the set of optimizations and architectures without modifying the source code. We demonstrate GraphX outperforms state-of-the-art graph libraries, such as LAGraph, up to $3.7 speedup in semiring operations, $2.19 speedup in an important sparse computational kernel, and $9.05 speedup in graph processing algorithms.

compiler, graph algorithms, semiring, masking, wor↗

Automatic Implementation of Prony Analysis for Electromechanical Mode Identification from Phasor Measurements

Small signal stability problems are one of the major threats to grid stability and reliability. Prony analysis has been successfully applied on ringdown data to monitor electromechanical modes of a power system using phasor measurement unit (PMU) data. To facilitate an on-line application of mode estimation, this paper developed a recursive algorithm for implementing Prony analysis and proposed an oscillation detection method to detect ringdown data in real time. By automatically detect ringdown data, the proposed method helps guarantee that Prony analysis is applied properly and timely on the ringdown data. Thus, the mode estimation results can be performed reliably and timely. The proposed method is tested using Monte Carlo simulations based on a 17-machine model and is shown to be able to properly identify the oscillation data for on-line application of Prony analysis.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Automatic Detection and Evaluation of Solar Cell Micro-Cracks in Electroluminescence Images Using Matched Filters

A method for detecting micro-cracks in solar cells using two dimensional matched filters was developed, derived from the electroluminescence intensity profile of typical micro-cracks. We describe the image processing steps to obtain a binary map with the location of the micro-cracks. Finally, we show how to automatically estimate the total length of each micro-crack from these maps, and propose a method to identify severe types of micro-cracks, such as parallel, dendritic, and cracks with multiple orientations. With an optimized threshold parameter, the technique detects over 90 % of cracks larger than 3 cm in length. The method shows great potential for quantifying micro-crack damage after manufacturing or module transportation for the determination of a module quality criterion for cell cracking in photovoltaic modules.

14 SOLAR ENERGY↗

AutoCheck: Automatically Identifying Variables for Checkpointing by Data Dependency Analysis

Checkpoint/Restart (C/R) has been widely deployed in numerous HPC systems, Clouds, and industrial data centers, which are typically operated by system engineers. Nevertheless, there is no existing approach that helps system engineers without domain expertise and domain scientists without system fault tolerance knowledge identify those critical variables accounted for correct application execution restoration in a failure for C/R. To address this problem, we propose an analytical model and a tool (AutoCheck) that can automatically identify critical variables to checkpoint for C/R. AutoCheck relies on first, analytically tracking and optimizing data dependency between variables and other application execution state, and second, a set of heuristics that identify critical variables for checkpointing from the refined data dependency graph (DDG). AutoCheck allows programmers to pinpoint critical variables to checkpoint quickly within a few minutes. We evaluate AutoCheck on 13 representative HPC benchmarks, demonstrating that AutoCheck can efficiently identify correct critical variables to checkpoint.

HPC↗

Scrutinizing Variables for Checkpoint Using Automatic Differentiation

Checkpoint/Restart (C/R) saves the running state of the programs periodically, which consumes considerable time and system resources. We observe that not every piece of data is involved in the computation in typical HPC applications; such unused data should be excluded from checkpointing for better storage and compute efficiency. We propose a systematic approach that leverages automatic differentiation (AD) to scrutinize every element within variables (e.g., arrays) necessary for checkpointing. This allows us to identify critical and uncritical elements and eliminate uncritical elements from checkpointing. Specifically, we inspect every single element within a variable necessary for checkpointing with an AD tool to determine whether the element has an impact on the application output or not. We validate our approach with all benchmarks from the NPB suite. We visualize the distribution of critical and uncritical elements within a variable with respect to its binary impact (yes or no) on the application output.

Huang, Xin [Kobe University]↗

An Automatic Processing Framework for In Situ Determination of Ecohydrological Root Water Content by Ground-Penetrating Radar

This report concerns Root water content (RWC) as a vital component in water flux in soil-plant-atmosphere continuum. Knowledge of RWC helps to better understand the root function and the soil-root interaction and improves water cycle modeling. However, due to the lack of appropriate methods, field monitoring of RWC is seriously constrained. In this study, we used ground-penetrating radar (GPR), a common geophysical technique, to characterize RWC of coarse roots noninvasively. An automatic GPR data processing framework was proposed to (1) identify hyperbolic root reflections and locate roots in GPR images and (2) extract waveform parameters from the reflected wave of identified roots. These waveform parameters were then used to establish an empirical model and a semiempirical model to determine RWC. We validated the developed models using GPR root data at three antenna center frequencies (500 MHz, 900 MHz, and 2 GHz) that were produced from simulation experiments (with RWC ranging from 70% to 150%) and field experiments in sandy soils (with RWC ranging from 66% to 144%). Our results show that both the empirical and the semiempirical models achieved a good performance in estimating RWC with similar accuracy, i.e., the prediction error [root-mean-square error (RMSE)] was less than 8% for the simulation data and 12% for the field data. For both models, the accuracy of RWC estimation was the highest when applied to 2-GHz data. This study renders a new opportunity to determine RWC under field conditions that enhances the application of GPR for root study and the understanding and modeling of ecohydrology in the rhizosphere.

54 ENVIRONMENTAL SCIENCES↗

Automatic Attribute Profiles

Morphological attribute profiles are multilevel decompositions of images obtained with a sequence of transformations performed by connected operators. They have been extensively employed in performing multi-scale and region-based analysis in a large number of applications. One main, still unresolved, issue is the selection of filter parameters able to provide representative and non-redundant threshold decomposition of the image. This paper presents a framework for the automatic selection of filter thresholds based on Granulometric Characteristic Functions (GCFs). GCFs describe the way that non-linear morphological filters simplify a scene according to a given measure. Since attribute filters rely on a hierarchical representation of an image (e.g., the Tree of Shapes) for their implementation, GCFs can be efficiently computed by taking advantage of the tree representation. Eventually, the study of the GCFs allows the identification of a meaningful set of thresholds. Therefore, a trial and error approach is not necessary for the threshold selection, automating the process and in turn decreasing the computational time. It is shown that the redundant information is reduced within the resulting profiles (a problem of high occurrence, as regards manual selection). The proposed approach is tested on two real remote sensing data sets, and the classification results are compared with strategies present in the literature.

97 MATHEMATICS AND COMPUTING↗

Automatic Generation of High-Performance Convolution Kernels on ARM CPUs for Deep Learning

In this work, we present FastConv, a template-based code auto-generation open source library that can automatically generate high-performance deep learning convolution kernels of arbitrary matrices/tensors shapes. FastConv is based on the Winograd algorithm, which is reportedly the highest performing algorithm for the time-consuming convolution layers of convolutional neural networks. ARM CPUs cover a wide range designs and specifications, from embedded devices to HPC-grade CPUs. The leads to the dilemma of how to consistently optimize Winograd-based convolution solvers for convolution layers of different shapes. FastConv addresses this problem by using templates to auto-generate multiple shapes of tuned kernels variants suitable for skinny tall matrices. As a performance portable library, FastConv transparently searches for the best combination of kernel shapes, cache tiles, scheduling of loop orders, packing strategies, access patterns, and online/offline computations. Auto-tuning is used to search the parameter configuration space for the best performance for a given target architecture and problem size. The experiments with layer-wise evaluation on the VGG--16 model confirms a 1.25x performance gains is got by tuning the Winograd library. Integrated comparison results shows 1.02x to 1.40x, 1.14x to 2.17x, and 1.22x and 2.48x speedup is achieved over NNPACK, Arm NN, and FeatherCNN on the Kunpeng 920 beside few cases. Furthermore, problem size performance portability experiments with various convolution shapes shows that FastConv achieves 1.2x to 1.7x speedup and 2x to 22x speedup over NNPACK and ARM NN inference engine using Winograd on Kunpeng 920 . CPU performance portability evaluation on the VGG--16 show an average speedup over NNPACK of 1.42x, 1.21x, 1.26x, 1.37x, 2.26x, and 11.02x is observed on Kunpeng 920, Snapdragon 835, 855, 888, Apple M1, and AWS Graviton2, respectively.

97 MATHEMATICS AND COMPUTING↗

Automatic Layout Design for Power Module

The layout of power modules is one of the key points in power module design, especially for high power densities, where couplings are increased. In this paper, along with the design example, an automatic design processes by using a genetic algorithm are presented. Some practical considerations and implementations are introduced in the optimization of module layout design.

42 ENGINEERING↗

Microgrid Service Restoration Incorporating Unmonitored Automatic Voltage Controllers and Net Metered Loads

Islanded microgrids may experience voltage and frequency instability due to uncontrolled state changes of voltage regulation devices and inaccurate demand forecasts. Uncontrolled state changes can occur if optimal microgrid restoration and dispatch algorithms, used for generating control commands for distributed energy resources, do not incorporate the behavior of automatic controllers of voltage regulation devices. Inaccurate demand forecasts may be encountered since post-outage demand of behind-the-meter net metered (NM) loads can vary significantly from their historical NM profiles. Here, this paper proposes an optimization formulation which allows optimal control of voltage regulators and capacitor banks without remote control and communication capabilities. A generalized demand model for NM loads is proposed which incorporates the cold load pickup phenomenon and their time varying post-outage demand in accordance with the IEEE 1547 standard. The time dependent optimal control formulation and the NM demand model are integrated in a sequential microgrid restoration algorithm by linearization of the involved logic propositions. A detailed case study on the unbalanced IEEE 123-node test system in OpenDSS validates the effectiveness of the proposed approach.

30 DIRECT ENERGY CONVERSION↗

A new generic method for the semi-automatic extraction of river and road networks in low and mid-resolution satellite images

This paper addresses the problem of semi-automatic extraction of road or hydrographic networks in satellite images. For that purpose, we propose an approach combining concepts arising from mathematical morphology and hydrology. The method exploits both geometrical and topological characteristics of rivers/roads and their tributaries in order to reconstruct the complete networks. It assumes that the images satisfy the following two general assumptions, which are the minimum conditions for a road/river network to be identifiable and are usually verified in low- to mid-resolution satellite images: (i) visual constraint: most pixels composing the network have similar spectral signature that is distinguishable from most of the surrounding areas; (ii) geometric constraint: a line is a region that is relatively long and narrow, compared with other objects in the image. While this approach fully exploits local (roads/rivers are modeled as elongated regions with a smooth spectral signature in the image and a maximum width) and global (they are structured like a tree) characteristics of the networks, further directional information about the image structures is incorporated. Namely, an appropriate anisotropic metric is designed by using both the characteristic features of the target network and the eigen-decomposition of the gradient structure tensor of the image. Following, the geodesic propagation from a given network seed with this metric is combined with hydrological operators for overland flow simulation to extract the paths which contain most line evidence and identify them with the target network.

47 OTHER INSTRUMENTATION↗

Automatic exposure control in pediatric and adult multidetector CT examinations: A phantom study on dose reduction and image quality

The aim of this study was to assess the potential of a modern x,y,z modulation-based automatic exposure control system (AEC) for dose reduction in pediatric and adult multidetector CT (MDCT) imaging and evaluate the quality of the images obtained. Five physical anthropomorphic phantoms that simulate the average individual as neonate, 1-, 5-, 10-year old child, and adult were scanned with a MDCT scanner, equipped with a modern AEC system. Dose reduction (%DR) was calculated as the percentage difference of the mean modulated and the preset tube current-time product that is prescribed for standard head and body scan protocols. The effect of the tube potential and the orientation of the topogram acquisition on dose reduction were assessed. Image quality was evaluated on the basis of image noise and signal to noise ratio (SNR). The dose reduction values achieved in pediatric phantoms were remarkably lower than those achieved for the adult. The efficiency of the AEC is decreased at 80 kVp compared to higher tube potentials and for helical scans following an anterior posterior (AP-AEC) compared to a lateral (LAT-AEC) topogram acquisition. In AP-AEC scans, the dose reduction ranged between 4.7 and 34.7% for neonate, 15.4 and 30.9% for 1 year old, 3.1 and 26.7% for 5 years old, 1.2 and 58.7% for 10 years old, and 15.5 and 57.4% for adult. In LAT-AEC scans, the corresponding dose reduction ranged between 11.0 and 36.5%, 27.2 and 35.7%, 11.3 and 35.6%, 0.3 and 67.0%, and 15.0 and 61.7%, respectively. AP-AEC scans resulted in a 17.1% and 19.7% dose increase in the thorax of neonate and the pelvis of the 10-year old phantom, respectively. The variation in the measured noise among images obtained along the scanning z axis was lower in AEC activated compared to fixed milliamperes scans. However, image noise was significantly increased (P<.001) and SNR significantly decreased (P<.001) in most AEC activated compared to fixed milliamperes scans. In conclusion, AEC resulted in a (i) substantial dose reduction, which is less pronounced in children compared to adult, (ii) higher dose reduction in scans following a lateral compared to scans following an anterior-posterior topogram acquisition, (iii) increase of image noise and degradation of SNR in the obtained images compared to the fixed milliamperes technique.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Operation logic and functionality of automatic dose rate and image quality control of conventional fluoroscopy

New generation of fluoroscopic imaging systems is equipped with spectral shaping filters complemented with sophisticated automatic dose rate and image quality control logic called ''fluoroscopy curve'' or ''trajectory''. Such fluoroscopy curves were implemented first on cardiovascular angiographic imaging systems and are now available on conventional fluoroscopy equipment. This study aims to investigate the control logic operations under the fluoroscopy mode and acquisition mode (equivalent to the legacy spot filming) of a conventional fluoroscopy system typically installed for upper-lower gastrointestinal examinations, interventional endoscopy laboratories, gastrointestinal laboratory, and pain clinics.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Automatic lung segmentation from thoracic computed tomography scans using a hybrid approach with error detection

Lung segmentation is a prerequisite for automated analysis of chest CT scans. Conventional lung segmentation methods rely on large attenuation differences between lung parenchyma and surrounding tissue. These methods fail in scans where dense abnormalities are present, which often occurs in clinical data. Some methods to handle these situations have been proposed, but they are too time consuming or too specialized to be used in clinical practice. In this article, a new hybrid lung segmentation method is presented that automatically detects failures of a conventional algorithm and, when needed, resorts to a more complex algorithm, which is expected to produce better results in abnormal cases. In a large quantitative evaluation on a database of 150 scans from different sources, the hybrid method is shown to perform substantially better than a conventional approach at a relatively low increase in computational cost.

62 RADIOLOGY AND NUCLEAR MEDICINE↗