Data parallel algorithms
W. Daniel Hillis, Guy Lewis Steele · Communications of the ACM · 1986
Parallel computers with tens of thousands of processors are typically programmed in a data parallel style, as opposed to the control parallel style used in multiprocessing. The success of data parallel algorithms—even on problems that at first glance seem inherently serial—suggests that this style of programming has much wider applicability than was previously thought.
Cited by 899 works. doi:10.1145/7902.7903 Open-access PDF
Authors
References
- The Art of Computer Programming
- A programming language
- Sorting networks and their applications
- Can programming be liberated from the von Neumann style?
- Design of a Massively Parallel Processor
- Ultracomputers
- A new implementation technique for applicative languages
- The Illiac IV system
- A survey of highly parallel computing
- Efficient parallel solution of linear systems