KSR1 multiprocessor: analysis of latency hiding techniques in a sparse solver
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 12, 454-461
- https://doi.org/10.1109/ipps.1993.262832
Abstract
This paper analyzes and evaluates some novel latency hiding features of the KSR1 multiprocessor: prefetch and poststore instructions and automatic updates. As a case study, the authors analyze the performance of an iterative sparse solver which generates irregular communications. They show that automatic updates significantly reduce the amount of communication. Although prefetch and poststore instructions reduce the coherence miss ratios, they do not significantly improve the sparse solver performance due to the overhead in executing these instructions.Keywords
This publication has 8 references indexed in Scilit:
- The Wisconsin Multicube: a new large-scale cache-coherent multiprocessorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The directory-based cache coherence protocol for the DASH multiprocessorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Edge-based finite elements and vector ABCs applied to 3-D scatteringIEEE Transactions on Antennas and Propagation, 1993
- DDM-a cache-only memory architectureComputer, 1992
- Tolerating latency through software-controlled prefetching in shared-memory multiprocessorsJournal of Parallel and Distributed Computing, 1991
- Parallelization and performance of Conjugate Gradient algorithms on the Cedar hierarchical-memory multiprocessorPublished by Association for Computing Machinery (ACM) ,1991
- Software prefetchingPublished by Association for Computing Machinery (ACM) ,1991
- Compiler-directed data prefetching in multiprocessors with memory hierarchiesPublished by Association for Computing Machinery (ACM) ,1990