Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2015.10
URN: urn:nbn:de:0030-drops-49572
URL: https://drops.dagstuhl.de/opus/volltexte/2015/4957/
Sanders, Peter
Parallel Algorithms Reconsidered (Invited Talk)
| pdf-format: |
|
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.
BibTeX - Entry
@InProceedings{sanders:LIPIcs:2015:4957,
author = {Peter Sanders},
title = {{Parallel Algorithms Reconsidered (Invited Talk)}},
booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)},
pages = {10--18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-78-1},
ISSN = {1868-8969},
year = {2015},
volume = {30},
editor = {Ernst W. Mayr and Nicolas Ollinger},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/4957},
URN = {urn:nbn:de:0030-drops-49572},
doi = {10.4230/LIPIcs.STACS.2015.10},
annote = {Keywords: parallel algorithm, algorithm engineering, communication efficient algorithm, polylogarithmic time algorithm, parallel machine model}
}
| Keywords: | parallel algorithm, algorithm engineering, communication efficient algorithm, polylogarithmic time algorithm, parallel machine model | |
| Seminar: | 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015) | |
| Issue date: | 2015 | |
| Date of publication: | 26.02.2015 |
