LIPIcs.MFCS.2023.3.pdf
- Filesize: 438 kB
- 2 pages
Document
Modern Parallel Algorithms (Invited Talk)
Author
Artur Czumaj 
-
Part of:
Volume:
48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Mathematical Foundations of Computer Science (MFCS) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2023-08-21
File
Document Identifiers
Author Details
Cite AsGet BibTex
Artur Czumaj. Modern Parallel Algorithms (Invited Talk). In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 3:1-3:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.MFCS.2023.3
https://doi.org/10.4230/LIPIcs.MFCS.2023.3
Abstract
Recent advances in the design of efficient parallel algorithms have been largely focusing on the nowadays classical model of parallel computing called Massive Parallel Computation (MPC), which follows the framework of MapReduce systems. In this talk we will survey recent advances in the design of algorithms for graph problems for the MPC model and will mention some interesting open questions in this area.
Subject Classification
ACM Subject Classification
- Theory of computation → Massively parallel algorithms
- Theory of computation → Distributed algorithms
- Mathematics of computing → Graph algorithms
Keywords
- Distributed computing
- parallel computing
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads