Search NASA⌕ Search

SEARCH · Search NASA

Results for “graph analytics”

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 127 records · Page 7

EvoGraph: On-The-Fly Efficient Mining of Evolving Graphs on GPU

With the prevalence of the World Wide Web and social networks, there has been a growing interest in high performance analytics for constantly-evolving dynamic graphs. Modern GPUs provide massive AQ1 amount of parallelism for efficient graph processing, but the challenges remain due to their lack of support for the near real-time streaming nature of dynamic graphs. Specifically, due to the current high volume and velocity of graph data combined with the complexity of user queries, traditional processing methods by first storing the updates and then repeatedly running static graph analytics on a sequence of versions or snapshots are deemed undesirable and computational infeasible on GPU. We present EvoGraph, a highly efficient and scalable GPU- based dynamic graph analytics framework.

dynamic graphs↗

Graph Generator Survey

The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of different application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.

analytics↗

A Parallel Graph Environment for Real-World Data Analytics Workflows

Economic competitiveness and national security depend increasingly on the insightful analysis of large data sets. The diversity of real-world data sources and analytic workflows impose challenging hardware and software requirements for parallel graph platforms. The irregular nature of graph methods is not supported well by the deep memory hierarchies of conventional distributed systems, requiring new processor and runtime system designs to tolerate memory and synchronization latencies. Moreover, the efficiency of relational table operations and matrix computations are not attainable when data is stored in common graph data structures. In this paper, we present HAGGLE, a high-performance, scalable data analytics platform. The platform’s hybrid data model supports a variety of distributed, thread-safe data structures, parallel programming constructs, and persistent and streaming data. An abstract runtime layer enables us to map the stack to conventional, distributed computer systems with accelerators. The runtime uses multithreading, active messages, and data aggregation to hide memory and synchronization latencies on large-scale systems.

Graph Analytics↗

From Anderson localization on random regular graphs to many-body localization

Highlights: • Anderson transition from ergodicity to localization on random regular graphs (RRG). • Analytical, pool method, and exact-diagonalization study of correlations on RRG. • Many-body localization (MBL) to ergodicity transition: quantum dots and spin chains. • Dynamical eigenstate correlation functions in RRG and MBL problems. • Anderson localization on RRG as a toy model for MBL. The article reviews the physics of Anderson localization on random regular graphs (RRG) and its connections to many-body localization (MBL) in disordered interacting systems. Properties of eigenstate and energy level correlations in delocalized and localized phases, as well at criticality, are discussed. In the many-body part, models with short-range and power-law interactions are considered, as well as the quantum-dot model representing the limit of the “most long-range” interaction. Central themes – which are common to the RRG and MBL problems – include ergodicity of the delocalized phase, localized character of the critical point, strong finite-size effects, and fractal scaling of eigenstate correlations in the localized phase.

36 MATERIALS SCIENCE↗

When managers forage for pests: Implementing the functional response in pest management

In this work, we explore how the functional response framework can be implemented in pest management. Here, managers take the role of predators foraging on pests and facing monetary costs for survey and control in a spatial domain where the pest distribution and control strategy do not have to be random. To investigate this framework quantitatively, we simulated various management processes on different pest spatial distributions using a spatially-explicit individual-based model and Monte-Carlo simulations, and also confirmed some of the results analytically. By graphing the number of pests controlled versus pest density, we obtained management functional response curves. Whether the management functional response was shaped like a type I, type II or type III functional response depended on the management costs and the search area. Yet, the management spatial strategy and the pest spatial distribution had little effect on the functional response. We applied our model to the management of mountain pine beetle epidemic in Cypress Hills, Saskatchewan, Canada, with simulations matching the real number of attacked trees controlled by managers. We showed how to make an analogy between functional responses in predator–prey interactions and in human–pest interactions and thereby, apply insights from the functional response framework to pest management.

54 ENVIRONMENTAL SCIENCES↗

A Fine-grained Asynchronous Bulk Synchronous parallelism model for PGAS applications

