Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 12 of 12 for “"graph computing"”.

  1. Enhancing Parallelization of Agent-based Graph Computing

    … and complex datasets. Traditional distributed computing frameworks, such as Apache Spark and Hadoop MapReduce, are effective for large-scale data processing but are not always well suited for graph computation. The MASS (Multi-Agent Spatial Simulation) Java library instead provides an …

    washington Repository record for Enhancing Parallelization of Agent-based Graph Computing (opens in a new tab)

  2. Enabling efficient graph computing with near-data processing techniques

    With the emergence of data science, graph computing is becoming a crucial tool for processing big connected data. However, when mapped to modern computing systems, graph computing typically suffers from poor performance because of inefficiencies in memory subsystems. At the same time, emerging …

    gatech Repository record for Enabling efficient graph computing with near-data processing techniques (opens in a new tab)

  3. GREMLIN++ & BITGRAPH: IMPLEMENTING THE GREMLIN TRAVERSAL LANGUAGE AND A GPU-ACCELERATED GRAPH COMPUTING FRAMEWORK IN C++

    … of two major components, Gremlin++ and BitGraph. Gremlin++ is a C++ implementation of the Gremlin graph traversal language designed for interfacing with C++ graph processing backends. BitGraph is a graph backend written in C++ designed to outperform Java-based competitors, such as …

    maryland Repository record for GREMLIN++ & BITGRAPH: IMPLEMENTING THE GREMLIN TRAVERSAL LANGUAGE AND A GPU-ACCELERATED GRAPH COMPUTING FRAMEWORK IN C++ (opens in a new tab)

  4. HARDWARE-SOFTWARE CO-DESIGN FOR ACCELERATING GRAPH PROCESSING AND GNNS: FROM EDGE TO CLOUD

    … on transforming the execution paradigms of graph workloads through hardware–software co-design and algorithmic innovations. Graph applications are characterized by irregular memory access and sparse computation, which limit the efficiency of traditional processors across diverse deployment …

    nus Repository record for HARDWARE-SOFTWARE CO-DESIGN FOR ACCELERATING GRAPH PROCESSING AND GNNS: FROM EDGE TO CLOUD (opens in a new tab) Download file for HARDWARE-SOFTWARE CO-DESIGN FOR ACCELERATING GRAPH PROCESSING AND GNNS: FROM EDGE TO CLOUD (opens in a new tab)

  5. Using Excel and PowerPoint to build a reverse engineering tool

    … as the backend data engine to make use of its graph computing capabilities. Using PowerExcelRigi, users appreciate the familiar user interface of Excel and PowerPoint and at the same time benefit from the efficiency of Rigi. A custom toolbar in Excel provides a means to perform several reverse …

    uvic Repository record for Using Excel and PowerPoint to build a reverse engineering tool (opens in a new tab)

  6. Graph-based Incomplete LU Preconditioning Conjugate Gradient Algorithm for “N-1” Contingency Analysis

    … in this dissertation is aiming to improve the computing performance for the dynamic contingency analysis. Firstly, the graph technology is introduced as the model of the power system, thanks to it has widely used in the Internet, social media, network security, traffic control, e-commerce and …

    buffalo Repository record for Graph-based Incomplete LU Preconditioning Conjugate Gradient Algorithm for “N-1” Contingency Analysis (opens in a new tab)

  7. Analytical Modeling and Efficient Implementation for Specialized Hardware Acceleration of Sparse Applications

    … critical applications, including data analytics, graph processing, deep learning, and transformers. In light of the growing footprints of sparse processing and diminishing benefits of generalpurpose scaling, recent years have seen an active body of research on accelerating sparse kernels using …

    cornell Repository record for Analytical Modeling and Efficient Implementation for Specialized Hardware Acceleration of Sparse Applications (opens in a new tab) Embargoed until 2028-06-18

  8. Techniques For Accelerating Large-Scale Automata Processing

    … gap between a general-purpose accelerator---Graphics Processing Unit (GPU) and AP. We identify excessive data movement in the GPU memory hierarchy and propose optimization techniques to reduce the data movement. Although our optimization techniques significantly alleviate these memory-related …

    wm-mary Repository record for Techniques For Accelerating Large-Scale Automata Processing (opens in a new tab)

  9. EFFICIENT SUBGRAPH MINING AND DISCOVERY ON MASSIVE GRAPHS

    Subgraph finding is critical for analyzing complex networks but faces significant challenges regarding scalability, temporal dynamics, and the integration of node attributes. This thesis addresses these limitations through three novel systems. First, we introduce BLITZ, a high-performance graph …

    nus Repository record for EFFICIENT SUBGRAPH MINING AND DISCOVERY ON MASSIVE GRAPHS (opens in a new tab) Download file for EFFICIENT SUBGRAPH MINING AND DISCOVERY ON MASSIVE GRAPHS (opens in a new tab)

  10. Cohesive Subgraph Detection and Search in Large Graphs

    Graphs are widely used to model complex networks in real-world applications. The identification and search for cohesive subgraphs are fundamental tasks in graph analysis. Despite the many models proposed to measure subgraph cohesiveness and solve tasks, there are notable gaps in the research. …

    unsw Repository record for Cohesive Subgraph Detection and Search in Large Graphs (opens in a new tab)

  11. Energy Efficient Computing with Time-Based Digital Circuits

    … the world economical, abundant, and reliable computing resources which have enabled countless breakthroughs in science, medicine, and agriculture which have improved the lives of many. Due to physics, the rate of these advancements is slowing, while the demand for the increasing computing …

    umn Repository record for Energy Efficient Computing with Time-Based Digital Circuits (opens in a new tab)