Parallelizing complex scans and reductions
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
List ranking and list scan on the Cray C-90
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
A generalized vision of some parallel bidiagonal systems solvers
ICS '94 Proceedings of the 8th international conference on Supercomputing
Flattening and parallelizing irregular, recurrent loop nests
PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
| Hi-index | 0.01 |
The article presents a variation of the partition method for solving m/sup th/-order linear recurrences that is well-suited to vector multiprocessors. The algorithm fully utilizes both vector and multiprocessor capabilities, and reduces the number of memory accesses as compared to the more commonly used version of the partition method. The variation uses a general loop restructuring technique called loop raking. The article describes an implementation of this technique on the CRAY Y-MP and presents performance results on first- and second-order linear recurrences, as well as on Livermore loops, 5, 11 and 19, which are based on linear recurrences.