Loading...
Please wait, while we are loading the content...
Similar Documents
Parallel Algorithms Reconsidered
| Content Provider | Semantic Scholar |
|---|---|
| Author | Sanders, P. |
| Copyright Year | 2015 |
| 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. 1998 ACM Subject Classification F.2 Analysis of Algorithms and Problem Complexity, F.1.2 Parallelism and Concurrency |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://drops.dagstuhl.de/opus/volltexte/2015/4957/pdf/57.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