The Partitioned Global Address Space (PGAS) model is well suited for executing irregular applications on cluster-based systems, due to its efficient support for short, one-sided messages. Separately, the actor model has been gaining popularity as a productive asynchronous message-passing approach for distributed objects in enterprise and cloud computing platforms, typically implemented in languages such as Erlang, Scala or Rust. To the best of our knowledge, there has been no past work on using the actor model to deliver both productivity and scalability to irregular PGAS applications with large number of small messages. In this paper, we introduce a new programming system for PGAS applications, in which point-to-point remote operations can be expressed as fine-grained asynchronous actor messages. In our approach, the programmer does not need to worry about programming complexities related to message aggregation and termination detection. Our approach can be viewed as extending the classical Bulk Synchronous Parallelism model with fine-grained asynchronous communications within a phase or superstep. Here, we believe that our approach offers a desirable point in the productivity-performance space for PGAS applications, with more scalable performance and higher productivity relative to past approaches. Specifically, for seven irregular mini-applications from the Bale Kernels and three graph kernels executed using 2048 cores in the NERSC Cori system, our approach shows geometric mean performance improvements of ≥ 20X relative to standard PGAS versions (UPC and OpenSHMEM) while maintaining comparable productivity to those versions.

97 MATHEMATICS AND COMPUTING↗

Nonlinear instability of an Oldroyd elastico–viscous magnetic nanofluid saturated in a porous medium

Through viscoelastic potential theory, a Kelvin-Helmholtz instability of two semi-infinite fluid layers, of Oldroydian viscoelastic magnetic nanofluids (MNF), is investigated. The system is saturated by porous medium through two semi-infinite fluid layers. The Oldroyd B model is utilized to describe the rheological behavior of viscoelastic MNF. The system is influenced by uniform oblique magnetic field that acts at the surface of separation. The model is used for the MNF incorporated the effects of uniform basic streaming and viscoelasticity. Therefore, a mathematical simplification must be considered. A linear stability analysis, based upon the normal modes analysis, is utilized to find out the solutions of the equations of motion. The onset criterion of stability is derived; analytically and graphs have been plotted by giving numerical values to the various parameters. These graphs depict the stability characteristics. Regions of stability and instability are identified and discussed in some depth. Some previous studies are recovered upon appropriate data choices. The stability criterion in case of ignoring the relaxation stress times is also derived. To relax the mathematical manipulation of the nonlinear approach, the linearity of the equations of motion is taken into account in correspondence with the nonlinear boundary conditions. Taylor's theory is adopted to expand the governing nonlinear characteristic equation according to of the multiple time scales technique. This analysis leads to the well-known Ginzburg–Landau equation, which governs the stability criteria. The stability criteria are achieved theoretically. To simplify the mathematical manipulation, a special case is considered to achieve the numerical estimations. The influence of orientation of the magnetic fields on the stability configuration, in linear as well as nonlinear approaches, makes a dual role for the magnetic field strength in the stability graphs. Stability diagram is plotted for different sets of physical parameters. A new stability as well as instability region, in the parameter space, appears due to the nonlinear effects.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NOUS: Construction and Querying of Dynamic Knowledge Graphs

The ability to construct domain specific knowledge graphs (KG) and perform question-answering or hypothesis generation is a trans- formative capability. Despite their value, automated construction of knowledge graphs remains an expensive technical challenge that is beyond the reach for most enterprises and academic institutions. We propose an end-to-end framework for developing custom knowl- edge graph driven analytics for arbitrary application domains. The uniqueness of our system lies A) in its combination of curated KGs along with knowledge extracted from unstructured text, B) support for advanced trending and explanatory questions on a dynamic KG, and C) the ability to answer queries where the answer is embedded across multiple data sources.

Choudhury, Sutanay↗

Visual Matrix Clustering of Social Networks

The prevailing choices to graphically represent a social network in today’s literature are a node-link graph layout and an adjacency matrix. Both visualization techniques have unique strengths and weaknesses when applied to different domain applications. In this article, we focus our discussion on adjacency matrix and how to turn the matrix-based visualization technique from merely showing pairwise associations among network actors (or graph nodes) to depicting clusters of a social network. We also use node-link layouts to supplement the discussion.

graph analytics↗

A Novel Centrality Measure for Network-wide Cyber Vulnerability Assessment

In this work we propose a novel formulation that models the attack and compromise on a cyber network as a combination of two parts - direct compromise of a host and the compromise occurring through the spread of the attack on the network from a compromised host. The model parameters for the nodes are a concise representation of the host profiles that can include the risky behaviors of the associated human users while the model parameters for the edges are based on the existence of vulnerabilities between each pair of connected hosts. The edge models relate to the summary representations of the corresponding attack-graphs. This results in a formulation based on Random Walk with Restart (RWR) and the resulting centrality metric can be solved for in an efficient manner through the use of sparse linear solvers. Thus the formulation goes beyond mere topological considerations in centrality computations by summarizing the host profiles and the attack graphs into the model parameters. The computational efficiency of the method also allows us to also quantify the uncertainty in the centrality measure through Monte Carlo analysis.

