Programming parallel algorithms
Guy E. Blelloch · Communications of the ACM · 1996
In the past 20 years there has been treftlendous progress in developing and analyzing parallel algorithftls.Researchers have developed efficient parallel algorithms to solve most problems for which efficient sequential solutions are known.Although some of these algorithms are efficient only in a theoretical framework, many are quite efficient in practice or have key ideas that have been used in efficient implementations.This research on parallel algorithms has not only improved our general understanding ofparallelism but in several cases has led to improvements in sequential algorithms.Unf:ortunately there has been less success in developing good languages f:or prograftlftling parallel algorithftls,
Cited by 450 works. doi:10.1145/227234.227246 Open-access PDF
Authors
References
- The Design and Analysis of Computer Algorithms
- Introduction to Algorithms
- Computational Geometry--An Introduction.
- Computational Geometry
- The Definition of Standard ML
- The Parallel Evaluation of General Arithmetic Expressions
- Parallel Program Design: A Foundation
- Data parallel algorithms
- High performance Fortran language specification
- An introduction to parallel algorithms