Zobrazeno 1 - 10 of 53 pro vyhledávání: '"R. Clint Whaley"'
1
Scaling LAPACK panel operations using parallel cache assignment
Autor: Siju Samuel, Anthony M. Castaldo, R. Clint Whaley
Publikováno v: ACM Transactions on Mathematical Software. 39:1-30
In LAPACK many matrix operations are cast as block algorithms which iteratively process a panel using an unblocked algorithm and then update a remainder matrix using the high performance Level 3 BLAS. The Level 3 BLAS have excellent scaling, but pane
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::31b7bc3874521d6ab1120f415ae17226
https://doi.org/10.1145/2491491.2491492
Zobrazit plný text záznamu
2
Reducing Floating Point Error in Dot Product Using the Superblock Family of Algorithms
Autor: Anthony M. Castaldo, R. Clint Whaley, Anthony T. Chronopoulos
Publikováno v: SIAM Journal on Scientific Computing. 31:1156-1174
This paper discusses both the theoretical and statistical errors obtained by various well-known dot products, from the canonical to pairwise algorithms, and introduces a new and more general framework that we have named superblock which subsumes them
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::114e0a98032723e591ac8f6a47540755
https://doi.org/10.1137/070679946
Zobrazit plný text záznamu
5
Effectively Exploiting Parallel Scale for All Problem Sizes in LU Factorization
Autor: R. Clint Whaley, Rakib Hasan
Publikováno v: IPDPS
LU factorization is one of the most widely-used methods for solving linear equations, and thus its performance underlies a broad range of scientific computing. As architectural trends have replaced clock rate improvements with increases in parallel s
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::08ba58247f2604357a5dfdd13b0728fa
https://doi.org/10.1109/ipdps.2014.109
Zobrazit plný text záznamu
6
Achieving Scalable Parallelization for the Hessenberg Factorization
Autor: R. Clint Whaley, Anthony M. Castaldo
Publikováno v: CLUSTER
Much of dense linear algebra has been successfully blocked to concentrate the majority of its time in the Level~3 BLAS, which are not only efficient for serial computation, but also scale well for parallelism. For the Hessenberg factorization, which
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::eac2afa93eebbd21e6f359919ffc53a7
https://doi.org/10.1109/cluster.2011.16
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje