Representation-transparent matrix algorithms with scalable performance

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2007, Pages 116-125

  Gottschling, Peter ^a   Wise, David S ^b   Adams, Michael D ^a  

^a INDIANA UNIVERSITY   (United States)

^b 415 Lindley Hall

Author keywords

Dilated integers; Doppled integers; Matrix template library; Morton order

Indexed keywords

COMPUTER SIMULATION; ITERATIVE METHODS; LINEAR ALGEBRA; NATURAL SCIENCES COMPUTING; OBJECT ORIENTED PROGRAMMING;

DILATED INTEGERS; DOPPLED INTEGERS; MATRIX TEMPLATE LIBRARY; MORTON-ORDER;

ALGORITHMS;

EID: 34548020763     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1274971.1274989     Document Type: Conference Paper

References (25)

1. M. D. Adams and D. S. Wise. Fast additions on masked integers. SIGPLAN Not., 41(5):39-45, May 2006. http://doi.acm.org/10.1145/1149982.1149987
2. M. D. Adams and D. S. Wise. Seven at one stroke: Results from a cache-oblivious paradigm for scalable matrix algorithms. In AiSPC '06: Proc. 2006 Wkshp. Memory System Performance and Correctness, pages 41-50. ACM Press, New York, Oct. 2006. http://doi.acm.org/10.1146/1178597.1178604
3. Advanced Micro Devices, Inc., Sunnyvale, CA. AMD Core Math Library (ACML), 2006. http://developer.and.com/acml.jsp
4. P. Bientinesi, B. Gunter, and R. A. van de Geijn. Families of algorithms related to the inversion of a symmetric positive definite matrix. ACM Trans. Math. Softw., 2007. Accepted upon revisions. http://www.cs.utexas.edu/ueers/ pauldj/pubs/TOMS.SPD.pdf
5. S. Chatterjee, A. R. Lebeck, P. K. Patnala, and M. Thottenthodi. Recursive array layouts and fast parallel matrix multiplication. In Proc. 11th ACM Symp. Parallel Algorithms and Architectures, pages 222-231. ACM Press, New York, June 1999. http://doi.acm.org/10.1145/305619.306845
6. S. Chatterjee, A. R. Lebeck, P. K. Patnala, and M. Thottenthodi. Recursive array layouts and fast parallel matrix multiplication. IEEE Trans. Parallel Distrib. Syst., 13(11):1105-1123, Nov. 2002. http://dx.doi.org/10. 1109/TPDS.2002.1058095
7. J. J. Dongarra, H. W. Meuer, E. Strohmaier, and H. Simon. Top 500 supercomputer sites. http://www.top500.org, 2006.
8. J. J. Dongarra, C. B. Moler, J. R. Bunch, and G. W. Stewart. LINPACK Users' Guide. Society for Industrial and Applied Mathematics, Philadelphia, 1979.
9. J. D. Frens and D. S. Wise. Auto-blocking matrix multiplication, or tracking BLAS3 performance from source code. Proc. 6th ACM SIGPLAN Symp. on Principles and Practice of Parallel Program., SIGPLAN Not., 32(7):206-216, July 1997. http://doi.acm.org/10.1146/263764.263789
10. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In Proc. 40th Ann. Symp. Foundations of Computer Science, pages 285-298. IEEE Computer Soc. Press, Washington, DC, Oct. 1999. http://dx.doi.org/10.1109/8FFCS.1999.814600
11. K. Goto and R. A. van de Geijn. Anatomy of high-performance matrix multiplication. Technical report, Univ. of Texas, Austin. Submittted for publication. Visited Sept. 2006. http://www.cs.utexas.edu/ueers/ilame/pubs/GOTO. TOMS.pdf
12. P. Gottschling. Fundamental algebraic concepts in concept-enabled G++. Technical Report 638, Indiana University, Oct. 2006. http://www.cs.indiana.edu/ cgi-bin/techreports/TRNNN.cgi?trnum-TR638
13. K. P. Lorton and D. S. Wise. Analyzing block locality in Morton-order and Morton-hybrid matrices. In P. Foglia, C. A. Prete, S. B. Bartolini, and R. Giorgi, editors, Proc. 7th MEDEA Wkshp. MEmory performance: DEaling with Applications, systems and architecture, pages 5-12. ACM Press, New York, Sept. 2006. http://doi.acm.org/10.1146/1166133.1166134
14. A. Lumsdaine, J. Siek, L.-Q. Lee, and P. Gottschling. The Matrix Template Library home page. http://ww.osl.iu.edu/research/mtl, 2006.
15. G. M. Morton. A computer oriented geodetic data base and a new technique in file sequencing. Technical report, IBM Ltd., Ottawa, Ontario, Mar. 1966.
16. D. R. Musser, G. J. Derge, and A. Saini. STL Tutorial and Reference Guide. Addison-Wesley, 2nd edition, 2001.
17. N. Park, B. Hong, and V. K. Prasanna. Tiling, block data layout, and memory hierarchy performance. IEEE Trans. Parallel Distrib. Syst., 14(7):640-654, July 2003. http://dx.doi.org/10.1109/TPDS.2003.1214317
18. R. Raman and D. S. Wise. Converting to and from dilated integers. Submitted for publication, Dec. 2006. http://www.cs.indiana.edu/~dswise/Arcee/ castingDilated-comb.pdf
19. G. Schrack. Finding neighbors of equal size in linear quadtrees and octrees in constant time. CVGIP: Image Underst, 55(3):221-230, May 1992.
20. J. G. Siek and A. Lumsdaine. The matrix template library: A generic programming approach to high performance numerical linear algebra. In D. Caromel, R. R. Oldehoeft, and M. Tholburn, editors, Computing in Object-Oriented Parallel Environments, volume 1505 of Lecture Notes in Comput. Sci., pages 59-70. Springer, Berlin, 1998. http://springerink.metapress. com/link.asp?id-95b3nt4qngm2kj8d
21. J. Spieß. Untersuchungen des Zeitgewinns durch neue Algorithmen zur Matrix-Multiplication. Computing, 17:23-36, 1976.
22. A. Stepanov. The Standard Template Library -how do you build an algorithm that is both generic and efficient? Byte Magazine, 20(10), Oct. 1995.
23. J. Thiyagalingam, O. Beckmann, and P. H. J. Kelly. Is Morton layout competitive for large two-dimensional arrays, yet? Concur. Comput Prac. Exper., 18(11):1509-1539, Sept. 2006. http://dx.doi.org/10.1002/cpe.1018
24. R. C. Whaley, A. Petitet, and J. J. Dongarra. Automated empirical optimization of software and the ATLAS project. Parallel Computing, 27(1-2):3-35, Jan. 2001. http://dx.doi.org/10.1016/80167-8191(00)00087-9
25. D. S. Wise, J. D. Frens, Y. Gu, and G. A. Alexander. Language support for Morton-order matrices. Proc. 8th ACM SIGPLAN Symp. on Principles and Practice of Parallel Program., SIGPLAN Not., 36(7):24-33, July 2001. http://doi.acm.org/10.1146/879639.379669