Menu

[r30]: / trunk / benchmark / double_times / main.cpp  Maximize  Restore  History

Download this file

51 lines (39 with data), 1.3 kB

 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
/*****************************************************************************/
/* noname.cpp */
/*****************************************************************************/
#undef CPPL_VERBOSE
#undef CPPL_DEBUG
//====================================================================[include]
#include <iostream>
#include <cstdlib>
#include <ctime>
#include "cpplapack.h"
using namespace std;
//=======================================================================[main]
/*! main */
int main(int argc, char** argv)
{
int size(500);
CPPL::dgematrix A(size,size), B(size,size), C;
srand(time(NULL));
for(int i=0; i<size; i++){ for(int j=0; j<size; j++){
A(i,j) =double(rand())/double(RAND_MAX);
B(i,j) =double(rand())/double(RAND_MAX);
}}
clock_t t0, t1, t2;
t0=clock();
C=A*B;
t1=clock();
C.resize(size,size);
for(int i=0; i<size; i++){
for(int j=0; j<size; j++){
C(i,j) =0.0;
for(int k=0; k<size; k++){ C(i,j) +=A(i,k)*B(k,j); }
}
}
t2=clock();
cout << "\"A*B\" took "<< (1000./CLOCKS_PER_SEC)*(t1-t0) << "[ms]." << endl;
cout << "\"loop\" took "<< (1000./CLOCKS_PER_SEC)*(t2-t1) << "[ms]." << endl;
return 0;
}
/*****************************************************************************/
Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.