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 20 of 91 for “"Graph Processing"”.

  1. Graph Processing on GPU

    … the state-of-the-art GPGPU techniques over large graph mining. By understanding the limitations of heterogeneous hardware, triangulation, as a representative of graph mining algorithms, was implemented to be accelerated by many-core GPUs. Afterwards, a synchronous iterative GPU-accelerated graph …

    nus Repository record for Graph Processing on GPU (opens in a new tab) Download file for Graph Processing on GPU (opens in a new tab)

  2. GPU-ACCELERATED GRAPH PROCESSING

    … practical GPU utilization as an accelerator for graph processing and propose a systematic solution to solve these challenges. To fill the gap of graph structures in supporting dynamic updates on the GPU, we propose GPMA, which avoids the entire graph rebuilding for every single update. To …

    nus Repository record for GPU-ACCELERATED GRAPH PROCESSING (opens in a new tab) Download file for GPU-ACCELERATED GRAPH PROCESSING (opens in a new tab)

  3. PARALLEL GRAPH PROCESSING ON GPUS

    Graph is a useful data model that has been used in various domains. Despite its great importance, graph processing is faced with great challenges that make it difficult to achieve scalable and efficient data processing. As the recently prevalent processors, i.e., graphics processing units (GPUs), …

    nus Repository record for PARALLEL GRAPH PROCESSING ON GPUS (opens in a new tab) Download file for PARALLEL GRAPH PROCESSING ON GPUS (opens in a new tab)

  4. Scalable Graph Processing With SIGNAL/COLLECT

    … models. Many of these tasks involve processing data that has a natural graph representation. Whilst the opportunities are there in the form of access to processing resources and data sets, the way we write software has largely not caught up. Many use MapReduce for scalable processing, …

    zurich

  5. Advanced semantics for accelerated graph processing

    Large-scale graph applications are of great national, commercial, and societal importance, with direct use in fields such as counter-intelligence, proteomics, and data mining. Unfortunately, graph-based problems exhibit certain basic characteristics that make them a poor match for conventional …

    lsu-thes Repository record for Advanced semantics for accelerated graph processing (opens in a new tab)

  6. Systems and Algorithms for Dynamic Graph Processing

    … interactions could be naturally represented as graph data. Several emerging applications rely on graph data, such as the semantic web, social networks, bioinformatics, finance, and trading among others. These applications require graph querying capabilities which are often implemented in graph …

    waterloo Repository record for Systems and Algorithms for Dynamic Graph Processing (opens in a new tab)

  7. Optimizing graph processing execution on NUMA machines

    … growth of interconnected data built on top of graph data structures, with graph applications processing large amounts of information. Graph algorithms, such as Breadth-First-Search (BFS) and PageRank (PR), directly benefit several fields, such as scientific computing, neuroscience, and social …

    brazil-ufrgs Repository record for Optimizing graph processing execution on NUMA machines (opens in a new tab)

  8. Graph Processing in Main-Memory Column Stores

    … applications leverage the advantages of a graph data model, such as the offered schema flexibility and an explicit representation of relationships between entities. As a consequence, companies are confronted with the challenge of storing, manipulating, and querying terabytes of graph data …

    qucosa-diss

  9. Asynchronous dynamic graph processing with real-time analysis

    … transactions has led to the widespread use of graph-based representations for data analysis of these networks. However, traditional high-performance computing (HPC) solutions designed for static graphs are inefficient and impractical for dynamic graphs that evolve over time. This approach leads …

    ubc Repository record for Asynchronous dynamic graph processing with real-time analysis (opens in a new tab) Download PDF for Asynchronous dynamic graph processing with real-time analysis (opens in a new tab)

  10. Scale-free graph processing on a NUMA machine

    The importance of high-performance graph processing to solve big data problems targeting high-impact applications is greater than ever before. Graphs incur highly irregular memory accesses which leads to poor data locality, load imbalance, and data-dependent parallelism. Distributed graph …

    ubc Repository record for Scale-free graph processing on a NUMA machine (opens in a new tab) Download PDF for Scale-free graph processing on a NUMA machine (opens in a new tab)

  11. Optimizing Differential Computation for Large-Scale Graph Processing

    … by entities and their relationships. Graphs naturally emerge as the most intuitive abstraction for modeling these datasets. Many practical applications seek the ability to share computations across multiple snapshots of evolving graphs to efficiently perform analyses, such as …

    waterloo Repository record for Optimizing Differential Computation for Large-Scale Graph Processing (opens in a new tab)

  12. On Improving Distributed Pregel-like Graph Processing Systems

    … that can execute algorithms to process large graphs has led to the creation of many graph processing systems. However, existing systems suffer from two major issues: (1) poor performance due to frequent global synchronization barriers and limited scalability; and (2) lack of support for graph …

    waterloo Repository record for On Improving Distributed Pregel-like Graph Processing Systems (opens in a new tab)

  13. Accelerator Architectures for Deep Learning and Graph Processing

    <p>Deep learning and graph processing are two big-data applications and they are widely applied in many domains. The training of deep learning is essential for inference and has not yet been fully studied. With data forward, error backward, and gradient calculation, deep learning training is a more …

    duke Repository record for Accelerator Architectures for Deep Learning and Graph Processing (opens in a new tab)

  14. Algorithm-Level Optimizations for Scalable Parallel Graph Processing

    Efficiently processing large graphs is challenging, since parallel graph algorithms suffer from poor scalability and performance due to many factors, including heavy communication and load-imbalance. Furthermore, it is difficult to express graph algorithms, as users need to understand and …

    tamu Repository record for Algorithm-Level Optimizations for Scalable Parallel Graph Processing (opens in a new tab)

  15. Approximate failure recovery in distributed graph processing systems

    Distributed graph processing systems are an emerging area of big data systems. As graphs continue to grow in size and prevalence, these systems must become faster and more scalable. However, after failures, distributed graph processing systems either largely rely on proactive fault tolerance …

    uiuc Repository record for Approximate failure recovery in distributed graph processing systems (opens in a new tab)

  16. Panther : a memory-centric accelerator for webscale graph processing

    Web-scale graph analytics used in applications such as social network recommendations, fraud detection, knowledge-graph reasoning, and large-scale search are fundamentally limited by irregular, data-dependent memory accesses. These access patterns do not align well with cache hierarchies and leave …

    texas Repository record for Panther : a memory-centric accelerator for webscale graph processing (opens in a new tab)

  17. Efficient Failure Recovery in Large-scale Graph Processing Systems

    … how to make sure the reliability of large-scale graph processing systems. Traditional rollback recovery mechanisms in distributed system have been studied in various forms by a wide range of researchers, but not many of them are actually applied in real systems. To address these challenges, in …

    nus Repository record for Efficient Failure Recovery in Large-scale Graph Processing Systems (opens in a new tab) Download file for Efficient Failure Recovery in Large-scale Graph Processing Systems (opens in a new tab)

  18. Vertex-and-edge ordering for faster parallel graph processing

    Graph structured data, which models complex relationships, describes data in myriad domains, such as social network analysis, protein structure analysis, and supply chain management. As the size of graph data grows, researchers develop modern systems to handle massive datasets with trillions of …

    ubc Repository record for Vertex-and-edge ordering for faster parallel graph processing (opens in a new tab) Download PDF for Vertex-and-edge ordering for faster parallel graph processing (opens in a new tab)

  19. Bounded Asynchrony and Nested Parallelism for Scalable Graph Processing

    Processing large-scale graphs has increasingly become a critical component in a variety of fields, from scientific computing to social analytics. The size of graphs of interest are becoming explosively large, preventing them from fitting into the memory of a single-processor system and highlighting …

    tamu Repository record for Bounded Asynchrony and Nested Parallelism for Scalable Graph Processing (opens in a new tab)

  20. Using Workload Characterization to Guide High Performance Graph Processing

    Graph analytics represent an important application domain widely used in many fields such as web graphs, social networks, and Bayesian networks. The sheer size of the graph data sets combined with the irregular nature of the underlying problem pose a significant challenge for performance, …

    vt Repository record for Using Workload Characterization to Guide High Performance Graph Processing (opens in a new tab)

Page 1 of 5