Efficient Large Graph Partitioning Scheme Using Incremental Processing in GPU

As the processing of large-scale graphs on a single device is infeasible without partitioning, graph partitioning algorithms are essential for various algorithms and distributed computing tasks utilizing graph data. However, graph partitioning is a nondeterministic polynomial time NP-Complete proble...

Cijeli opis

Bibliografski detalji

Glavni autori:	Hyeonbyeong Lee, Jeonghyun Baek, Sangho Song, Yuna Kim, Hyunjung Hwang, Jongtae Lim, Dojin Choi, Kyoungsoo Bok, Jaesoo Yoo
Format:	Artigo
Jezik:	Inglês
Izdano:	IEEE 2025-01-01
Serija:	IEEE Access
Teme:	GPU-accelerated graph partitioning GPU out-of-memory graph processing streaming clustering
Online pristup:	https://ieeexplore.ieee.org/document/10909546/
Oznake:	Dodaj oznaku Bez oznaka, Budi prvi tko označuje ovaj zapis!