Abstract
This paper discusses implementations of various forms of the QR factorization on the Denelcor HEP. The motivation for examining these implementations was to investigate performance issues that we might expect to face in developing mathematical software for linear algebra problems on emerging parallel architectures. The Denelcor HEP is particularly well suited for such a study because it offers the possibility of very fine grain parallelism through low overhead synchronization primitives. We point out certain synchronization problems that arise within the more lightly coupled variations of the algorithm and offer a comparison of the performance of these variations.
Original language | English |
---|---|
Pages (from-to) | 39-46 |
Number of pages | 8 |
Journal | Proceedings of the Hawaii International Conference on System Sciences |
State | Published - 1985 |
Externally published | Yes |
Funding
* An earlier version of this paper appeared in the proceedings of the Eighteenth Annual Hawaii International Conference on System Sciences in January 1985. ** Work supported in part by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy under Contract g-31-109-Eng-33.
Funders | Funder number |
---|---|
Office of Energy Research | |
U.S. Department of Energy | g-31-109-Eng-33 |