Abstract
Two new vector-reduction techniques are proposed. In addition to saving reduction time and eliminating intermediate storage (as compared to Kuck's method and Kogge's method), the new methods greatly simplify the machine-level programming effort needed to implement vector-reduction operations. An interleaved technique is introduced to reduce multiple vectors to corresponding scalars using the same arithmetic pipeline. The pipeline can be fully utilized by interleaving multiple vector-reduction processes. The proposed techniques can be applied to improve the performance of vector-arithmetic pipelines in scientific supercomputers.
| Original language | English |
|---|---|
| Pages (from-to) | 404-411 |
| Number of pages | 8 |
| Journal | IEEE Transactions on Computers |
| Volume | C-34 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 1985 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'VECTOR-REDUCTION TECHNIQUES FOR ARITHMETIC PIPELINES.'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver