Scalable Interactive Dynamic Graph Clustering on Multicore CPUs | Zendy

Son T. | Zendy; Sihem Amer-Yahia | Zendy; Ira Assent | Zendy; Mathias Skovgaard Birk | Zendy; Martin Storgaard Dieu | Zendy; Jon Jacobsen | Zendy; Jesper Kristensen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Scalable Interactive Dynamic Graph Clustering on Multicore CPUs

Author(s) -

Son T.,

Sihem Amer-Yahia,

Ira Assent,

Mathias Skovgaard Birk,

Martin Storgaard Dieu,

Jon Jacobsen,

Jesper Kristensen

Publication year - 2018

Publication title -

ieee transactions on knowledge and data engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.36

H-Index - 174

eISSN - 1558-2191

pISSN - 1041-4347

DOI - 10.1109/tkde.2018.2828086

Subject(s) - computer science , bottleneck , scalability , multi core processor , parallel computing , speedup , cluster analysis , graph , theoretical computer science , algorithm , artificial intelligence , database , embedded system

The structural graph clustering algorithm SCAN is a fundamental technique for managing and analyzing graph data. However, its high runtime remains a computational bottleneck, which limits its applicability. In this paper, we propose a novel interactive approach for tackling this problem on multicore CPUs. Our algorithm, called anySCAN, iteratively processes vertices in blocks. The acquired results...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research