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.
BibTeX - Entry
@InProceedings{czumaj:LIPIcs.MFCS.2023.3,
author = {Czumaj, Artur},
title = {{Modern Parallel Algorithms}},
booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)},
pages = {3:1--3:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-292-1},
ISSN = {1868-8969},
year = {2023},
volume = {272},
editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18537},
URN = {urn:nbn:de:0030-drops-185378},
doi = {10.4230/LIPIcs.MFCS.2023.3},
annote = {Keywords: Distributed computing, parallel computing}
}
|
Keywords: |
|
Distributed computing, parallel computing |
|
Collection: |
|
48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) |
|
Issue Date: |
|
2023 |
|
Date of publication: |
|
21.08.2023 |
Creative Commons Attribution 4.0 International license (CC BY 4.0)