SEARCH · Engineering Papers

Results for “Multidimensional”

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 865 records · Page 48

All sources NASA NTRS DOE OSTI

DOE OSTI2019

Combining Tensor Decompositions and Graph Analytics to Provide Cyber Situational Awareness at HPC Scale

This paper describes MADHAT (Multidimensional Anomaly Detection fusing HPC, Analytics, and Tensors), an integrated workflow that demonstrates the applicability of HPC resources to the problem of maintaining cyber situational awareness. MADHAT combines two high-performance packages: ENSIGN for large-scale sparse tensor decompositions and HAGGLE for graph analytics. Tensor decompositions isolate coherent patterns of network behavior in ways that common clustering methods based on distance metrics cannot. Parallelized graph analysis then uses directed queries on a representation that combines the elements of identified patterns with other available information (such as additional log fields, domain knowledge, network topology, whitelists and blacklists, prior feedback, and published alerts) to confirm or reject a threat hypothesis, collect context, and raise alerts. MADHAT was developed using the collaborative HPC Architecture for Cyber Situational Awareness (HACSAW) research environment and evaluated on structured network sensor logs collected from Defense Research and Engineering Network (DREN) sites using HPC resources at the U.S. Army Engineer Research and Development Center DoD Supercomputing Resource Center (ERDC DSRC). To date, MADHAT has analyzed logs with over 650 million entries.

Cyber security, Tensor decomposition, graph analyt↗

DOE OSTI2017

An approach to online network monitoring using clustered patterns

Network traffic monitoring is a core element in network operations and management for various purposes such as anomaly detection, change detection, and fault/failure detection. In this study, we introduce a new approach to online monitoring using a pattern-based representation of the network traffic. Unlike the past online techniques limited to a single variable to summarize (e.g., sketch), the focus of this study is on capturing the network state from the multivariate attributes under consideration. To this end, we employ clustering with its benefit of the aggregation of multidimensional variables. The clustered result represents the state of the network with regard to the monitored variables, which can also be compared with the previously observed patterns visually and quantitatively. Finally, we demonstrate the proposed method with two popular use cases, one for estimating state changes and the other for identifying anomalous states, to confirm its feasibility.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

ROBIN (RuciO/BIgData Express/SENSE) A Next-Generation High-Performance Data Service Platform

Increasingly, scientific research discoverydepends on the analysis of extremely large amounts of data. Thisdata is gathered through very large scientific instruments, verylarge numbers of small devices, and mid-scale instruments.These devices generate exponentially increasing volumes of data.Such data is often obtained, analyzed, stored, visualized, andtransferred at and among sites world-wide by largecollaborations of science communities. Managing and movingextremely large volumes of data across today’s networks is aspecial multidimensional challenge. Also, existing datamanagement and movement services and tools often areinadequate to address all specific requirements. This paperdescribes the various components of this challenge and howthose issues can be addressed by ROBIN, a uniquecomprehensive set of integrated services designed specificallyfor managing and moving extremely large amounts of data overlong distances, e.g., thousands of miles around the globe. Thispaper also describes the results of initial experiments using thatset of integrated services.

Wu, Wenji↗

DOE OSTI2014

UPC++: A PGAS extension for C++

Partitioned Global Address Space (PGAS) languages are convenient for expressing algorithms with large, random-access data, and they have proven to provide high performance and scalability through lightweight one-sided communication and locality control. While very convenient for moving data around the system, PGAS languages have taken different views on the model of computation, with the static Single Program Multiple Data (SPMD) model providing the best scalability. In this paper we present UPC++, a PGAS extension for C++ that has three main objectives: 1) to provide an object-oriented PGAS programming model in the context of the popular C++ language, 2) to add useful parallel programming idioms unavailable in UPC, such as asynchronous remote function invocation and multidimensional arrays, to support complex scientific applications, 3) to offer an easy on-ramp to PGAS programming through interoperability with other existing parallel programming systems (e.g., MPI, OpenMP, CUDA). We implement UPC++ with a 'compiler-free' approach using C++ templates and runtime libraries. We borrow heavily from previous PGAS languages and describe the design decisions that led to this particular set of language features, providing significantly more expressiveness than UPC with very similar performance characteristics. We evaluate the programmability and performance of UPC++ using five benchmarks on two representative supercomputers, demonstrating that UPC++ can deliver excellent performance at large scale up to 32K cores while offering PGAS productivity features to C++ applications.

Zheng, Y↗

DOE OSTI2016

A Hartree-Fock Application Using UPC++ and the New DArray Library

