Name
Abstract | ||
|---|---|---|
On modern architectures, the performance of 32-bit operations is often at least twice as fast as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit floating point arithmetic, the performance of many dense and sparse linear algebra algorithms can be significantly enhanced while maintaining the 64-bit accuracy of the resulting solution. The approach presented here can apply not only to conventional processors but also to other technologies such as Field Programmable Gate Arrays (FPGA), Graphical Processing Units (GPU), and the STI Cell BE processor. Results on modern processor architectures and the STI Cell BE are presented. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.cpc.2008.11.005 | Computer Physics Communications |
Keywords | DocType | Volume |
02.60.Dc | Journal | 180 |
Issue | ISSN | Citations |
12 | 0010-4655 | 47 |
PageRank | References | Authors |
3.69 | 26 | 8 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marc Baboulin | 1 | 282 | 23.93 |
| Alfredo Buttari | 2 | 647 | 53.60 |
| Jack J. Dongarra | 3 | 17625 | 2615.79 |
| Jakub Kurzak | 4 | 935 | 79.46 |
| Julie Langou | 5 | 105 | 11.92 |
| Julien Langou | 6 | 1028 | 71.98 |
| Piotr Luszczek | 7 | 1144 | 99.50 |
| Stanimire Tomov | 8 | 1214 | 102.02 |