Algorithms come with multiple variants which are obtained by changing the mathematical approach from which the algorithm is derived. These variants oer a wide spectrum of performance when implemented on a multicore platform and we seek to understand these dierences in performances from a theoretical point of view. To that aim, we derive and present the critical path lengths of each algorithmic variant for our application problem which enables us to determine a lower bound on the time to solution. This metric provides an intuitive grasp of the performance of a variant and we present numerical experiments to validate the tightness of our lower bounds on practical applications. Our case study is the Cholesky inversion and its use in computing the inverse of a symmetric positive denite matrix.
[1]
Robert A. van de Geijn,et al.
Families of algorithms related to the inversion of a Symmetric Positive Definite matrix
,
2008,
TOMS.
[2]
G. G. Stokes.
"J."
,
1890,
The New Yale Book of Quotations.
[3]
Emmanuel Agullo,et al.
Towards an Efficient Tile Matrix Inversion of Symmetric Positive Definite Matrices on Multicore Architectures
,
2010,
VECPAR.
[4]
Julien Langou,et al.
Parallel tiled QR factorization for multicore architectures
,
2007,
Concurr. Comput. Pract. Exp..
[5]
Julien Langou,et al.
A Class of Parallel Tiled Linear Algebra Algorithms for Multicore Architectures
,
2007,
Parallel Comput..
[6]
Robert A. van de Geijn,et al.
Programming matrix algorithms-by-blocks for thread-level parallelism
,
2009,
TOMS.