mirror of
https://git.adityakumar.xyz/llama.cpp.git
synced 2025-02-22 15:40:02 +00:00
benchmark-matmul: Print the average of the test results (#1490)
This commit is contained in:
parent
2b2646931b
commit
c238b5873a
1 changed files with 5 additions and 0 deletions
|
@ -211,6 +211,7 @@ int main(int argc, char ** argv) {
|
||||||
printf("Iteration;NThreads; SizeX; SizeY; SizeZ; Required_FLOPS; Elapsed_u_Seconds; gigaFLOPS\n");
|
printf("Iteration;NThreads; SizeX; SizeY; SizeZ; Required_FLOPS; Elapsed_u_Seconds; gigaFLOPS\n");
|
||||||
printf("=====================================================================================\n");
|
printf("=====================================================================================\n");
|
||||||
|
|
||||||
|
double gflops_sum = 0;
|
||||||
for (int i=0;i<benchmark_params.n_iterations ;i++) {
|
for (int i=0;i<benchmark_params.n_iterations ;i++) {
|
||||||
|
|
||||||
long long int start = ggml_time_us();
|
long long int start = ggml_time_us();
|
||||||
|
@ -219,6 +220,7 @@ int main(int argc, char ** argv) {
|
||||||
long long int stop = ggml_time_us();
|
long long int stop = ggml_time_us();
|
||||||
long long int usec = stop-start;
|
long long int usec = stop-start;
|
||||||
double gflops = (double)(flops_per_matrix)/usec/1000.0;
|
double gflops = (double)(flops_per_matrix)/usec/1000.0;
|
||||||
|
gflops_sum += gflops;
|
||||||
printf("%9i;%8i;%6i;%6i;%6i;%15lli;%18lli;%10.2f\n",
|
printf("%9i;%8i;%6i;%6i;%6i;%15lli;%18lli;%10.2f\n",
|
||||||
i,
|
i,
|
||||||
gf31.n_threads,
|
gf31.n_threads,
|
||||||
|
@ -248,4 +250,7 @@ int main(int argc, char ** argv) {
|
||||||
// Running a different graph computation to make sure we override the CPU cache lines
|
// Running a different graph computation to make sure we override the CPU cache lines
|
||||||
ggml_graph_compute(ctx, &gf32);
|
ggml_graph_compute(ctx, &gf32);
|
||||||
}
|
}
|
||||||
|
printf("\n");
|
||||||
|
printf("Average%78.2f\n",gflops_sum/((double)benchmark_params.n_iterations));
|
||||||
|
printf("=====================================================================================\n");
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in a new issue