Centrality↗

Hoover

HOOVER is a distributed framework for solving streaming/dynamic graph problems where the structure of a graph changes over time based on the state of its vertices.

97 MATHEMATICS AND COMPUTING↗

Ginzburg--Landau functionals in the large-graph limit

Ginzburg–Landau (GL) functionals on graphs, which are relaxations of graph-cut functionals on graphs, have yielded a variety of insights in image segmentation and graph clustering. In this paper, we study large-graph limits of GL functionals by taking a functional-analytic view of graphs as nonlocal kernels. For a graph Wn with n nodes, the corresponding graph GL functional GL W n ϵ is an energy for functions on Wn. We minimize GL functionals on sequences of growing graphs that converge to functions called graphons. For such sequences of graphs, we show that the graph GL functional Γ-converges to a continuous and nonlocal functional that we call the graphon GL functional. We investigate the sharp-interface limits of the graph GL and graphon GL functionals, and we relate these limits to a nonlocal total-variation (TV) functional. We express the limiting GL functional in terms of Young measures and thereby obtain a probabilistic interpretation of the minimization problem in the large-graph limit. Finally, to develop intuition about graphon GL functionals, we determine the GL minimizer for several example families of graphons.

Zhang, Edith↗

Exploiting Literature-Based Discovery to Study Effects of Bullying

Bullying represents an aggressive behavioral problem. It can create severe mental illness in children, adolescents, and adults. Researchers are interested in studying bullying to understand its long-term negative consequences and design better-targeted intervention programs. Broadly researchers in psychology and education have conducted studies on bullying without using advanced analytical features offered by the computer science domain. However, researchers could benefit from power of advanced analytics for an in-depth understanding of bullying. In this paper, we present graph-based advanced analytics by employing a literature-based discovery (LBD) approach to study the direct and indirect consequences of bullying from published literature. In addition, we describe a graph-based study on the evolution of research on bullying consequences in the last two decades. Our graph-based study reveals a summary view of associations of bullying with other diseases and disorders from published literature. Further, we employ literature reference information to quantify the strength of the graph-derived relationships. We demonstrate that LBD is a valuable approach to perform advanced analytics on bullying that helps us to understand the severity of its consequences.

Hasan, S M Shamimul↗

Large-Scale Continuous Subgraph Queries on Streams

Graph pattern matching involves finding exact or approximate matches for a query subgraph in a larger graph. It has been studied extensively and has strong applications in domains such as computer vision, computational biology, social networks, security and finance. The problem of exact graph pattern matching is often described in terms of subgraph isomorphism which is NP-complete. The exponential growth in streaming data from online social networks, news and video streams and the continual need for situational awareness motivates a solution for finding patterns in streaming updates. This is also the prime driver for the real-time analytics market. Development of incremental algorithms for graph pattern matching on streaming inputs to a continually evolving graph is a nascent area of research. Some of the challenges associated with this problem are the same as found in continuous query (CQ) evaluation on streaming databases. This paper reviews some of the representative work from the exhaustively researched field of CQ systems and identifies important semantics, constraints and architectural features that are also appropriate for HPC systems performing real-time graph analytics. For each of these features we present a brief discussion of the challenge encountered in the database realm, the approach to the solution and state their relevance in a high-performance, streaming graph processing framework.

99 GENERAL AND MISCELLANEOUS↗

GraphTango: A Hybrid Representation Format for Efficient Streaming Graph Updates and Analysis