The Hartree-Fock (HF) method is the fundamental first step for incorporating quantum mechanics into many-electron simulations of atoms and molecules, and it is an important component of computational chemistry toolkits like NWChem. The GTFock code is an HF implementation that, while it does not have all the features in NWChem, represents crucial algorithmic advances that reduce communication and improve load balance by doing an up-front static partitioning of tasks, followed by work stealing whenever necessary. To enable innovations in algorithms and exploit next generation exascale systems, it is crucial to support quantum chemistry codes using expressive and convenient programming models and runtime systems that are also efficient and scalable. Here, this paper presents an HF implementation similar to GTFock using UPC++, a partitioned global address space model that includes flexible communication, asynchronous remote computation, and a powerful multidimensional array library. UPC++ offers runtime features that are useful for HF such as active messages, a rich calculus for array operations, hardware-supported fetch-and-add, and functions for ensuring asynchronous runtime progress. We present a new distributed array abstraction, DArray, that is convenient for the kinds of random-access array updates and linear algebra operations on block-distributed arrays with irregular data ownership. Finally, we analyze the performance of atomic fetch-and-add operations (relevant for load balancing) and runtime attentiveness, then compare various techniques and optimizations for each. Our optimized implementation of HF using UPC++ and the DArrays library shows up to 20% improvement over GTFock with Global Arrays at scales up to 24,000 cores.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

SeekAView: An Intelligent Dimensionality Reduction Strategy for Navigating High-Dimensional Data Spaces

Dealing with the curse of dimensionality is a key challenge in high-dimensional data visualization. We present SeekAView to address three main gaps in the existing research literature. First, automated methods like dimensionality reduction or clustering suffer from a lack of transparency in letting analysts interact with their outputs in real-time to suit their exploration strategies. The results often suffer from a lack of interpretability, especially for domain experts not trained in statistics and machine learning. Second, exploratory visualization techniques like scatter plots or parallel coordinates suffer from a lack of visual scalability: it is difficult to present a coherent overview of interesting combinations of dimensions. Third, the existing techniques do not provide a flexible workflow that allows for multiple perspectives into the analysis process by automatically detecting and suggesting potentially interesting subspaces. In SeekAView we address these issues using suggestion based visual exploration of interesting patterns for building and refining multidimensional subspaces. Compared to the state-of-the-art in subspace search and visualization methods, we achieve higher transparency in showing not only the results of the algorithms, but also interesting dimensions calibrated against different metrics. We integrate a visually scalable design space with an iterative workflow guiding the analysts by choosing the starting points and letting them slice and dice through the data to find interesting subspaces and detect correlations, clusters, and outliers. We present two usage scenarios for demonstrating how SeekAView can be applied in real-world data analysis scenarios.

Krause, Josua↗

DOE OSTI2022

Hands-On Computer Science: The Array of Things Experimental Urban Instrument

Chicago's Array of Things (AoT) project is aptly described as a technology experiment or a "smart city" prototype. The concept of such an extensible "instrument" arose within a larger translational research vision applying computer science and engineering research for the multidimensional benefit of people and communities in cities. The AoT project hypothesized that wireless intelligent sensor networks could enable both quantitative social science and urban monitoring while also stimulating youth interest in science and technology. Successful deployment of such sensor networks could provide open data from urban measurements not only in support of diverse research questions-in environmental dynamics, urban architecture, engineering, and social sciences-but also informing community groups and city planners. Further, the AoT project and its successor SAGE project are a computer science and engineering experiment, but its success is inextricably tied to community engagement and experiential education. Simply put, community acceptance is a prerequisite to installing and testing the instrument.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2013

DynaM: Dynamic Multiresolution Data Representation for Large-Scale Scientific Analysis

Fast growing large-scale systems enable scientific applications to run at a much larger scale and accordingly produce gigantic volumes of simulation output. Such data imposes a grand challenge to post-processing tasks such as visualization and data analysis, because these tasks are often performed at a host machine that is remotely located and equipped with much less memory and storage resources. During the simulation runs, it is also desirable for scientists to be able to interactively monitor and steer the progress of simulation. This requires scientific data to be represented in an efficient form for initial exploration and computation steering. In this paper, we propose DynaM a software framework that can represent scientific data in a multiresolution form, and dynamically organize data blocks into an optimized layout for efficient scientific analysis. DynaM supports a convolution-based multiresolution data representation for abstracting scientific data for visualization at a wide spectrum of resolution. To support the efficient generation and retrieval of different data granularities from such representation, a dynamic data organization in DynaM is enabled to cater distinct peculiarities of different size data blocks for efficient and balanced I/O performance. Our experimental results demonstrate that DynaM can efficiently represent large scientific dataset and speed up the visualization of multidimensional scientific data. An up to 29 times speedup is achieved on Jaguar supercomputer at Oak Ridge National Laboratory.

Tian, Yuan↗

DOE OSTI2016

Rethinking Sensitivity Analysis of Nuclear Simulations with Topology

