iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.48550/arXiv.2410.14047
[2410.14047] DiFuseR: A Distributed Sketch-based Influence Maximization Algorithm for GPUs
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Distributed, Parallel, and Cluster Computing

arXiv:2410.14047 (cs)
[Submitted on 17 Oct 2024]

Title:DiFuseR: A Distributed Sketch-based Influence Maximization Algorithm for GPUs

Authors:Gökhan Göktürk, Kamer Kaya
View PDF HTML (experimental)
Abstract:Influence Maximization (IM) aims to find a given number of "seed" vertices that can effectively maximize the expected spread under a given diffusion model. Due to the NP-Hardness of finding an optimal seed set, approximation algorithms are often used for IM. However, these algorithms require a large number of simulations to find good seed sets. In this work, we propose DiFuseR, a blazing-fast, high-quality IM algorithm that can run on multiple GPUs in a distributed setting. DiFuseR is designed to increase GPU utilization, reduce inter-node communication, and minimize overlapping data/computation among the nodes. Based on the experiments with various graphs, containing some of the largest networks available, and diffusion settings, the proposed approach is found to be 3.2x and 12x faster on average on a single GPU and 8 GPUs, respectively. It can achieve up to 8x and 233.7x speedup on the same hardware settings. Furthermore, thanks to its smart load-balancing mechanism, on 8 GPUs, it is on average 5.6x faster compared to its single-GPU performance.
Subjects: Distributed, Parallel, and Cluster Computing (cs.DC); Performance (cs.PF); Social and Information Networks (cs.SI)
Cite as: arXiv:2410.14047 [cs.DC]
  (or arXiv:2410.14047v1 [cs.DC] for this version)
  https://doi.org/10.48550/arXiv.2410.14047
Journal reference: J Supercomput 81, 21 (2025).

Submission history

From: Gökhan Göktürk [view email]
[v1] Thu, 17 Oct 2024 21:41:12 UTC (657 KB)
Full-text links:

Access Paper:

license icon view license
Current browse context:
cs.DC
< prev   |   next >
new | recent | 2024-10
Change to browse by:
cs
cs.PF
cs.SI

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)