SuperMatrix out-of-order scheduling of matrix operations for SMP and multi-core architectures

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2007, Pages 116-125

  Chan, Ernie ^a   Quintana Orti, Enrique S ^b   Quintana Orti, Gregorio ^b   Van De Geijn, Robert ^a  

^a University of Texas at Austin   (United States)

^b UNIVERSITAT JAUME I   (Spain)

Author keywords

Data affinity; Data flow parallelism; Dense linear algebra libraries; Dynamic scheduling; Out of order execution

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; DATA PROCESSING; PROGRAM PROCESSORS; SCHEDULING;

DATA AFFINITY; DATA-FLOW PARALLELISM; DENSE LINEAR ALGEBRA LIBRARIES; OUT-OF-ORDER EXECUTION;

MATRIX ALGEBRA;

EID: 35248843628     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1248377.1248397     Document Type: Conference Paper

References (33)

1. C. Addison, Y. Ren, and M. van Waveren. OpenMP issues arising in the development of parallel BLAS and LAPACK libraries. Scientific Programming, 11(2), 2003.
2. R. C. Agarwal and F. G. Gustavson. Vector and parallel algorithms for Cholesky factorization on IBM 3090. In Supercomputing '89: Proceedings of the 1989 ACM/IEEE Conference on Supercomputing, pages 225-233, New York, NY, USA, 1989. ACM Press.
3. B. S. Andersen, J. Waśniewski, and F. G. Gustavson. A recursive formulation of Cholesky factorization of a matrix in packed storage. A CM Trans. Math. Soft., 27(2):214-244, 2001.
4. E. Anderson, Z. Bai, C. Bischof, L. S. Blackford, J. Demmel, J. J. Dongarra, J. D. Croz, S. Hammarling, A. Greenbaum, A. McKenney, and D. Sorensen. LAPACK Users' guide (third ed.). Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1999.
5. N. S. Arora, R. D. Blumofe, and C. G. Plaxton. Thread scheduling for multiprogrammed multiprocessors. Theory of Computing Systems, 4:115-144, 2001.
6. P. Bientinesi, J. A. Gunnels, M. E. Myers, E. S. Quintana-Ortí, and R. A. van de Geijn. The science of deriving dense linear algebra algorithms. ACM Trans. Math. Soft., 31(1):1-26, March 2005.
7. P. Bientinesi, B. Gunter, and R. van de Geijn. Families of algorithms related to the inversion of a symmetric positive definite matrix. FLAME Working Note #19 TR-2006-20, The University of Texas at Austin, Department of Computer Sciences, 2006.
8. P. Bientinesi, E. S. Quintana-Ortí, and R. A. van de Geijn. Representing linear algebra algorithms in code: The FLAME application programming interfaces. ACM Trans. Math. Soft., 31(1):27-59, March 2005.
9. P. Bientinesi and R. A. van de Geijn. Representing dense linear algebra algorithms: A farewell to indices. FLAME Working Note #17 TR-2006-10, The University of Texas at Austin, Department of Computer Sciences, 2006.
10. S. Chatterjee, A. R. Lebeck, P. K. Patnala, and M. Thottethodi. Recursive array layouts and fast matrix multiplication. IEEE Trans. on Parallel and Distributed Systems, 13(11):1105-1123, 2002.
11. J. Choi, J. J. Dongarra, R. Pozo, and D. W. Walker. ScaLAPACK: A scalable linear algebra library for distributed memory concurrent computers. In Proceedings of the Fourth Symposium on the Frontiers of Massively Parallel Computation, pages 120-127. IEEE Comput. Soc. Press, 1992.
12. T. Collins and J. C. Browne. Matrix++: An object-oriented environment for parallel high-perfomance matrix computations. In Proceedings of the Hawaii International Conference on Systems and Software, 1995.
13. T. S. Collins. Efficient Matrix Computations through Hierarchical Type Specifications. PhD thesis, The University of Texas at Austin, 1996.
14. J. J. Dongarra, J. Du Croz, S. Hammarling, and I. Duff. A set of level 3 basic linear algebra subprograms. ACM Trans. Math. Soft., 16(1):1-17, March 1990.
15. E. Elmroth, F. Gustavson, I. Jonsson, and B. Kagstrom. Recursive blocked algorithms and hybrid data structures for dense matrix library software. SIAM Review, 46(1):3-45, 2004.
16. K. Goto. http://www.tacc.utexas.edu/resources/software.
17. J. A. Gunnels, F. G. Gustavson, G. M. Henry, and R. A. van de Geijn. FLAME: Formal linear algebra methods environment. ACM Trans. Math. Soft., 27(4):422-455, December 2001.
18. F. G. Gustavson, L. Karlsson, and B. Kagstrom. Three algorithms on distributed memory using packed storage. Computational Science - Para 2006. B. Kagstrom, E. Elmroth, eds., accepted for Lecture Notes in Computer Science. Springer-Verlag, 2007.
19. G. Henry. BLAS based on block data, structures. Theory Center Technical Report CTC92TR89, Cornell University, February 1992.
20. J. R. Herrero. A framework for efficient execution of matrix computations. PhD thesis, Polytechnic University of Catalonia, Spain, 2006.
21. IBM. IBM Engineering and Scientific Subroutine Library for AIX Version 3, Release 3. IBM Pub. No. SA22-7272-04, December 2001.
22. D. Irony, G. Shklarski, and S. Toledo. Parallel and fully recursive multifrontal sparse Cholesky. Future Gener. Comput. Syst., 20(3):425-440, 2004.
23. J. Kurzak and J. Dongarra. Implementing linear algebra routines on multi-core processors with pipelining and a look ahead. LAPACK Working Note 178 UT-CS-06-581, University of Tennessee, September 2006.
24. C. Leiserson and A. Plaat. Programming parallel applications in Cilk. SINEWS: SIAM News, 31, 1998.
25. T. M. Low and R. van de Geijn. An API for manipulating matrices stored by blocks. FLAME Working Note #12 TR-2004-15, The University of Texas at Austin, Department of Computer Sciences, May 2004.
26. H. Lu, A. L. Cox, S. Dwarkadas, R. Rajamony, and W. Zwaenepoel. Compiler and software distributed shared memory support for irregular applications. In PPOPP '97: Proceedings of the Sixth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 48-56, New York, NY, USA, 1997. ACM Press.
27. N. Park, B. Hong, and V. K. Prasanna. Tiling, block data layout, and memory hierarchy performance. IEEE Trans. on Parallel and Distributed Systems, 14(7):640-654, 2003.
28. P. Strazdins. A comparison of lookahead and algorithmic blocking techniques for parallel matrix factorization. International Journal of Parallel and Distributed Systems and Networks, 4(1):26-35, June 2001.
29. R. Thekkath and S. J. Eggers. Impact of sharing-based thread placement on multithreaded architecture. In Proceedings of the 21th Annual International Symposium on Computer Architecture, pages 176-186, 1994.
30. R. Tomasulo. An efficient algorithm for exploiting multiple arithmetic units. IBM J. of Research and Development, 11(1), 1967.
31. V. Valsalam and A. Skjellum. A framework for high-performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low-level kernels. Concurrency and Computation: Practice and Experience, 14(10):805-840, 2002.
32. R. von Hanxleden, K. Kennedy, C. H. Koelbel, R. Das, and J. H. Saltz. Compiler analysis for irregular problems in Fortran D. In 1992 Workshop on Languages and Compilers for Parallel Computing, number 757, pages 97-111, New Haven, Conn., 1992. Berlin: Springer-Verlag.
33. K. Yotov, T. Roeder, K. Pingali, J. Gunnels, and F. Gustavson. An experimental comparison of cache-oblivious and cache-aware programs. In SPAA '07: Symposium on Parallelism in Algorithms and Architectures, June 2007.