English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

This paper presents a new distributed-memory algorithm called FastSV forfinding connected components in an undirected graph. Our algorithm simplifiesthe classic Shiloach-Vishkin algorithm and employs several novel and efficienthooking strategies for faster convergence. We map different steps of FastSV tolinear algebraic operations and implement them with the help of scalable graphlibraries. FastSV uses sparse operations to avoid redundant work and optimizedMPI communication to avoid bottlenecks. The resultant algorithm showshigh-performance and scalability as it can find the connected components of ahyperlink graph with over 134B edges in 30 seconds using 262K cores on a CrayXC40 supercomputer. FastSV outperforms the state-of-the-art algorithm by anaverage speedup of 2.21x (max 4.27x) on a variety of real-world graphs.

FastSV: A Distributed-Memory Connected Component Algorithm with Fast Convergence