-
Notifications
You must be signed in to change notification settings - Fork 267
/
MDSqMtx.cs
64 lines (55 loc) · 1.43 KB
/
MDSqMtx.cs
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
// Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
// See the LICENSE file in the project root for more information.
//
using BenchmarkDotNet.Attributes;
using MicroBenchmarks;
namespace Benchstone.MDBenchF
{
[BenchmarkCategory(Categories.Runtime, Categories.Benchstones, Categories.JIT, Categories.MDBenchF)]
public class MDSqMtx
{
public const int Iterations = 4000;
private const int MatrixSize = 40;
[Benchmark(Description = nameof(MDSqMtx))]
public bool Test()
{
double[,] a = new double[41, 41];
double[,] c = new double[41, 41];
int i, j;
for (i = 1; i <= MatrixSize; i++)
{
for (j = 1; j <= MatrixSize; j++)
{
a[i,j] = i + j;
}
}
for (i = 1; i <= Iterations; i++)
{
Inner(a, c, MatrixSize);
}
if (c[1,1] == 23820.0)
{
return true;
}
else
{
return false;
}
}
private static void Inner(double[,] a, double[,] c, int n)
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
c[i,j] = 0.0;
for (int k = 1; k <= n; k++)
{
c[i,j] = c[i,j] + a[i,k] * a[k,j];
}
}
}
}
}
}