Publication

Round Compression for Parallel Matching Algorithms

Aleksander Madry
2018
Conference Papers

Abstract

For over a decade now we have been witnessing the success of massive parallel computation (MPC) frameworks, such as MapReduce, Hadoop, Dryad, or Spark. One of the reasons for their success is the fact that these frameworks are able to accurately capture the nature of large-scale computation. In particular, compared to the classic distributed algorithms or PRAM models, these frameworks allow for much more local computation. The fundamental question that arises in this context is though: can we leverage this additional power to obtain even faster parallel algorithms?

Official source

https://infoscience.epfl.ch/entities/publication/2eb1b4da-b765-4aba-984c-e6a300559be1

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 Chat

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.

Round Compression for Parallel Matching Algorithms

Chat with Graph Search

The Power of Two Matrices in Spectral Algorithms for Community Recovery

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al