Abstract Streaming graph processing performs batched updates and analytics on a time-evolving graph. The underlying representation format of the graph largely determines the throughputs of these updates and analytics phases. Existing representation formats usually employ variations of hash tables or adjacency lists. However, a recent study showed that the adjacency-list-based approaches perform poorly on heavy-tailed graphs, and the hash table-based approaches suffer on short-tailed graphs. We propose GraphTango, a hybrid representation format that provides excellent update and analytics throughput regardless of the graph’s degree distribution. GraphTango dynamically switches among three different formats based on a vertex’s degree: (i) Low-degree vertices store the edges directly with the neighborhood metadata, confining accesses to a single cache line, (2) Medium-degree vertices use adjacency lists, and (3) High-degree vertices use hash tables as well as adjacency lists. In this case, the adjacency list provides fast traversal during the analytics phase, while the hash table provides constant-time lookups during the update phase. We further optimized the performance by designing an open-addressing-based hash table that fully utilizes every fetched cache line. In addition, we developed a thread-local lock-free memory pool that allows fast growing/shrinking of the adjacency lists and hash tables in a multi-threaded environment. We evaluated GraphTango with the help of the SAGA-Bench framework and compared it with four other representation formats: Stinger, Degree-aware Robin Hood Hashing, and two adjacency list-based formats with different workload balancing scheme. On average, GraphTango provides 4.5x higher insertion throughput, 3.2x higher deletion throughput, and 1.1x higher analytics throughput over the next best format. Furthermore, we integrated GraphTango with the state-of-the-art graph processing frameworks DZiG and RisGraph. Compared to the vanilla DZiG and vanilla RisGraph , [ GraphTango + DZiG ] and [ GraphTango + RisGraph ] reduces the average batch processing time by 2.3x and 1.5x, respectively.

Ahmed, Alif↗

Composing Data Parallel Code for a SPARQL Graph Engine

Big data analytics process large amount of data to extract knowledge from them. Semantic databases are big data applications that adopt the Resource Description Framework (RDF) to structure metadata through a graph-based representation. The graph based representation provides several benefits, such as the possibility to perform in memory processing with large amounts of parallelism. SPARQL is a language used to perform queries on RDF-structured data through graph matching. In this paper we present a tool that automatically translates SPARQL queries to parallel graph crawling and graph matching operations. The tool also supports complex SPARQL constructs, which requires more than basic graph matching for their implementation. The tool generates parallel code annotated with OpenMP pragmas for x86 Shared-memory Multiprocessors (SMPs). With respect to commercial database systems such as Virtuoso, our approach reduces memory occupation due to join operations and provides higher performance. We show the scaling of the automatically generated graph-matching code on a 48-core SMP.

Big data↗

High-performance analysis of filtered semantic graphs

High performance is a crucial consideration when executing a complex analytic query on a massive semantic graph. In a semantic graph, vertices and edges carry "attributes" of various types. Analytic queries on semantic graphs typically depend on the values of these attributes; thus, the computation must either view the graph through a filter that passes only those individual vertices and edges of interest, or else must first materialize a subgraph or subgraphs consisting of only the vertices and edges of interest. The filtered approach is superior due to its generality, ease of use, and memory efficiency, but may carry a performance cost. In the Knowledge Discovery Toolbox (KDT), a Python library for parallel graph computations, the user writes filters in a high-level language, but those filters result in relatively low performance due to the bottleneck of having to call into the Python interpreter for each edge. In this work, we use the Selective Embedded JIT Specialization (SEJITS) approach to automatically translate filters defined by programmers into a lower-level efficiency language, bypassing the upcall into Python. We evaluate our approach by comparing it with the high-performance C++ /MPI Combinatorial BLAS engine, and show that the productivity gained by using a high-level filtering language comes without sacrificing performance.

97 MATHEMATICS AND COMPUTING↗

Massive Scale Cyber Traffic Analysis: A Driver for Graph Database Research

We describe the significance and prominence of network traffic analysis (TA) as a graph- and network-theoretical domain for advancing research in graph database systems. TA involves observing and analyzing the connections between clients, servers, hosts, and actors within IP networks, both at particular times and as extended over times. Towards that end, NetFlow (or more generically, IPFLOW) data are available from routers and servers which summarize coherent groups of IP packets flowing through the network. IPFLOW databases are routinely interrogated statistically and visualized for suspicious patterns. But the ability to cast IPFLOW data as a massive graph and query it interactively, in order to e.g.\ identify connectivity patterns, is less well advanced, due to a number of factors including scaling, and their hybrid nature combining graph connectivity and quantitative attributes. In this paper, we outline requirements and opportunities for graph-structured IPFLOW analytics based on our experience with real IPFLOW databases. Specifically, we describe real use cases from the security domain, cast them as graph patterns, show how to express them in two graph-oriented query languages SPARQL and Datalog, and use these examples to motivate a new class of "hybrid" graph-relational systems.

Joslyn, Cliff A.↗