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 15 of 15 for “"Parallel graph algorithms"”.

  1. MULTI-CORE PARALLEL GRAPH ALGORITHMS

    Large sizes of real-world data graphs, such as social networks, communication networks, hyperlink networks, and model-checking networks, call for fast and scalable analytic algorithms. The shared-memory multicore machine is a prevalent parallel computation model that can handle such volumes of …

    mcmaster Repository record for MULTI-CORE PARALLEL GRAPH ALGORITHMS (opens in a new tab)

  2. Mapping parallel graph algorithms to throughput-oriented architectures

    … structure in information has made the domain of parallel and high-performance computing especially crucial. Graphics Processing Units (GPUs) have recently become an exciting alternative to traditional CPU architectures for applications in this domain. Although GPUs are designed for rendering …

    gatech Repository record for Mapping parallel graph algorithms to throughput-oriented architectures (opens in a new tab)

  3. Scalable Data-Parallel graph algorithms from generation to management

    … structure to model connections between objects, ?graph?. More than a century later, the versatility of graphs as a data model is demonstrated by the long list of applications in mathematics, science, engineering and the humanities. Graphs are natural data structures for modern applications. Social …

    nus Repository record for Scalable Data-Parallel graph algorithms from generation to management (opens in a new tab) Download file for Scalable Data-Parallel graph algorithms from generation to management (opens in a new tab)

  4. Some Optimally Adaptive Parallel Graph Algorithms on EREW PRAM Model

    The study of graph algorithms is an important area of research in computer science, since graphs offer useful tools to model many real-world situations. The commercial availability of parallel computers have led to the development of efficient parallel graph algorithms. Using an exclusive-read and …

    ucf Repository record for Some Optimally Adaptive Parallel Graph Algorithms on EREW PRAM Model (opens in a new tab)

  5. 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)

  6. OPTIMIZED ALGORITHMS FOR DATA ANALYSIS IN PARALLEL DATABASE SYSTEMS

    … is frequently found in machine learning algorithms as an important primitive operation. Since database management systems do not support matrix operations, analytical tasks are commonly performed outside the database system, in external libraries or mathematical tools. In this work, we …

    houston Repository record for OPTIMIZED ALGORITHMS FOR DATA ANALYSIS IN PARALLEL DATABASE SYSTEMS (opens in a new tab)

  7. Optimizing Parallel Graph Analytics through Advanced Innovative Techniques

    … analyzing and extracting information from large graphs has risen sharply. However, the extensive size and high complexity of some graphs incur a heavy computational cost, making it hard to study them using traditional analytical frameworks. Moreover, many important graph algorithms are difficult …

    texas-state Repository record for Optimizing Parallel Graph Analytics through Advanced Innovative Techniques (opens in a new tab)

  8. 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)

  9. A high-performance framework for analyzing massive complex networks

    Graphs are a fundamental and widely-used abstraction for representing data. We can analytically study interesting aspects of real-world complex systems such as the Internet, social systems, transportation networks, and biological interaction data by modeling them as graphs. Graph-theoretic and …

    gatech Repository record for A high-performance framework for analyzing massive complex networks (opens in a new tab)

  10. Optimizing graph analyses on GPUs

    The massive parallelism on GPUs provides opportunities to accelerate computation onlarge real-world graphs. However, implementing parallel graph algorithms on GPUs is quite challenging because of the following two facts. First, the DRAM on a GPU is limited and the size of some real-world graphs are …

    colo-mines Repository record for Optimizing graph analyses on GPUs (opens in a new tab)

  11. Parallel pointer analysis for large-scale software

    … especially when applied to large programs. Parallel platforms, which are prevalent nowadays, provide a great opportunity to enhance the efficiency of pointer analysis. Yet, it is challenging to parallelise this analysis, which is essentially an irregular graph algorithm. In general, pointer …

    unsw Repository record for Parallel pointer analysis for large-scale software (opens in a new tab)

  12. Large-scale graph algorithms and applications with an emphasis on fintech data

    <p>Graph algorithms are essential analytical tools with applications spanning cybersecurity, biology, social media, and increasingly, financial technology (FinTech). The complex and interconnected nature of financial data, particularly in cryptocurrency networks, presents unique opportunities for …

    njit Repository record for Large-scale graph algorithms and applications with an emphasis on fintech data (opens in a new tab)

  13. A framework for large-scale dynamic social network analysis with application to key actor analysis

    Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2027-12-01

    uiuc Repository record for A framework for large-scale dynamic social network analysis with application to key actor analysis (opens in a new tab)