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 2 of 2 for “"Graph Trimming"”.

  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. Evaluation of Distributed Programming Models and Extensions to Task-based Runtime Systems

    … Task Discovery (DTD) model, including user-level graph trimming and direct Application Programming Interface (API) calls to perform data broadcast operation to further extend the limit of STF model. On the other hand, the Parameterized Task Graph (PTG) approach in PaRSEC is the most scalable …

    utk-theses Repository record for Evaluation of Distributed Programming Models and Extensions to Task-based Runtime Systems (opens in a new tab)