Matrix-Based Programming Optimization for Improving Memory Hierarchy Performance on Imagine

Author(s):  
Xuejun Yang ◽  
Jing Du ◽  
Xiaobo Yan ◽  
Yu Deng
2008 ◽  
Vol 54 (8) ◽  
pp. 816-828 ◽  
Author(s):  
Lu Peng ◽  
Jih-Kwon Peir ◽  
Tribuvan K. Prakash ◽  
Carl Staelin ◽  
Yen-Kuang Chen ◽  
...  

1999 ◽  
Vol 09 (03) ◽  
pp. 347-360 ◽  
Author(s):  
BASILIO B. FRAGUELA ◽  
RAMÓN DOALLO ◽  
EMILIO L. ZAPATA

Nowadays the performance gap between processors and main memory makes an efficient usage of the memory hierarchy necessary for good program performance. Several techniques have been proposed for this purpose. Nevertheless most of them consider only regular access patterns, while many scientific and numerical applications give place to irregular patterns. A typical case is that of indirect accesses due to the use of compressed storage formats for sparse matrices. This paper describes an analytic approach to model both regular and irregular access patterns. The application modeled is an optimized sparse matrix-dense matrix product algorithm with several levels of blocking. Our model can be directly applied to any memory hierarchy consisting of K-way associative caches. Results are shown for several current microprocessor architectures.


2003 ◽  
Vol 52 (3) ◽  
pp. 321-336 ◽  
Author(s):  
B.B. Fraguela ◽  
R. Doallo ◽  
E.L. Zapata

2003 ◽  
Vol 14 (7) ◽  
pp. 640-654 ◽  
Author(s):  
Neungsoo Park ◽  
Bo Hong ◽  
V.K. Prasanna

2004 ◽  
Vol 30 (2) ◽  
pp. 225-248 ◽  
Author(s):  
B.B. Fraguela ◽  
R. Doallo ◽  
J. Touriño ◽  
E.L. Zapata

Sign in / Sign up

Export Citation Format

Share Document