FilesExpand file tree

 master

/

ArrayBenchmark.cs

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

259 lines (220 loc) · 7.51 KB

 master

/

ArrayBenchmark.cs

Copy path

Top

File metadata and controls

• Code
• Blame

259 lines (220 loc) · 7.51 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

using BenchmarkDotNet;

using BenchmarkDotNet.Attributes;

using System;

using System.Linq.Expressions;

using System.Numerics;

using System.Runtime.CompilerServices;

namespace ArrayMathNETFramework

{

public class ArrayBenchmark

{

const int N = 100_000_000;

float[] A;

float[] B;

float[] R;

Func<float, float, float> ExpressionLambda;

private float Add(float a, float b) => a + b;

[MethodImpl(MethodImplOptions.AggressiveInlining)]

private float AddInlined(float a, float b) => a + b;

[GlobalSetup]

public void Setup()

{

A = new float[N];

B = new float[N];

R = new float[N];

for (int i = 0; i < N; i++)

{

A[i] = i;

B[i] = i;

R[i] = i + i;

}

var par1 = Expression.Parameter(typeof(float));

var par2 = Expression.Parameter(typeof(float));

var add = Expression.Add(par1, par2);

ExpressionLambda = (Func<float, float, float>)Expression.Lambda(add, par1, par2).Compile();

}

/// <summary>

/// Method that has no optimizations.

/// </summary>

[Benchmark(Baseline =true, OperationsPerInvoke =100)]

public void AddWithoutAnyOptimization()

{

float[] C = new float[A.Length];

for (int i = 0; i < A.Length; i++)

C[i] = A[i] + B[i];

}

/// <summary>

/// Same as <see cref="AddWithoutAnyOptimization"/> but with the length of the

/// array from a global constant N.

/// </summary>

[Benchmark(OperationsPerInvoke =100)]

public void AddWithNTakenFromGlobalConst()

{

float[] C = new float[N];

for (int i = 0; i < N; i++)

C[i] = A[i] + B[i];

}

/// <summary>

/// Same as <see cref="AddWithNTakenFromGlobalConst"/> but with the array length

/// taken from the array that shall be added.

[Benchmark(OperationsPerInvoke = 100)]

public void AddWithArrayLengthNotUsedInLoop()

{

int N = A.Length;

float[] C = new float[N];

for (int i = 0; i < N; i++)

C[i] = A[i] + B[i];

}

/// <summary>

/// Add with pointer arithmetics, the array length is taken again from A.Length.

/// </summary>

[Benchmark(OperationsPerInvoke = 100)]

public unsafe void AddWithPointers()

{

float[] C = new float[A.Length];

fixed (float* Apinned = A)

fixed (float* Bpinned = B)

fixed (float* Cpinned = C)

{

float* aptr = Apinned;

float* bptr = Bpinned;

float* cptr = Cpinned;

for (int i = 0; i < A.Length; i++, aptr++, bptr++, cptr++)

*cptr = *aptr + *bptr;

}

}

/// <summary>

/// Same as <see cref="ArrayWithPointers"/> but now taken the N not in the loop.

/// </summary>

[Benchmark(OperationsPerInvoke = 100)]

public unsafe void AddWithPointersArrayLengthNotUsedInLoop()

{

int N = A.Length;

float[] C = new float[N];

fixed (float* Apinned = A)

fixed (float* Bpinned = B)

fixed (float* Cpinned = C)

{

float* aptr = Apinned;

float* bptr = Bpinned;

float* cptr = Cpinned;

for (int i = 0; i < N; i++, aptr++, bptr++, cptr++)

*cptr = *aptr + *bptr;

}

}

/// <summary>

/// Same as <see cref="ArrayWithPointers"/> but now taken the N not in the loop.

/// </summary>

[Benchmark(OperationsPerInvoke = 100)]

public unsafe void AddWithExpressionWithPointers()

{

int N = A.Length;

float[] C = new float[N];

fixed (float* Apinned = A)

fixed (float* Bpinned = B)

fixed (float* Cpinned = C)

{

float* aptr = Apinned;

float* bptr = Bpinned;

float* cptr = Cpinned;

for (int i = 0; i < N; i++, aptr++, bptr++, cptr++)

*cptr = ExpressionLambda(*aptr, *bptr);

}

}

/// <summary>

/// Same as <see cref="ArrayWithPointers"/> but now taken the N not in the loop.

/// </summary>

[Benchmark(OperationsPerInvoke = 100)]

public unsafe void AddWithFunction()

{

int N = A.Length;

float[] C = new float[N];

fixed (float* Apinned = A)

fixed (float* Bpinned = B)

fixed (float* Cpinned = C)

{

float* aptr = Apinned;

float* bptr = Bpinned;

float* cptr = Cpinned;

for (int i = 0; i < N; i++, aptr++, bptr++, cptr++)

*cptr = Add(*aptr, *bptr);

}

}

/// <summary>

/// Same as <see cref="ArrayWithPointers"/> but now taken the N not in the loop.

/// </summary>

[Benchmark(OperationsPerInvoke = 100)]

public unsafe void AddWithFunctionInlined()

{

int N = A.Length;

float[] C = new float[N];

fixed (float* Apinned = A)

fixed (float* Bpinned = B)

fixed (float* Cpinned = C)

{

float* aptr = Apinned;

float* bptr = Bpinned;

float* cptr = Cpinned;

for (int i = 0; i < N; i++, aptr++, bptr++, cptr++)

*cptr = AddInlined(*aptr, *bptr);

}

}

/// <summary>

/// Span was used.

/// </summary>

[Benchmark(OperationsPerInvoke = 100)]

public unsafe void AddWithSpan()

{

int N = A.Length;

float[] C = new float[N];

Span<float> a = new Span<float>(A);

Span<float> b = new Span<float>(B);

Span<float> c = new Span<float>(C);

for (int i = 0; i < N; i++)

c[i] = a[i] + b[i];

}

/// <summary>

/// Span was used.

/// </summary>

[Benchmark(OperationsPerInvoke = 100)]

public unsafe void AddWithSIMD()

{

int N = A.Length;

float[] C = new float[N];

int SIMDLength = Vector<float>.Count;

var i = 0;

for (i = 0; i <= A.Length - SIMDLength; i += SIMDLength)

{

var va = new Vector<float>(A, i);

var vb = new Vector<float>(B, i);

(va + vb).CopyTo(C, i);

}

for (; i < A.Length; ++i)

{

C[i] = A[i] + B[i];

}

}

/// <summary>

/// Span was used.

/// </summary>

[Benchmark(OperationsPerInvoke = 100)]

public unsafe void AddWithSIMDOptimized()

{

int N = A.Length;

float[] C = new float[N];

int SIMDLength = Vector<float>.Count;

var i = 0;

int len = A.Length - SIMDLength;

for (i = 0; i <= len; i += SIMDLength)

{

var va = new Vector<float>(A, i);

var vb = new Vector<float>(B, i);

(va + vb).CopyTo(C, i);

}

for (; i < A.Length; ++i)

{

C[i] = A[i] + B[i];

}

}

}

}