Publication

Efficient Distributed Transposition Of Large-Scale Multigraphs And High-Cardinality Sparse Matrices

Abstract

Graph-based representations underlie a wide range of scientific problems. Graph connectivity is typically represented as a sparse matrix in the Compressed Sparse Row format. Large-scale graphs rely on distributed storage, allocating distinct subsets of rows to compute nodes. Efficient matrix transpose is an operation of high importance, providing the reverse graph pathways and a column-ordered matrix view. This operation is well studied for simple graph models. Nevertheless, its resolution for multigraphs and higher-cardinality connectivity matrices is unexistent. We advance state-of-the-art distributed transposition methods by providing a theoretical model, algorithmic details, MPI-based implementation and proof of mathematical soundness for such complex models. Benchmark results demonstrate ideal and almost ideal scaling properties for perfectly- and heterogeneously-balanced datasets, respectively

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.