Parallel Algorithms Reconsidered (Invited Talk)

Author Peter Sanders



PDF
Thumbnail PDF

File

LIPIcs.STACS.2015.10.pdf
  • Filesize: 496 kB
  • 9 pages

Document Identifiers

Author Details

Peter Sanders

Cite As Get BibTex

Peter Sanders. Parallel Algorithms Reconsidered (Invited Talk). In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 10-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015) https://doi.org/10.4230/LIPIcs.STACS.2015.10

Abstract

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.

Subject Classification

Keywords
  • parallel algorithm
  • algorithm engineering
  • communication efficient algorithm
  • polylogarithmic time algorithm
  • parallel machine model

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail