Parallel and cache-efficient in-place matrix storage format conversion

ACM Transactions on Mathematical Software

Volumn 38, Issue 3, 2012, Pages

  Gustavson, Fred ^a,b,c   Karlsson, Lars ^b   Kågström, Bo ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UMEÅ UNIVERSITY   (Sweden)

^c 3 Welsh Court ^*  (United States)

Author keywords

Blocked matrix data layout; In place matrix transposition; Parallel and cache efficient algorithms

Indexed keywords

CACHE-EFFICIENT; DATA LAYOUTS; MATRIX TRANSPOSITION; NUMERICAL LIBRARY; PARALLEL ENVIRONMENT; STORAGE FORMATS;

ALGORITHMS; PARALLEL ARCHITECTURES;

MATRIX ALGEBRA;

EID: 84862107202     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/2168773.2168775     Document Type: Article

References (30)

1. ALLTOP, W. O. 1975. A computer algorithm for transposing nonsquare matrices. IEEE Trans. Comput. 24, 10, 1038-1040.
2. BADER, M. AND ZENGER, C. 2006. Cache oblivious matrix multiplication using an element ordering based on a Peano curve. Linear Algebra Its Appl. 417, 2-3, 301-313. (Pubitemid 44093596)
3. BADER, M. AND HEINECKE, A. 2008. Parallel matrix multiplication based on space-filling curves on shared memory multicore platforms. In Proceedings of the Computing Frontiers Conferene and Co-Located Workshops (MAW'08 and WRFT'08). 385-392.
4. BERMAN, M. F. 1958. A method for transposing a matrix. J. A C M 5, 4, 383-384.
5. BOOTHROYD, J. 1967. Algorithm 302: Transpose vector stored array. Comm. ACM 10, 5, 292-293.
6. BREBNER, M. A. AND LAFLIN, S. 1970. Algorithm 380: In-situ transposition of a rectangular matrix. Comm. ACM 13, 5, 324-326.
7. BRENNER, N. 1973. Algorithm 467: Matrix transposition in place. Comm. ACM 16, 11, 692-694.
8. CATE, E. G. AND TWIGG, D. W. 1977. Algorithm 513: Analysis of in-situ transposition. ACM Trans. Math. Softw. 3, 1, 104-110.
9. CHAN, E., VAN DE GEIJN, R., QUINTANA-ORT, E. S., QUINTANA-ORT, G., AND VAN ZEE, F. G. 2008. Programming algorithms-by-blocks for matrix computations on multithreaded architectures. Tech. rep. TR-08-04, Department of Computer Sciences, University of Texas as Austin.
10. DONGARRA, J. AND KURZAK, J. 2009. QR factorization for the CELL Broadband Engine. Sci. Progr. 17, 1-2, 31-42.
11. DOW, M. 1995. Transposing a matrix on a vector computer. Parall. Comput. 21, 12, 1997-2005.
12. ELMROTH, E., GUSTAVSON, F., JONSSON, I., AND KÅGSTRÖ M, B. 2004. Recursive blocked algorithms and hybrid data structures for dense matrix library software. SIAM Rev. 46, 1, 3-45.
13. FICH, F. E., MUNRO, J. I., AND POBLETE, P. V. 1995. Permuting in place. SIAM J. Comput. 24, 2, 266-278.
14. FRASER, D. 1976. Array permutation by index-digit permutation. J. A C M 2 3, 298-309.
15. GALLIVAN, K., JALBY, W., MEIER, U., AND SAMEH, A. 1988. The impact of hierarchical memory systems on linear algebra algorithm design. Int. J. Supercomput. Appl. 2, 1, 12-48.
16. GUSTAVSON, F. 2000. New generalized matrix data structures lead to a variety of high-performance algorithms. In Proceedings of the IFIP TC2/WG2.5 Working Conference on the Architecture of Scientific Software. Kluwer, B.V., 211-234.
17. GUSTAVSON, F. 2008. The relevance of new data structure approaches for dense linear algebra in the new multicore/manycore environments. Tech. rep. RC24599, IBM Research.
18. GUSTAVSON, F. AND SWIRSZCZ, T. 2007. In-place transposition of rectangular matrices. In Proceedings of the Applied Parallel Computing. State of the Art in Scientific Computing Conference. B. Kågström et al. Eds., Lecture Notes in Computer Science, vol. 4699, Springer, 560-569.
19. GUSTAVSON, F., KARLSSON, L., AND KÅGSTRÖ M, B. 2009. Distributed SBP Cholesky factorization algorithms with near-optimal scheduling. ACM Trans. Math. Softw. 36, 2, 11:1-11:25.
20. GUSTAVSON, F., HENRIKSSON, A., JONSSON, I., KÅGSTRÖ M, B., AND LING, P. 1998. Recursive blocked data formats and BLAS's for dense linear algebra algorithms. In Proceedings of the 4th International Workshop on Applied Parallel Computing. Large Scale Scientific and Industrial Problems. Lecture Notes in Computer Science, vol. 1541, 195-206.
21. HONG, B., PARK, N., AND PRASANNA, V. K. 2003. Tiling, block data layout, and memory hierarchy performance. IEEE Trans. Parall. Distrib. Syst. 14, 7, 640-654.
22. HUANG, C. H., JOHNSON, J. R., JOHNSON, R. W., KAUSHIK, S. D., AND SADAYAPPAN, P. 1993. Efficient transposition algorithms for large matrices. In Proceedings of Supercomputing'93. 656-665.
23. IBM. 1986. IBM Engineering and scientific subroutine library. ESSL Guide and Reference, SA22-7272-00.
24. JOHNSON, J. R. 1995. Matrix transposition. Department of Mathematics and Computer Science, Drexel University, Philadelphia, PA 19104. Manuscript. http://cricket.cs.drexel/edu/~jjohnson/2007-08/fell/cs680/paper/transpose.pdf
25. KARLSSON, L. 2009. Blocked in-place transposition with application to storage format conversion. Tech. rep. UMINF 09.01. ISSN 0348-0542, Department of Computing Science, UmeåUniversity, Umeå, Sweden.
26. KNUTH, D. E. 1971. Mathematical analysis of algorithms. In Proceedings of IFIP Congress. North-Holland, 19-27.
27. KNUTH, D. 1998. The Art of Computer Programming. Vols. 1 and 2, 3rd Ed. Addison-Wesley.
28. LAM, M. D., ROTHBERG, E. E., AND WOLF, M. E. 1991. The cache performance and optimizations of blocked algorithms. ACM SIGARCH Computer Architect. News 19, 2, 63-74.
29. PALL, G. AND SEIDEN, E. 1960. A problem in Abelian groups, with application to the transposition of a matrix on an electronic computer. Math. Comput. 14, 70, 189-192.
30. WINDLEY, P. F. 1959. Transposing matrices in a digital computer. Comput. J. 2, 1, 47-48.