Výsledky vyhľadávania - "parallel graph algorithms"

Parallel graph algorithms on a RISCV-based many-core Autor Ravikumar, Ashuthosh Moolemajalu, Vinay, Aakarsh, Nagar, Krishna K., Purnaprajna, Madhura

“…Graph algorithms are essential in domains like social network analysis, web search, and bioinformatics. Their execution on modern hardware is vital due to the…”
Získať plný text

Scalable parallel graph algorithms with matrix–vector multiplication evaluated with queries Autor Cabrera, Wellington, Ordonez, Carlos

“…Graph problems are significantly harder to solve with large graphs residing on disk compared to main memory only. In this work, we study how to solve four…”
Získať plný text

Efficient and Scalable Parallel Graph Algorithms Autor Wang, Letong

“… The inherent complexity of parallel graph algorithms demands innovative approaches to harness the full potential of modern hardware…”
Získať plný text

An Algorithmic Approach to Communication Reduction in Parallel Graph Algorithms Autor Harshvardhan, Fidel, Adam, Amato, Nancy M., Rauchwerger, Lawrence

“…Graph algorithms on distributed-memory systems typically perform heavy communication, often limiting their scalability and performance. This work presents an…”
Získať plný text

GreediRIS: Scalable influence maximization using distributed streaming maximum cover Autor Barik, Reet, Cappa, Wade, Ferdous, S.M., Minutoli, Marco, Halappanavar, Mahantesh, Kalyanaraman, Ananth

“…Influence maximization—the problem of identifying a subset of k influential seeds (vertices) in a network—is a classical problem in network science with…”
Získať plný text

Parallel Graph Algorithms Through Approximation Autor Khan, Md Ariful Hasan

“…We consider the problem of computing a b-MATCHING and a b-EDGE COVER, which are subgraphs of a graph with specific properties. Although there are…”
Získať plný text

NetworKit: A tool suite for large-scale complex network analysis Autor STAUDT, CHRISTIAN L., SAZONOVS, ALEKSEJS, MEYERHENKE, HENNING

“…We introduce NetworKit, an open-source software package for analyzing the structure of large complex networks. Appropriate algorithmic solutions are required…”
Získať plný text

Towards scaling community detection on distributed-memory heterogeneous systems Autor Gawande, Nitin, Ghosh, Sayan, Halappanavar, Mahantesh, Tumeo, Antonino, Kalyanaraman, Ananth

“…In most real-world networks, nodes/vertices tend to be organized into tightly-knit modules known as communities or clusters such that nodes within a community…”
Získať plný text

Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP Autor Dehne, F., Ferreira, A., Cáceres, E., Song, S. W., Roncato, A.

Získať plný text

Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs Autor Jamour, Fuad, Skiadopoulos, Spiros, Kalnis, Panos

“…Betweenness centrality quantifies the importance of nodes in a graph in many applications, including network analysis, community detection and identification…”
Získať plný text

A memory efficient maximal clique enumeration method for sparse graphs with a parallel implementation Autor Yu, Ting, Liu, Mengchi

“…•We propose a memory efficient method, CMC-bit, for maximal clique enumeration on real-world sparse graphs.•We use an efficient order strategy to reduce both…”
Získať plný text

BFS-4K: An Efficient Implementation of BFS for Kepler GPU Architectures Autor Busato, Federico, Bombieri, Nicola

“…Breadth-first search (BFS) is one of the most common graph traversal algorithms and the building block for a wide range of graph applications. With the advent…”
Získať plný text

A performance predictor for implementation selection of parallelized static and temporal graph algorithms Autor Rehman, Akif, Ahmad, Masab, Khan, Omer

“…Task‐based execution of graph workloads allows various ordered and unordered implementations, with tasks representing dependencies between graph vertices and…”
Získať plný text

Performance Evaluation of Parallel Graphs Algorithms Utilizing Graphcore IPU Autor Gepner, Paweł, Kocot, Bartłomiej, Paprzycki, Marcin, Ganzha, Maria, Moroz, Leonid, Olas, Tomasz

“…Recent years have been characterized by increasing interest in graph computations. This trend can be related to the large number of potential application…”
Získať plný text

Graph coloring algorithms for multi-core and massively multithreaded architectures Autor Çatalyürek, Ümit V., Feo, John, Gebremedhin, Assefaw H., Halappanavar, Mahantesh, Pothen, Alex

“…► We explore the interplay between architectures and algorithm design for graph problems. ► We target multi-core platforms and a massively multithreaded…”
Získať plný text

Abstract Graph Machine: Modeling Orderings in Asynchronous Distributed-Memory Parallel Graph Algorithms Autor Kanewala, Thejaka Amila

“…Graphs are ubiquitous data structures. Processing large graphs require distributed-memory parallel graph algorithms…”
Získať plný text

High-performance and balanced parallel graph coloring on multicore platforms Autor Giannoula, Christina, Peppas, Athanasios, Goumas, Georgios, Koziris, Nectarios

“…Graph coloring is widely used to parallelize scientific applications by identifying subsets of independent tasks that can be executed simultaneously. Graph…”
Získať plný text

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable Autor Dhulipala, Laxman, Blelloch, Guy E, Shun, Julian

“…There has been significant recent interest in parallel graph processing due to the need to quickly analyze the large graphs available today. Many graph codes…”
Získať plný text

Distributed Graph Diameter Approximation Autor Ceccarello, Matteo, Pietracaprina, Andrea, Pucci, Geppino, Upfal, Eli

“…We present an algorithm for approximating the diameter of massive weighted undirected graphs on distributed platforms supporting a MapReduce-like abstraction…”
Získať plný text

Dynamic constant time parallel graph algorithms with sub-linear work Autor Schmidt, Jonas, Schwentick, Thomas

“…The paper proposes dynamic parallel algorithms for connectivity and bipartiteness of undirected graphs that require constant time and \(O(n^{1/2+\epsilon})\)…”
Získať plný text