We present Rusty-Cracker, a high-performance Rust library that implements a parallel version of the Cracker algorithm for efficiently identifying connected components in large-scale graphs. Designed to address the growing demands of graph analytics in fields such as social network analysis, bioinformatics, and infrastructure modeling, Rusty-Cracker leverages Rust's concurrency and memory safety features to ensure both speed and reliability. The adapted Cracker algorithm capitalizes on modern multi-core architectures through parallel processing, effectively minimizing synchronization overhead and optimizing workload distribution. This design significantly reduces computational time while maintaining accuracy. We present the implementation details and evaluate its performance on a real-world dataset of undirected graphs.

Rusty-Cracker: A Multi-core Connected Components Library in Rust

Davide Rucci;Emanuele Carlini;Matteo Mordacchini;Patrizio Dazzi
2025

Abstract

We present Rusty-Cracker, a high-performance Rust library that implements a parallel version of the Cracker algorithm for efficiently identifying connected components in large-scale graphs. Designed to address the growing demands of graph analytics in fields such as social network analysis, bioinformatics, and infrastructure modeling, Rusty-Cracker leverages Rust's concurrency and memory safety features to ensure both speed and reliability. The adapted Cracker algorithm capitalizes on modern multi-core architectures through parallel processing, effectively minimizing synchronization overhead and optimizing workload distribution. This design significantly reduces computational time while maintaining accuracy. We present the implementation details and evaluate its performance on a real-world dataset of undirected graphs.
2025
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo" - ISTI
Istituto di informatica e telematica - IIT
connected components
graph algorithms
parallel algorithms
rust
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/560898
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ente

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact