Efficient Data Compression Methods for Multidimensional Sparse Array Operations Based on the EKMR Scheme

IEEE Transactions on Computers

Volumn 52, Issue 12, 2003, Pages 1640-1646

  Lin, Chun Yuan ^a   Chung, Yeh Ching ^b   Liu, Jen Shiuh ^a  

^a FENG CHIA UNIVERSITY   (Taiwan)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Data compression scheme; Karnaugh map; Multidimensional sparse array; Sparse array operation; Sparse ratio

Indexed keywords

ARRAYS; COMPUTATIONAL COMPLEXITY; COSTS; DATA REDUCTION; MATRIX ALGEBRA;

MULTIDIMENSIONAL SPARSE ARRAYS; SPARSE ARRAY OPERATION; SPARSE RATIO;

DATA COMPRESSION;

EID: 0348011367     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2003.1252859     Document Type: Article

References (16)

1. G. Bandera, P.P. Trabado, and E.L. Zapata, "Local Enumeration Techniques for Sparse Algorithms," Proc. Int'l Symp. Parallel Processing, pp. 52-56, Apr. 1998.
2. R. Barrett, M. Berry, T.F. Chan, J. Demmel, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. Van, Templates for the Solution of Linear Systems: Building Blocks for the Iterative Methods, second ed. SIAM, 1994.
3. R.G. Chang, T.R. Chung, and J.K. Lee, "Parallel Sparse Supports for Array Intrinsic Functions of Fortran 90," J. Supercomputing, vol. 18, no. 3, pp. 305-339, Mar. 2001.
4. J.K. Cullum and R.A. Willoughby, Lanczos Algorithms for Large Symmetric Eignenvalue Computations. Boston: Birkhauser, 1985.
5. I. Duff, R. Grimes, and J. Lewis, "User's Guide for the Harwell-Boeing Sparse Matrix Collection (Release I)," Technical Report RAL 92-086, Rutherford Appleton Laboratory, 1992.
6. B.B. Fraguela, R. Doallo, and E.L. Zapata, "Cache Probabilistic Modeling for Basic Sparse Algebra Kernels Involving Matrices with a Non-Uniform Distribution," Proc. Euromicro Conf., pp. 345-348, Aug. 1998.
7. G.H. Golub and C.F. Van Loan, Matrix Computations, second ed. Baltimore, Md.; The John Hopkins Univ. Press, 1989.
8. C.W. Kebler and C.H. Smith, "The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations," Proc. Int'l Workshop Program Comprehension, pp. 200-207, May 1999.
9. V. Kotlyar, K. Pingali, and P. Stodghill, "Compiling Parallel Code for Sparse Matrix Applications," Proc. Supercomputing Conf., pp. 20-38, Aug. 1997.
10. C.Y. Lin, J.S. Liu, and Y.C. Chung, "Efficient Representation Scheme for Multi-Dimensional Array Operations," IEEE Trans. Computers, vol. 51, no. 3, pp. 327-345, Mar. 2002.
11. P.D. Sulatycke and K. Ghose, "Caching Efficient Multithreaded Fast Multiplication of Sparse Matrices," Proc. Merged Int'l Symp. Parallel Processing and Parallel and Distributed Processing, pp. 117-124, 1998.
12. M. Ujaldon, E.L. Zapata, S.D. Sharma, and J. Saltz, "Parallelization Techniques for Sparse Matrix Applications," J. Parallel and Distributed Computing, vol. 38, no. 2, pp. 256-266, Nov. 1996.
13. M. Ujaldon, E.L. Zapata, B.M. Chapman, and H.P. Zima, "Vienna-Fortran/HPF Extensions for Sparse and Irregular Problems and Their Compilation," IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 10, pp. 1068-1083, Oct. 1997.
14. J.B. White and P. Sadayappan, "On Improving the Performance of Sparse Matrix-Vector Multiplication," Proc. Int'l Conf. High Performance Computing, pp. 711-725, 1997.
15. E.L. Zapata, O. Plata, R. Asenjo, and G.P. Trabado, "Data-Parallel Support for Numerical Irregular Problems," J. Parallel Computing, vol. 25, nos. 13-14, pp. 1971-1944, 1999.
16. L.H. Ziantz, C.C. Ozturan, and B.K. Szymanski, "Run-Time Optimization of Sparse Matrix-Vector Multiplication on SIMD Machines," Proc. Int'l Conf. Parallel Architectures and Languages, pp. 313-322, July 1994.