Carbink:{Fault-Tolerant} Far Memory
Far memory systems allow an application to transparently access local memory as well as
memory belonging to remote machines. Fault tolerance is a critical property of any practical …
memory belonging to remote machines. Fault tolerance is a critical property of any practical …
Connectit: A framework for static and incremental parallel graph connectivity algorithms
Connected components is a fundamental kernel in graph applications. The fastest existing
parallel multicore algorithms for connectivity are based on some form of edge sampling …
parallel multicore algorithms for connectivity are based on some form of edge sampling …
Evaluation of graph analytics frameworks using the gap benchmark suite
Graphs play a key role in data analytics. Graphs and the software systems used to work with
them are highly diverse. Algorithms interact with hardware in different ways and which graph …
them are highly diverse. Algorithms interact with hardware in different ways and which graph …
FastSV: A distributed-memory connected component algorithm with fast convergence
This paper presents a new distributed-memory algorithm called FastSV for finding
connected components in an undirected graph. Our algorithm simplifies the classic Shiloach …
connected components in an undirected graph. Our algorithm simplifies the classic Shiloach …
FatPaths: Routing in supercomputers and data centers when shortest paths fall short
M Besta, M Schneider, M Konieczny… - … Conference for High …, 2020 - ieeexplore.ieee.org
We introduce FatPaths: a simple, generic, and robust routing architecture that enables state-
of-the-art low-diameter topologies such as Slim Fly to achieve unprecedented performance …
of-the-art low-diameter topologies such as Slim Fly to achieve unprecedented performance …
Parallel strong connectivity based on faster reachability
Computing strongly connected components (SCC) is among the most fundamental problems
in graph analytics. Given the large size of today's real-world graphs, parallel SCC …
in graph analytics. Given the large size of today's real-world graphs, parallel SCC …
Parallel algorithms for finding connected components using linear algebra
Finding connected components is one of the most widely used operations on a graph.
Optimal serial algorithms for the problem have been known for half a century, and many …
Optimal serial algorithms for the problem have been known for half a century, and many …
LACC: A linear-algebraic algorithm for finding connected components in distributed memory
Finding connected components is one of the most widely used operations on a graph.
Optimal serial algorithms for the problem have been known for half a century, and many …
Optimal serial algorithms for the problem have been known for half a century, and many …
LOTUS: Locality optimizing triangle counting
M Koohi Esfahani, P Kilpatrick… - Proceedings of the 27th …, 2022 - dl.acm.org
Triangle Counting (TC) is a basic graph mining problem with numerous applications.
However, the large size of real-world graphs has a severe effect on TC performance. This …
However, the large size of real-world graphs has a severe effect on TC performance. This …
Deact: Architecture-aware virtual memory support for fabric attached memory systems
VR Kommareddy, C Hughes… - … Symposium on High …, 2021 - ieeexplore.ieee.org
The exponential growth of data has driven technology providers to develop new protocols,
such as cache coherent interconnects and memory semantic fabrics, to help users and …
such as cache coherent interconnects and memory semantic fabrics, to help users and …