In nuclear engineering, understanding the safety margins of the nuclear reactor via simulations is arguably of paramount importance in predicting and preventing nuclear accidents. It is therefore crucial to perform sensitivity analysis to understand how changes in the model inputs affect the outputs. Modern nuclear simulation tools rely on numerical representations of the sensitivity information -- inherently lacking in visual encodings -- offering limited effectiveness in communicating and exploring the generated data. In this paper, we design a framework for sensitivity analysis and visualization of multidimensional nuclear simulation data using partition-based, topology-inspired regression models and report on its efficacy. We rely on the established Morse-Smale regression technique, which allows us to partition the domain into monotonic regions where easily interpretable linear models can be used to assess the influence of inputs on the output variability. The underlying computation is augmented with an intuitive and interactive visual design to effectively communicate sensitivity information to the nuclear scientists. Our framework is being deployed into the multi-purpose probabilistic risk assessment and uncertainty quantification framework RAVEN (Reactor Analysis and Virtual Control Environment). We evaluate our framework using an simulation dataset studying nuclear fuel performance.

computational topology↗

DOE OSTI2023

A PEPS Plugin for TNQVM

This work introduces an extension to the Tensor Network Quantum Virtual Machine (TNQVM) tool, enhancing the existing stack of ExaScale Tensor Network (ExaTN), ExaScale Accelerator (XACC), and TNQVM. It features a new plugin that enables efficient simulation of a Projected Entangled Pair State (PEPS), a 2D tensor network. To improve simulation efficiency for PEPS, we have implemented the snake boundary contraction algorithm. By integrating this capability into the existing stack, we enhance the overall functionality and versatility of the framework. We tested this new PEPS topology for a simple GHZ bell-pair generation quantum circuit and saw that its runtime is very close to that of the MPS topology. We estimate that the real potential of the PEPS topology becomes discernible when quantum circuits with multidimensional entanglement are simulated using tensor networks. In such cases, 1D tensor networks fail to represent or contract them efficiently.

Chundury, Srikar↗

DOE OSTI2024

OpenACC offloading of the MFC compressible multiphase flow solver on AMD and NVIDIA GPUs

GPUs are the heart of the latest generations of supercomputers. We efficiently accelerate a compressible multiphase flow solver via OpenACC on NVIDIA and AMD Instinct GPUs. Optimization is accomplished by specifying the directive clauses gang vector and collapse. Further speedups of six and ten times are achieved by packing user-defined types into coalesced multidimensional arrays and manual inlining via metaprogramming. Additional optimizations yield seven-times speedup of array packing and thirty-times speedup of select kernels on Frontier. Weak scaling efficiencies of 97% and 95% are observed when scaling to 50% of Summit and 87% of Frontier. Strong scaling efficiencies of 84% and 81% are observed when increasing the device count by a factor of 8 and 16 on V100 and MI250X hardware. The strong scaling efficiency of AMD’s MI250X increases to 92% when increasing the device count by a factor of 16 when GPU-aware MPI is used for communication.

Wilfong, Benjamin↗

DOE OSTI2014

On the Configuration of the US Western Interconnection Voltage Stability Boundary

Abstract—Stability limits are considered in power system planning and operations to estimate the available stability margins and, if possible, to maximize the utilization of transmission facilities. These important tasks are influenced by configuration of the stability boundary. The paper introduces a new fast approach to explore the voltage stability boundary of a large system and reveal its detailed multidimensional structure. The 17939-bus U.S. Western Interconnection planning model was used to illustrate the method. Significant peculiarities of the boundary’s configuration were identified, including its nonconvexity, discontinuity, branching and internal singularities (“holes”) that were not known before and could not been found by traditional methods. Experiments using WECC system are performed to evaluate the computation time using different methods. Our results show that the proposed methods are very promising in reducing calculation time and complexity

Makarov, Yuri V.↗

DOE OSTI2020

Improving the Performance of Integrated Power-Hardware-in-the-Loop and Quasi-Static Time-Series Simulations

This paper introduces a novel multirate cosimulation architecture that overcomes previous challenges integrating faster real-time, microseconds-scale, power-hardware-in-the-loop (PHIL) with larger scale but slower, real-time, seconds-scale, quasi-static time-series (QSTS) simulation. Specifically, an intermediate reduced-equivalent electromagnetic transient (EMT) model duplicates the key power system topology to capture high-speed dynamics and converge hardware-power system interactions between QSTS updates. Exchanging multidimensional parameter vectors (loads, control status, etc.) between the QSTS and EMT models enables capturing the interactions of the rich, high-node-count (thousands of electrical nodes) QSTS model with the hardware. This architecture offers full spatial resolution from QSTS, including individual load dynamics, actual distribution management system controls, and nodal voltages. Simultaneously, the intermediate EMT model provides more detailed high-speed transients of key distributed energy resource hardware interactions. In addition, we use careful PHIL interface design and the exchange of complex power data, rather than current, to further improve performance. This cosimulation architecture is demonstrated by testing a simulated distribution system with an interconnected 500-kVA advanced photovoltaic (PV) inverter in PHIL. In conclusion, the architecture successfully captured PV local volt-volt ampere reactive (volt-VAR) control interactions with the larger network under time-varying electrical and weather conditions.

