A Critical Path Approach to Analyzing Parallelism of Algorithmic Variants. Application to Cholesky Inversion

Details A Critical Path Approach to Analyzing Parallelism of Algorithmic Variants. Application to Cholesky Inversion A Critical Path Approach to Analyzing Parallelism of Algorithmic Variants. Application to Cholesky Inversion

2010-10-11

arxiv.org/abs/1010.2000v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

Algorithms come with multiple variants which are obtained by changing the mathematical approach from which the algorithm is derived. These variants offer a wide spectrum of performance when implemented on a multicore platform and we seek to understand these differences 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 definite matrix.

Affiliated with

Also associated with

No associations

Rating

A Critical Path Approach to Analyzing Parallelism of Algorithmic Variants. Application to Cholesky Inversion does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Critical Path Approach to Analyzing Parallelism of Algorithmic Variants. Application to Cholesky Inversion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Critical Path Approach to Analyzing Parallelism of Algorithmic Variants. Application to Cholesky Inversion will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-658175