2016-05-26 19:30:19 +02:00
|
|
|
# BLAS libraries benchmarks
|
|
|
|
Andrzej Wójtowicz
|
|
|
|
|
2016-05-31 00:00:52 +02:00
|
|
|
Document generation date: 2016-05-30 23:06:11
|
2016-05-26 19:30:19 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
## Table of Contents
|
|
|
|
|
|
|
|
1. [Configuration](#configuration)
|
|
|
|
2. [Results per host](#results-per-host)
|
2016-05-26 19:39:26 +02:00
|
|
|
* [Intel Core i5-4590 + NVIDIA GeForce GT 430](#intel-core-i5-4590--nvidia-geforce-gt-430)
|
2016-05-31 00:00:52 +02:00
|
|
|
* [Intel Core i5-4590 + NVIDIA GeForce GTX 750 Ti](#intel-core-i5-4590--nvidia-geforce-gtx-750-ti)
|
2016-05-26 19:30:19 +02:00
|
|
|
* [Intel Core i5-3570](#intel-core-i5-3570)
|
|
|
|
* [Intel Core i3-2120](#intel-core-i3-2120)
|
|
|
|
* [Intel Core i3-3120M](#intel-core-i3-3120m)
|
2016-05-31 00:00:52 +02:00
|
|
|
* [Intel Core i5-3317U + NVIDIA GeForce GT 630M](#intel-core-i5-3317u--nvidia-geforce-gt-630m)
|
2016-05-26 19:30:19 +02:00
|
|
|
3. [Results per library](#results-per-library)
|
|
|
|
* [Netlib](#netlib)
|
|
|
|
* [Atlas (st)](#atlas-st)
|
|
|
|
* [OpenBLAS](#openblas)
|
|
|
|
* [Atlas (mt)](#atlas-mt)
|
|
|
|
* [GotoBLAS2](#gotoblas2)
|
|
|
|
* [MKL](#mkl)
|
|
|
|
* [BLIS](#blis)
|
2016-05-31 00:00:52 +02:00
|
|
|
* [cuBLAS](#cublas)
|
2016-05-26 19:30:19 +02:00
|
|
|
|
|
|
|
***
|
|
|
|
|
|
|
|
## Configuration
|
|
|
|
|
2016-05-31 00:00:52 +02:00
|
|
|
**R software**: [Microsoft R Open](https://mran.microsoft.com/open/) (3.2.4).
|
2016-05-26 19:30:19 +02:00
|
|
|
|
|
|
|
**Libraries**:
|
|
|
|
|
|
|
|
|CPU (single-threaded)|CPU (multi-threaded)|GPU|
|
|
|
|
|---|---|---|
|
2016-05-31 00:00:52 +02:00
|
|
|
|[Netlib](http://www.netlib.org/) (debian package, blas 1.2.20110419, lapack 3.5.0)|[OpenBLAS](http://www.openblas.net/) (debian package, 0.2.12)|[NVIDIA cuBLAS](https://developer.nvidia.com/cublas) (NVBLAS 6.5 + Intel MKL)|
|
|
|
|
|[ATLAS](http://math-atlas.sourceforge.net/) (debian package, 3.10.2)|[ATLAS](http://math-atlas.sourceforge.net/) (dev branch, 3.11.38)| |
|
|
|
|
| |[GotoBLAS2](https://prs.ism.ac.jp/~nakama/SurviveGotoBLAS2/) (Survive fork, 3.141)| |
|
|
|
|
| |[Intel MKL](https://mran.microsoft.com/download/) (part of RevoMath package, 3.2.4)| |
|
|
|
|
| |[BLIS](https://github.com/flame/blis) (dev branch, 0.2.0+/17.05.2016)| |
|
2016-05-26 19:30:19 +02:00
|
|
|
|
|
|
|
**Hosts**:
|
|
|
|
|
|
|
|
|No.|CPU|GPU|
|
|
|
|
|---|---|---|
|
|
|
|
|1.|[Intel Core i5-4590](http://ark.intel.com/products/80815/Intel-Core-i5-4590-Processor-6M-Cache-up-to-3_70-GHz)|[NVIDIA GeForce GT 430](http://www.geforce.com/hardware/desktop-gpus/geforce-gt-430/specifications)|
|
2016-05-31 00:00:52 +02:00
|
|
|
|2.|[Intel Core i5-4590](http://ark.intel.com/products/80815/Intel-Core-i5-4590-Processor-6M-Cache-up-to-3_70-GHz)|[NVIDIA GeForce GTX 750 Ti](http://www.geforce.com/hardware/desktop-gpus/geforce-gtx-750-ti/specifications)|
|
|
|
|
|3.|[Intel Core i5-3570](http://ark.intel.com/products/65702/Intel-Core-i5-3570-Processor-6M-Cache-up-to-3_80-GHz)| - |
|
|
|
|
|4.|[Intel Core i3-2120](http://ark.intel.com/products/53426/Intel-Core-i3-2120-Processor-3M-Cache-3_30-GHz)| - |
|
|
|
|
|5.|[Intel Core i3-3120M](http://ark.intel.com/products/71465/Intel-Core-i3-3120M-Processor-3M-Cache-2_50-GHz)| - |
|
|
|
|
|6.|[Intel Core i5-3317U](http://ark.intel.com/products/65707/Intel-Core-i5-3317U-Processor-3M-Cache-up-to-2_60-GHz)|[NVIDIA GeForce GT 630M](http://www.geforce.com/hardware/notebook-gpus/geforce-gt-630m/specifications)|
|
2016-05-26 19:30:19 +02:00
|
|
|
|
|
|
|
**Benchmarks**: [Urbanek](http://r.research.att.com/benchmarks/R-benchmark-25.R), [Revolution](https://gist.github.com/andrie/24c9672f1ea39af89c66#file-rro-mkl-benchmark-r), [Gcbd](https://cran.r-project.org/web/packages/gcbd/vignettes/gcbd.pdf).
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
# Results per host
|
|
|
|
|
|
|
|
## Intel Core i5-4590 + NVIDIA GeForce GT 430
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Urbanek benchmark
|
|
|
|
|
|
|
|
#### 2800x2800 cross-product matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h1_b1_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear regr. over a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h1_b1_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Eigenvalues of a 640x640 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h1_b1_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Determinant of a 2500x2500 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h1_b1_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky decomposition of a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h1_b1_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Inverse of a 1600x1600 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h1_b1_t6.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Escoufier's method on a 45x45 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h1_b1_t7.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Revolution benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h1_b2_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky Factorization
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h1_b2_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h1_b2_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Principal Components Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h1_b2_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear Discriminant Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h1_b2_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Gcbd benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h1_b3_t1.png)![](gen/img/img_ph_h1_b3_t1b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### QR Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h1_b3_t2.png)![](gen/img/img_ph_h1_b3_t2b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h1_b3_t3.png)![](gen/img/img_ph_h1_b3_t3b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Triangular Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h1_b3_t4.png)![](gen/img/img_ph_h1_b3_t4b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-05-31 00:00:52 +02:00
|
|
|
## Intel Core i5-4590 + NVIDIA GeForce GTX 750 Ti
|
2016-05-26 19:30:19 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Urbanek benchmark
|
|
|
|
|
|
|
|
#### 2800x2800 cross-product matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h2_b1_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear regr. over a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h2_b1_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Eigenvalues of a 640x640 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h2_b1_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Determinant of a 2500x2500 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h2_b1_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky decomposition of a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h2_b1_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Inverse of a 1600x1600 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h2_b1_t6.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Escoufier's method on a 45x45 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h2_b1_t7.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Revolution benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h2_b2_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky Factorization
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h2_b2_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h2_b2_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Principal Components Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h2_b2_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear Discriminant Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h2_b2_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Gcbd benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h2_b3_t1.png)![](gen/img/img_ph_h2_b3_t1b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### QR Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h2_b3_t2.png)![](gen/img/img_ph_h2_b3_t2b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h2_b3_t3.png)![](gen/img/img_ph_h2_b3_t3b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Triangular Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h2_b3_t4.png)![](gen/img/img_ph_h2_b3_t4b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-05-31 00:00:52 +02:00
|
|
|
## Intel Core i5-3570
|
2016-05-26 19:30:19 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Urbanek benchmark
|
|
|
|
|
|
|
|
#### 2800x2800 cross-product matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h3_b1_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear regr. over a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h3_b1_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Eigenvalues of a 640x640 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h3_b1_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Determinant of a 2500x2500 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h3_b1_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky decomposition of a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h3_b1_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Inverse of a 1600x1600 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h3_b1_t6.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Escoufier's method on a 45x45 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h3_b1_t7.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Revolution benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h3_b2_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky Factorization
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h3_b2_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h3_b2_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Principal Components Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h3_b2_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear Discriminant Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h3_b2_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Gcbd benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h3_b3_t1.png)![](gen/img/img_ph_h3_b3_t1b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### QR Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h3_b3_t2.png)![](gen/img/img_ph_h3_b3_t2b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h3_b3_t3.png)![](gen/img/img_ph_h3_b3_t3b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Triangular Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h3_b3_t4.png)![](gen/img/img_ph_h3_b3_t4b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-05-31 00:00:52 +02:00
|
|
|
## Intel Core i3-2120
|
2016-05-26 19:30:19 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Urbanek benchmark
|
|
|
|
|
|
|
|
#### 2800x2800 cross-product matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h4_b1_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear regr. over a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h4_b1_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Eigenvalues of a 640x640 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h4_b1_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Determinant of a 2500x2500 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h4_b1_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky decomposition of a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h4_b1_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Inverse of a 1600x1600 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h4_b1_t6.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Escoufier's method on a 45x45 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h4_b1_t7.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Revolution benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h4_b2_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky Factorization
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h4_b2_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h4_b2_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Principal Components Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h4_b2_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear Discriminant Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h4_b2_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Gcbd benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h4_b3_t1.png)![](gen/img/img_ph_h4_b3_t1b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### QR Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h4_b3_t2.png)![](gen/img/img_ph_h4_b3_t2b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h4_b3_t3.png)![](gen/img/img_ph_h4_b3_t3b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Triangular Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h4_b3_t4.png)![](gen/img/img_ph_h4_b3_t4b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-05-31 00:00:52 +02:00
|
|
|
## Intel Core i3-3120M
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Urbanek benchmark
|
|
|
|
|
|
|
|
#### 2800x2800 cross-product matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h5_b1_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear regr. over a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h5_b1_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Eigenvalues of a 640x640 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h5_b1_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Determinant of a 2500x2500 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h5_b1_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky decomposition of a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h5_b1_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Inverse of a 1600x1600 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h5_b1_t6.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Escoufier's method on a 45x45 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h5_b1_t7.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Revolution benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h5_b2_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky Factorization
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h5_b2_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h5_b2_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Principal Components Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h5_b2_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear Discriminant Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h5_b2_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Gcbd benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h5_b3_t1.png)![](gen/img/img_ph_h5_b3_t1b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### QR Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h5_b3_t2.png)![](gen/img/img_ph_h5_b3_t2b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h5_b3_t3.png)![](gen/img/img_ph_h5_b3_t3b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Triangular Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h5_b3_t4.png)![](gen/img/img_ph_h5_b3_t4b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
## Intel Core i5-3317U + NVIDIA GeForce GT 630M
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Urbanek benchmark
|
|
|
|
|
|
|
|
#### 2800x2800 cross-product matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h6_b1_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear regr. over a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h6_b1_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Eigenvalues of a 640x640 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h6_b1_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Determinant of a 2500x2500 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h6_b1_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky decomposition of a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h6_b1_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Inverse of a 1600x1600 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h6_b1_t6.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Escoufier's method on a 45x45 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h6_b1_t7.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Revolution benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h6_b2_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky Factorization
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h6_b2_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h6_b2_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Principal Components Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h6_b2_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear Discriminant Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h6_b2_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Gcbd benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h6_b3_t1.png)![](gen/img/img_ph_h6_b3_t1b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### QR Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h6_b3_t2.png)![](gen/img/img_ph_h6_b3_t2b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h6_b3_t3.png)![](gen/img/img_ph_h6_b3_t3b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Triangular Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_ph_h6_b3_t4.png)![](gen/img/img_ph_h6_b3_t4b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-05-26 19:30:19 +02:00
|
|
|
|
|
|
|
# Results per library
|
|
|
|
|
|
|
|
## Netlib
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Urbanek benchmark
|
|
|
|
|
|
|
|
#### 2800x2800 cross-product matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l1_b1_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear regr. over a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l1_b1_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Eigenvalues of a 640x640 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l1_b1_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Determinant of a 2500x2500 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l1_b1_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky decomposition of a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l1_b1_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Inverse of a 1600x1600 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l1_b1_t6.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Escoufier's method on a 45x45 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l1_b1_t7.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Revolution benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l1_b2_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky Factorization
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l1_b2_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l1_b2_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Principal Components Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l1_b2_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear Discriminant Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l1_b2_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Gcbd benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l1_b3_t1.png)![](gen/img/img_pl_l1_b3_t1b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### QR Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l1_b3_t2.png)![](gen/img/img_pl_l1_b3_t2b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l1_b3_t3.png)![](gen/img/img_pl_l1_b3_t3b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Triangular Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l1_b3_t4.png)![](gen/img/img_pl_l1_b3_t4b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
## ATLAS (st)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Urbanek benchmark
|
|
|
|
|
|
|
|
#### 2800x2800 cross-product matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l2_b1_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear regr. over a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l2_b1_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Eigenvalues of a 640x640 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l2_b1_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Determinant of a 2500x2500 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l2_b1_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky decomposition of a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l2_b1_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Inverse of a 1600x1600 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l2_b1_t6.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Escoufier's method on a 45x45 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l2_b1_t7.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Revolution benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l2_b2_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky Factorization
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l2_b2_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l2_b2_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Principal Components Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l2_b2_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear Discriminant Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l2_b2_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Gcbd benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l2_b3_t1.png)![](gen/img/img_pl_l2_b3_t1b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### QR Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l2_b3_t2.png)![](gen/img/img_pl_l2_b3_t2b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l2_b3_t3.png)![](gen/img/img_pl_l2_b3_t3b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Triangular Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l2_b3_t4.png)![](gen/img/img_pl_l2_b3_t4b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
## OpenBLAS
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Urbanek benchmark
|
|
|
|
|
|
|
|
#### 2800x2800 cross-product matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l3_b1_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear regr. over a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l3_b1_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Eigenvalues of a 640x640 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l3_b1_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Determinant of a 2500x2500 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l3_b1_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky decomposition of a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l3_b1_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Inverse of a 1600x1600 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l3_b1_t6.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Escoufier's method on a 45x45 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l3_b1_t7.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Revolution benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l3_b2_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky Factorization
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l3_b2_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l3_b2_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Principal Components Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l3_b2_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear Discriminant Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l3_b2_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Gcbd benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l3_b3_t1.png)![](gen/img/img_pl_l3_b3_t1b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### QR Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l3_b3_t2.png)![](gen/img/img_pl_l3_b3_t2b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l3_b3_t3.png)![](gen/img/img_pl_l3_b3_t3b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Triangular Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l3_b3_t4.png)![](gen/img/img_pl_l3_b3_t4b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
## ATLAS (mt)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Urbanek benchmark
|
|
|
|
|
|
|
|
#### 2800x2800 cross-product matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l4_b1_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear regr. over a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l4_b1_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Eigenvalues of a 640x640 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l4_b1_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Determinant of a 2500x2500 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l4_b1_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky decomposition of a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l4_b1_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Inverse of a 1600x1600 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l4_b1_t6.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Escoufier's method on a 45x45 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l4_b1_t7.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Revolution benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l4_b2_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky Factorization
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l4_b2_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l4_b2_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Principal Components Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l4_b2_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear Discriminant Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l4_b2_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Gcbd benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l4_b3_t1.png)![](gen/img/img_pl_l4_b3_t1b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### QR Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l4_b3_t2.png)![](gen/img/img_pl_l4_b3_t2b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l4_b3_t3.png)![](gen/img/img_pl_l4_b3_t3b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Triangular Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l4_b3_t4.png)![](gen/img/img_pl_l4_b3_t4b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
## GotoBLAS2
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Urbanek benchmark
|
|
|
|
|
|
|
|
#### 2800x2800 cross-product matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l5_b1_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear regr. over a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l5_b1_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Eigenvalues of a 640x640 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l5_b1_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Determinant of a 2500x2500 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l5_b1_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky decomposition of a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l5_b1_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Inverse of a 1600x1600 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l5_b1_t6.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Escoufier's method on a 45x45 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l5_b1_t7.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Revolution benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l5_b2_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky Factorization
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l5_b2_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l5_b2_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Principal Components Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l5_b2_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear Discriminant Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l5_b2_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Gcbd benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l5_b3_t1.png)![](gen/img/img_pl_l5_b3_t1b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### QR Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l5_b3_t2.png)![](gen/img/img_pl_l5_b3_t2b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l5_b3_t3.png)![](gen/img/img_pl_l5_b3_t3b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Triangular Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l5_b3_t4.png)![](gen/img/img_pl_l5_b3_t4b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
## MKL
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Urbanek benchmark
|
|
|
|
|
|
|
|
#### 2800x2800 cross-product matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l6_b1_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear regr. over a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l6_b1_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Eigenvalues of a 640x640 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l6_b1_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Determinant of a 2500x2500 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l6_b1_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky decomposition of a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l6_b1_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Inverse of a 1600x1600 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l6_b1_t6.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Escoufier's method on a 45x45 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l6_b1_t7.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Revolution benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l6_b2_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky Factorization
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l6_b2_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l6_b2_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Principal Components Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l6_b2_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear Discriminant Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l6_b2_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Gcbd benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l6_b3_t1.png)![](gen/img/img_pl_l6_b3_t1b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### QR Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l6_b3_t2.png)![](gen/img/img_pl_l6_b3_t2b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l6_b3_t3.png)![](gen/img/img_pl_l6_b3_t3b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Triangular Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l6_b3_t4.png)![](gen/img/img_pl_l6_b3_t4b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
## BLIS
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Urbanek benchmark
|
|
|
|
|
|
|
|
#### 2800x2800 cross-product matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l7_b1_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear regr. over a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l7_b1_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Eigenvalues of a 640x640 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l7_b1_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Determinant of a 2500x2500 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l7_b1_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky decomposition of a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l7_b1_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Inverse of a 1600x1600 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l7_b1_t6.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Escoufier's method on a 45x45 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l7_b1_t7.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Revolution benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l7_b2_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky Factorization
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l7_b2_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l7_b2_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Principal Components Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l7_b2_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear Discriminant Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l7_b2_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Gcbd benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l7_b3_t1.png)![](gen/img/img_pl_l7_b3_t1b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### QR Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l7_b3_t2.png)![](gen/img/img_pl_l7_b3_t2b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l7_b3_t3.png)![](gen/img/img_pl_l7_b3_t3b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Triangular Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l7_b3_t4.png)![](gen/img/img_pl_l7_b3_t4b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
## cuBLAS
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Urbanek benchmark
|
|
|
|
|
|
|
|
#### 2800x2800 cross-product matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l8_b1_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear regr. over a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l8_b1_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Eigenvalues of a 640x640 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l8_b1_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Determinant of a 2500x2500 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l8_b1_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky decomposition of a 3000x3000 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l8_b1_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Inverse of a 1600x1600 random matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l8_b1_t6.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Escoufier's method on a 45x45 matrix
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l8_b1_t7.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Revolution benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l8_b2_t1.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Cholesky Factorization
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l8_b2_t2.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l8_b2_t3.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Principal Components Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l8_b2_t4.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Linear Discriminant Analysis
|
|
|
|
|
|
|
|
Time in seconds - 10 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l8_b2_t5.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
### Gcbd benchmark
|
|
|
|
|
|
|
|
#### Matrix Multiply
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l8_b3_t1.png)![](gen/img/img_pl_l8_b3_t1b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### QR Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l8_b3_t2.png)![](gen/img/img_pl_l8_b3_t2b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Singular Value Deomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l8_b3_t3.png)![](gen/img/img_pl_l8_b3_t3b.png)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#### Triangular Decomposition
|
|
|
|
|
|
|
|
Time in seconds regarding matrix size - right panel on log scale - from 50 to 5 runs - lower is better
|
|
|
|
|
|
|
|
![](gen/img/img_pl_l8_b3_t4.png)![](gen/img/img_pl_l8_b3_t4b.png)
|
2016-04-28 13:38:54 +02:00
|
|
|
|