This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Data Compression Methods for Multidimensional Sparse Array Operations Based on the EKMR Scheme
December 2003 (vol. 52 no. 12)
pp. 1640-1646
Chun-Yuan Lin, IEEE Computer Society
Yeh-Ching Chung, IEEE Computer Society

Abstract—In our previous work, we have proposed the extended Karnaugh map representation (EKMR) scheme for multidimensional array representation. In this paper, we propose two data compression schemes, EKMR Compressed Row/Column Storage (ECRS/ECCS), for multidimensional sparse arrays based on the EKMR scheme. To evaluate the proposed schemes, we compare them to the CRS/CCS schemes. Both theoretical analysis and experimental tests were conducted. In the theoretical analysis, we analyze the CRS/CCS and the ECRS/ECCS schemes in terms of the time complexity, the space complexity, and the range of their usability for practical applications. In experimental tests, we compare the compressing time of sparse arrays and the execution time of matrix-matrix addition and matrix-matrix multiplication based on the CRS/CCS and the ECRS/ECCS schemes. The theoretical analysis and experimental results show that the ECRS/ECCS schemes are superior to the CRS/CCS schemes for all the evaluated criteria, except the space complexity in some cases.

[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, Algorithms for Large Symmetric Eignenvalue Computations, vol. 1.Boston, Mass.: 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. Seventh Int'l Workshop Program Comprehension, pp. 200-207, 1999.
[9] V. Kotlyar, K. Pingali, and P. Stodghill, “Compiling Parallel Code for Sparse Matrix Applications,” Proc. Supercomputing Conf., 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. First Merged Int'l Parallel Processing Symp. and Symp. Parallel and Distributed Processing, pp. 117-123, 1998.
[12] M. Ujaldon, E.L. Zapata, S.D. Sharma, and J. Saltz, “Parallelization Techniques for Sparse Matrix Applications,” J. Parallel and Distribution Computing, 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.

Index Terms:
Data compression scheme, sparse array operation, multidimensional sparse array, Karnaugh map, sparse ratio.
Citation:
Chun-Yuan Lin, Yeh-Ching Chung, Jen-Shiuh Liu, "Efficient Data Compression Methods for Multidimensional Sparse Array Operations Based on the EKMR Scheme," IEEE Transactions on Computers, vol. 52, no. 12, pp. 1640-1646, Dec. 2003, doi:10.1109/TC.2003.1252859
Usage of this product signifies your acceptance of the Terms of Use.