1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
|
/*
* This file is a part of TiledArray.
* Copyright (C) 2013 Virginia Tech
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
#include <iostream>
#include <tiledarray.h>
int main(int argc, char** argv) {
// Get command line arguments
if(argc < 2) {
std::cout << "Usage: blas matrix_size [repetitions]\n";
return 0;
}
const long matrix_size = atol(argv[1]);
if (matrix_size <= 0) {
std::cerr << "Error: matrix size must be greater than zero.\n";
return 1;
}
const long repeat = (argc >= 3 ? atol(argv[2]) : 5);
if (repeat <= 0) {
std::cerr << "Error: number of repetitions must be greater than zero.\n";
return 1;
}
std::cout << "\nMatrix size = " << matrix_size << "x" << matrix_size
<< "\nMemory per matrix = " << double(matrix_size * matrix_size * sizeof(double)) / 1.0e9
<< " GB\n";
// Construct matrices
double* a = NULL;
if(posix_memalign(reinterpret_cast<void**>(&a), 128, sizeof(double) * matrix_size * matrix_size) != 0)
return 1;
double* b = NULL;
if(posix_memalign(reinterpret_cast<void**>(&b), 128, sizeof(double) * matrix_size * matrix_size) != 0)
return 1;
double* c = NULL;
if(posix_memalign(reinterpret_cast<void**>(&c), 128, sizeof(double) * matrix_size * matrix_size) != 0)
return 1;
std::fill_n(a, matrix_size * matrix_size, 1.0);
std::fill_n(b, matrix_size * matrix_size, 1.0);
std::fill_n(c, matrix_size * matrix_size, 0.0);
// BLAS dgemm arguments
char opa = 'n', opb = 'n';
const double alpha = 1l, beta = 0l;
const integer m = matrix_size, n = matrix_size, k = matrix_size;
const integer lda = matrix_size, ldb = matrix_size, ldc = matrix_size;
// Start clock
const double wall_time_start = madness::wall_time();
// Do matrix multiplcation
// Note: If TiledArray has not been configured with blas, this will be an eigen call.
for(int i = 0; i < repeat; ++i) {
F77_DGEMM(&opb, &opa, &n, &m, &k, &alpha, b, &ldb, a, &lda, &beta, c, &ldc);
}
// Stop clock
const double wall_time_stop = madness::wall_time();
// Cleanup memory
free(a);
free(b);
free(c);
std::cout << "Average wall time = " << (wall_time_stop - wall_time_start) / double(repeat)
<< "\nAverage GFLOPS = " << double(repeat) * 2.0 * double(matrix_size *
matrix_size * matrix_size) / (wall_time_stop - wall_time_start) / 1.0e9 << "\n";
return 0;
}
|
