2026-08-17T07:52:13Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4957 2024-03-06T10:35:30Z ddc:004 open_access

Parallel Algorithms Reconsidered (Invited Talk) Sanders, Peter parallel algorithm algorithm engineering communication efficient algorithm polylogarithmic time algorithm parallel machine model Parallel algorithms have been a subject of intensive algorithmic research in the 1980s. This research almost died out in the mid 1990s. In this paper we argue that it is high time to reconsider this subject since a lot of things have changed. First and foremost, parallel processing has moved from a niche application to something mandatory for any performance critical computer applications. We will also point out that even very fundamental results can still be obtained. We give examples and also formulate some open problems. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Peter Sanders 2015 Is Part Of LIPIcs, Volume 30, 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2015.10 urn:nbn:de:0030-drops-49572 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.10 eng https://creativecommons.org/licenses/by/3.0/legalcode