42 ENGINEERING↗

DOE OSTI2015

Multi-jagged: A scalable parallel spatial partitioning algorithm

Geometric partitioning is fast and effective for load-balancing dynamic applications, particularly those requiring geometric locality of data (particle methods, crash simulations). We present, to our knowledge, the first parallel implementation of a multidimensional-jagged geometric partitioner. In contrast to the traditional recursive coordinate bisection algorithm (RCB), which recursively bisects subdomains perpendicular to their longest dimension until the desired number of parts is obtained, our algorithm does recursive multi-section with a given number of parts in each dimension. By computing multiple cut lines concurrently and intelligently deciding when to migrate data while computing the partition, we minimize data movement compared to efficient implementations of recursive bisection. We demonstrate the algorithm's scalability and quality relative to the RCB implementation in Zoltan on both real and synthetic datasets. Our experiments show that the proposed algorithm performs and scales better than RCB in terms of run-time without degrading the load balance. Lastly, our implementation partitions 24 billion points into 65,536 parts within a few seconds and exhibits near perfect weak scaling up to 6K cores.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Ion Number Density Quantification Utilizing Pulsing Frequency in Negative Differential Resistance (NDR) Regime of Microplasma Operation

A mathematical model is presented for quantifying the ion number density over a range of discharge current in microplasma discharges. The ion number density is determined from measured discharge voltage, current, pulsing frequency, and trace impurity that is injected into the system deliberately. Experiments are conducted in pure helium with nitrogen being introduced as the trace species. The ion number density is estimated over a range of discharge current and is compared with multidimensional simulation results.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2012

The Characteristic Ellipsoid Methodology and Its Application in Power Systems

The characteristic ellipsoid (CELL) method to monitor dynamic behaviors of a power system is proposed. Multidimensional minimum-volume-enclosing characteristic ellipsoids are built using synchronized phasor measurements. System dynamic behaviors are identified by tracking the change rate of the CELL’s characteristic indices. Decision tree techniques are used to link the CELL’s characteristic indices and the system’s dynamic behaviors and to determine types, locations and related information about the dynamic behaviors. The knowledge base of representative transient events is created by offline simulations based on the full Western Electric Coordinating Council (WECC) model. Two case studies demonstrate that the CELL method combined with the decision trees can detect transient events and their features with good accuracy.

Characteristic ellipsoid, decision tree, event det↗

DOE OSTI2018

A Framework for Robust Long-Term Voltage Stability of Distribution Systems

Power injection uncertainties in distribution power grids, which are mostly induced by aggressive introduction of intermittent renewable sources, may drive the system away from normal operating regimes and potentially lead to the loss of long-term voltage stability (LTVS). Naturally, there is an ever increasing need for a tool for assessing the LTVS of a distribution system. This paper presents a fast and reliable tool for constructing inner approximations of LTVS regions in multidimensional injection space such that every point in our constructed region is guaranteed to be solvable. Numerical simulations demonstrate that our approach outperforms all existing inner approximation methods in most cases. Furthermore, the constructed regions are shown to cover substantial fractions of the true voltage stability region. In conclusion, the paper will later discuss a number of important applications of the proposed technique, including fast screening for viable injection changes, constructing an effective solvability index and rigorously certified loadability limits.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2016

Temporal Summary Images: An Approach to Narrative Visualization via Interactive Annotation Generation and Placement

Visualization is a powerful technique for analysis and communication of complex, multidimensional, and time-varying data. However, it can be difficult to manually synthesize a coherent narrative in a chart or graph due to the quantity of visualized attributes, a variety of salient features, and the awareness required to interpret points of interest (POIs). We present Temporal Summary Images (TSIs) as an approach for both exploring this data and creating stories from it. As a visualization, a TSI is composed of three common components: (1) a temporal layout, (2) comic strip-style data snapshots, and (3) textual annotations. To augment user analysis and exploration, we have developed a number of interactive techniques that recommend relevant data features and design choices, including an automatic annotations workflow. As the analysis and visual design processes converge, the resultant image becomes appropriate for data storytelling. For validation, we use a prototype implementation for TSIs to conduct two case studies with large-scale, scientific simulation datasets.

97 MATHEMATICS AND COMPUTING↗