V. Valsalam and A. Skjellum. A framework for high-performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low-level kernels. Concurrency and Computation: Practice and Experience, 14(10):805--839, Aug. 2002. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Reducing TLB Misses in Matrix Multiplication - Goto, Geijn (2002) (4 citations) (Correct)
.... great deal of attention for matrix multiplication and many other important computations such as matrix factorizations [11, 17, 29, 22, 15, 26, 19] Others have focused on (also) applying recursion to produce new data formats for matrices, instead of the traditional FORTRAN and C data structures [27]. Our view is that recursion is very powerful and excellent results are obtainable. The techniques presented in this paper are in some sense orthogonal to those addressed by recursion in data storage and algorithm implementation. 3 Basic Architectural Considerations In this section we present, ....
Vinod Valsalam and Anthony Skjellum. A framework for high-performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low-level kernels. Concurrency and Computation: Practice and Experience, 2002.
Improving the Performance of Morton Layout by Array - Alignment And Loop (Correct)
No context found.
V. Valsalam and A. Skjellum. A framework for high-performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low-level kernels. Concurrency and Computation: Practice and Experience, 14(10):805--839, Aug. 2002.
Improving the Performance of Morton Layout by Array.. - Thiyagalingam.. (2003) (Correct)
No context found.
V. Valsalam and A. Skjellum. A framework for high-performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low-level kernels. Concurrency and Computation: Practice and Experience, 14(10):805--839, Aug. 2002.
Improving the Performance of Morton Layout by Array.. - Thiyagalingam.. (2003) (Correct)
No context found.
V. Valsalam and A. Skjellum. A framework for high-performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low-level kernels. Concurrency and Computation: Practice and Experience, 14(10):805--839, Aug. 2002.
Matrix Factorization Using a Block-Recursive Structure and.. - Frens (Correct)
No context found.
V. Valsalam and A. Sjkellum. A framework for high-performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low-level kernels. Concur. Comput. Prac. Exper., page in press.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC