Hybrid static/dynamic scheduling for already optimized dense matrix factorization

Details Hybrid static/dynamic scheduling for already optimized dense matrix factorization Hybrid static/dynamic scheduling for already optimized dense matrix factorization

2011-10-12

arxiv.org/abs/1110.2677v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

We present the use of a hybrid static/dynamic scheduling strategy of the task dependency graph for direct methods used in dense numerical linear algebra. This strategy provides a balance of data locality, load balance, and low dequeue overhead. We show that the usage of this scheduling in communication avoiding dense factorization leads to significant performance gains. On a 48 core AMD Opteron NUMA machine, our experiments show that we can achieve up to 64% improvement over a version of CALU that uses fully dynamic scheduling, and up to 30% improvement over the version of CALU that uses fully static scheduling. On a 16-core Intel Xeon machine, our hybrid static/dynamic scheduling approach is up to 8% faster than the version of CALU that uses a fully static scheduling or fully dynamic scheduling. Our algorithm leads to speedups over the corresponding routines for computing LU factorization in well known libraries. On the 48 core AMD NUMA machine, our best implementation is up to 110% faster than MKL, while on the 16 core Intel Xeon machine, it is up to 82% faster than MKL. Our approach also shows significant speedups compared with PLASMA on both of these systems.

Affiliated with

Also associated with

No associations

Rating

Hybrid static/dynamic scheduling for already optimized dense matrix factorization 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 Hybrid static/dynamic scheduling for already optimized dense matrix factorization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hybrid static/dynamic scheduling for already optimized dense matrix factorization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-634137