Name
Abstract | ||
|---|---|---|
As multicore systems continue to gain ground in the high performance computing world, linear algebra algorithms have to be reformulated or new algorithms have to be developed in order to take advantage of the architectural features on these new processors. Fine grain parallelism becomes a major requirement and introduces the necessity of loose synchronization in the parallel execution of an operation. This paper presents algorithms for the Cholesky, LU and QR factorization where the operations can be represented as a sequence of small tasks that operate on square blocks of data. These tasks can be dynamically scheduled for execution based on the dependencies among them and on the availability of computational resources. This may result in out of order execution of tasks which will completely hide the presence of intrinsically sequential tasks in the factorization. Performance comparisons are presented with LAPACK algorithms where parallelism can only be exploited at the level of the BLAS operations and vendor implementations. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.parco.2008.10.002 | parallel computing |
Keywords | DocType | Volume |
cluster computing,linear algebra,qr factorization,dynamic scheduling,out of order execution | Journal | 35 |
Issue | ISSN | Citations |
1 | Parallel Computing | 218 |
PageRank | References | Authors |
13.66 | 31 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alfredo Buttari | 1 | 647 | 53.60 |
| Julien Langou | 2 | 1028 | 71.98 |
| Jakub Kurzak | 3 | 935 | 79.46 |
| Jack J. Dongarra | 4 | 17625 | 2615.79 |