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
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
|
/*
* Copyright (c) 2021 Arm Limited.
*
* SPDX-License-Identifier: MIT
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal in the Software without restriction, including without limitation the
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
* sell copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#include "src/runtime/CL/mlgo/MLGOHeuristics.h"
#include "src/runtime/CL/mlgo/Utils.h"
#include "tests/framework/Asserts.h"
#include "tests/framework/Macros.h"
using namespace arm_compute::mlgo;
namespace arm_compute
{
namespace test
{
namespace validation
{
TEST_SUITE(CL)
TEST_SUITE(UNIT)
TEST_SUITE(MLGOHeuristics)
TEST_CASE(CorrectDotMLGOShouldLoadCorrectly, framework::DatasetMode::ALL)
{
std::string mlgo_str = R"_(
<header>
gemm-version, [1,2,1]
ip-type,gpu
</header>
<heuristics-table>
0, g76 , 8, f32, best-performance, static, gemm-type, [m,n,k,n]
1, g71 , 8, f16, best-performance, static, gemm-config-reshaped-only-rhs, [m,n,k,n]
2, g76 , 8, f16, best-performance, static, gemm-config-reshaped, [m,n,k,n]
</heuristics-table>
<heuristic, 0>
b , 0, var, m, ==, num, 10., 1, 2
l , 1, gemm-type, reshaped
b , 2, var, r_mn, >=, num, 2., 3, 6
b , 3, var, n, >=, num, 200., 4, 5
l, 4, gemm-type, reshaped-only-rhs
l , 5, gemm-type, reshaped
l , 6, gemm-type, reshaped-only-rhs
</heuristic>
<heuristic, 1>
b ,0,var, n, >, num, 100., 1, 4
b ,1,var, r_mnk, <=, num, 20., 2, 3
l ,2,gemm-config-reshaped-only-rhs, [4, 4,4,2,1,0,1]
l ,3,gemm-config-reshaped-only-rhs,[ 2, 2,4,2,1,1, 1 ]
b ,4,var, n, >=, num, 199.12, 5, 6
l ,5,gemm-config-reshaped-only-rhs, [1, 4,3,4,0,0,0]
l ,6,gemm-config-reshaped-only-rhs, [5, 4,4,5,1,1,0]
</heuristic>
<heuristic, 2>
l ,0,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
</heuristic>
)_";
std::stringstream ss(mlgo_str);
MLGOHeuristics heuristics;
heuristics.reload_from_stream(ss);
ARM_COMPUTE_EXPECT(heuristics.query_gemm_type(Query{ "g76", DataType::F32, 10, 1024, 20, 1 }).second == GEMMType::RESHAPED, framework::LogLevel::ERRORS);
ARM_COMPUTE_EXPECT(heuristics.query_gemm_type(Query{ "g76", DataType::F32, 400, 201, 5, 1 }).second == GEMMType::RESHAPED_ONLY_RHS, framework::LogLevel::ERRORS);
ARM_COMPUTE_EXPECT(heuristics.query_gemm_type(Query{ "g76", DataType::F32, 400, 200, 199, 16 }).second == GEMMType::RESHAPED_ONLY_RHS, framework::LogLevel::ERRORS);
ARM_COMPUTE_EXPECT(heuristics.query_gemm_type(Query{ "g76", DataType::F32, 400, 199, 512, 4 }).second == GEMMType::RESHAPED, framework::LogLevel::ERRORS);
ARM_COMPUTE_EXPECT((heuristics.query_gemm_config_reshaped_only_rhs(Query{ "g71", DataType::F16, 100, 1024, 20, 32 }).second == GEMMConfigReshapedOnlyRHS{ 4, 4, 4, 2, true, false, true }),
framework::LogLevel::ERRORS);
ARM_COMPUTE_EXPECT((heuristics.query_gemm_config_reshaped_only_rhs(Query{ "g71", DataType::F16, 100, 1024, 20, 32 }).second == GEMMConfigReshapedOnlyRHS{ 4, 4, 4, 2, true, false, true }),
framework::LogLevel::ERRORS);
ARM_COMPUTE_EXPECT((heuristics.query_gemm_config_reshaped_only_rhs(Query{ "g71", DataType::F16, 128, 101, 20, 1 }).second == GEMMConfigReshapedOnlyRHS{ 2, 2, 4, 2, true, true, true }),
framework::LogLevel::ERRORS);
ARM_COMPUTE_EXPECT((heuristics.query_gemm_config_reshaped_only_rhs(Query{ "g71", DataType::F16, 400, 100, 512, 1 }).second == GEMMConfigReshapedOnlyRHS{ 5, 4, 4, 5, true, true, false }),
framework::LogLevel::ERRORS);
ARM_COMPUTE_EXPECT((heuristics.query_gemm_config_reshaped_only_rhs(Query{ "g71", DataType::F16, 400, 100, 512, 1 }).second == GEMMConfigReshapedOnlyRHS{ 5, 4, 4, 5, true, true, false }),
framework::LogLevel::ERRORS);
ARM_COMPUTE_EXPECT((heuristics.query_gemm_config_reshaped(Query{ "g76", DataType::F16, 100, 100, 20, 32 }).second == GEMMConfigReshaped{ 4, 2, 4, 2, 8, true, false, true, false }),
framework::LogLevel::ERRORS);
ARM_COMPUTE_EXPECT((heuristics.query_gemm_config_reshaped(Query{ "g76", DataType::F16, 128, 512, 1024, 1 }).second == GEMMConfigReshaped{ 4, 2, 4, 2, 8, true, false, true, false }),
framework::LogLevel::ERRORS);
}
TEST_CASE(InvalidDotmlgoSyntaxShouldReturnInvalidStatus, framework::DatasetMode::ALL)
{
std::string mlgo_str = R"_(
<header>
gemm-version, [1,2,1]
ip-type,pu
</header>
<heuristics-table>
0, g76 , 8, f32, best-performance, static, gemm-config-reshaped, [m,n,k,n]
</heurist
<heuristic, 0>
l ,0,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
</heuristic>
)_";
std::stringstream ss(mlgo_str);
MLGOHeuristics heuristics;
ARM_COMPUTE_EXPECT(!heuristics.reload_from_stream(ss), framework::LogLevel::ERRORS);
}
TEST_SUITE(InvalidDotmlgoSemanticsShouldReturnInvalidStatus)
// If the semantics errors are local to some trees instead of the entire heuristics, an alternative is to simply
// ignore/remove those invalid trees. However the reason why we choose to throw, thus invalidating the entire
// heuristics is that if there are some invalid trees, the quality of the dotmlgo is called into question even if
// the rest of the trees are semantically valid, and they could severely degrade the performance of GEMM. Therefore
// this "all or nothing" approach when it comes to dotmlgo correctness is safer and more defensive.
// Also note that the semantic error of the tree only refers to those that obstruct its evaluation and thus query,
// (e.g. invalid tree structure, unsupported features etc.) instead of those affecting the desired outcome
// (usually in terms of final GEMM performance, e.g. the effectiveness of the decision tree)
// In the future we might want to check the content of the exceptions as well. But right now it suffices to only
// know that it throws exactly when it needs to.
TEST_CASE(MismatchesBetweenHeuristicsTableEntriesAndHeuristicTrees, framework::DatasetMode::ALL)
{
{
// Mismatching number of entries 1
std::string mlgo_str = R"_(
<header>
gemm-version, [1,2,1]
ip-type,gpu
</header>
<heuristics-table>
0, g76 , 8, f32, best-performance, static, gemm-config-reshaped, [m,n,k,n]
</heuristics-table>
)_";
std::stringstream ss(mlgo_str);
MLGOHeuristics heuristics;
// NOTE: This case might throw an internal error as the tree inserted by the heuristics-table cannot not be checked
ARM_COMPUTE_EXPECT(!heuristics.reload_from_stream(ss), framework::LogLevel::ERRORS);
}
{
// Mismatching number of entries 2
std::string mlgo_str = R"_(
<header>
gemm-version, [1,2,1]
ip-type,gpu
</header>
<heuristics-table>
</heuristics-table>
<heuristic, 1>
l ,0,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
</heuristic>
)_";
std::stringstream ss(mlgo_str);
MLGOHeuristics heuristics;
ARM_COMPUTE_EXPECT(!heuristics.reload_from_stream(ss), framework::LogLevel::ERRORS);
}
{
// Mismatching info
std::string mlgo_str = R"_(
<header>
gemm-version, [1,2,1]
ip-type,gpu
</header>
<heuristics-table>
0, g76 , 8, f32, best-performance, static, gemm-type, [m,n,k,n]
</heuristics-table>
<heuristic, 0>
l ,0,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
</heuristic>
)_";
std::stringstream ss(mlgo_str);
MLGOHeuristics heuristics;
ARM_COMPUTE_EXPECT(!heuristics.reload_from_stream(ss), framework::LogLevel::ERRORS);
}
}
TEST_CASE(RepeatedHeuristicsTableEntriesId, framework::DatasetMode::ALL)
{
std::string mlgo_str = R"_(
<header>
gemm-version, [1,2,1]
ip-type,gpu
</header>
<heuristics-table>
0, g76 , 8, f32, best-performance, static, gemm-config-reshaped, [m,n,k,n]
0, g71 , 8, f32, best-performance, static, gemm-config-reshaped, [m,n,k,n]
</heuristics-table>
<heuristic, 0>
l ,0,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
</heuristic>
<heuristic, 1>
l ,0,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
</heuristic>
)_";
std::stringstream ss(mlgo_str);
MLGOHeuristics heuristics;
ARM_COMPUTE_EXPECT(!heuristics.reload_from_stream(ss), framework::LogLevel::ERRORS);
}
TEST_CASE(RepeatedHeuristicsTableEntriesIndex, framework::DatasetMode::ALL)
{
std::string mlgo_str = R"_(
<header>
gemm-version, [1,2,1]
ip-type,gpu
</header>
<heuristics-table>
0, g76 , 8, f32, best-performance, static, gemm-config-reshaped, [m,n,k,n]
1, g76 , 8, f32, best-performance, static, gemm-config-reshaped, [m,n,k,n]
</heuristics-table>
<heuristic, 0>
l ,0,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
</heuristic>
<heuristic, 1>
l ,0,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
</heuristic>
)_";
std::stringstream ss(mlgo_str);
MLGOHeuristics heuristics;
ARM_COMPUTE_EXPECT(!heuristics.reload_from_stream(ss), framework::LogLevel::ERRORS);
}
TEST_CASE(RepeatedHeuristicTreesId, framework::DatasetMode::ALL)
{
std::string mlgo_str = R"_(
<header>
gemm-version, [1,2,1]
ip-type,gpu
</header>
<heuristics-table>
0, g76 , 8, f32, best-performance, static, gemm-config-reshaped, [m,n,k,n]
1, g71 , 8, f32, best-performance, static, gemm-config-reshaped, [m,n,k,n]
</heuristics-table>
<heuristic, 0>
l ,0,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
</heuristic>
<heuristic, 0>
l ,0,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
</heuristic>
)_";
std::stringstream ss(mlgo_str);
MLGOHeuristics heuristics;
ARM_COMPUTE_EXPECT(!heuristics.reload_from_stream(ss), framework::LogLevel::ERRORS);
}
TEST_CASE(EmptyTree, framework::DatasetMode::ALL)
{
std::string mlgo_str = R"_(
<header>
gemm-version, [1,2,1]
ip-type,gpu
</header>
<heuristics-table>
0, g76 , 8, f32, best-performance, static, gemm-config-reshaped, [m,n,k,n]
</heuristics-table>
<heuristic, 0>
</heuristic>
)_";
std::stringstream ss(mlgo_str);
MLGOHeuristics heuristics;
ARM_COMPUTE_EXPECT(!heuristics.reload_from_stream(ss), framework::LogLevel::ERRORS);
}
TEST_CASE(InvalidTreeMissingRoot, framework::DatasetMode::ALL)
{
std::string mlgo_str = R"_(
<header>
gemm-version, [1,2,1]
ip-type,gpu
</header>
<heuristics-table>
0, g76 , 8, f32, best-performance, static, gemm-config-reshaped, [m,n,k,n]
</heuristics-table>
<heuristic, 0>
b ,2, var, m, ==, num, 10., 3, 4
l ,3,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
l ,4,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
</heuristic>
)_";
std::stringstream ss(mlgo_str);
MLGOHeuristics heuristics;
ARM_COMPUTE_EXPECT(!heuristics.reload_from_stream(ss), framework::LogLevel::ERRORS);
}
TEST_CASE(InvalidTreeMissingNodes, framework::DatasetMode::ALL)
{
std::string mlgo_str = R"_(
<header>
gemm-version, [1,2,1]
ip-type,gpu
</header>
<heuristics-table>
0, g76 , 8, f32, best-performance, static, gemm-config-reshaped, [m,n,k,n]
</heuristics-table>
<heuristic, 0>
b ,0, var, m, ==, num, 10., 1, 2
l ,1,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
</heuristic>
)_";
std::stringstream ss(mlgo_str);
MLGOHeuristics heuristics;
ARM_COMPUTE_EXPECT(!heuristics.reload_from_stream(ss), framework::LogLevel::ERRORS);
}
TEST_CASE(InvalidTreeRepeatedNodeIds, framework::DatasetMode::ALL)
{
std::string mlgo_str = R"_(
<header>
gemm-version, [1,2,1]
ip-type,gpu
</header>
<heuristics-table>
0, g76 , 8, f32, best-performance, static, gemm-config-reshaped, [m,n,k,n]
</heuristics-table>
<heuristic, 0>
b ,0, var, m, ==, num, 10., 1, 2
l ,1,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
l ,1,gemm-config-reshaped,[1,2,4,2,8,1,0,1,0]
l ,2,gemm-config-reshaped,[2,2,4,2,8,1,0,1,0]
</heuristic>
)_";
std::stringstream ss(mlgo_str);
MLGOHeuristics heuristics;
ARM_COMPUTE_EXPECT(!heuristics.reload_from_stream(ss), framework::LogLevel::ERRORS);
}
TEST_CASE(InvalidTreeDisjointNodes, framework::DatasetMode::ALL)
{
std::string mlgo_str = R"_(
<header>
gemm-version, [1,2,1]
ip-type,gpu
</header>
<heuristics-table>
0, g76 , 8, f32, best-performance, static, gemm-config-reshaped, [m,n,k,n]
</heuristics-table>
<heuristic, 0>
b ,0, var, m, ==, num, 10., 1, 2
l ,1,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
l ,2,gemm-config-reshaped,[2,2,4,2,8,1,0,1,0]
b ,4, var, n, ==, num, 10., 5, 6
l ,5,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
l ,6,gemm-config-reshaped,[2,2,4,2,8,1,0,1,0]
l ,7,gemm-config-reshaped,[2,2,4,2,8,1,0,1,0]
</heuristic>
)_";
std::stringstream ss(mlgo_str);
MLGOHeuristics heuristics;
ARM_COMPUTE_EXPECT(!heuristics.reload_from_stream(ss), framework::LogLevel::ERRORS);
}
TEST_CASE(InvalidTreeLoop, framework::DatasetMode::ALL)
{
std::string mlgo_str = R"_(
<header>
gemm-version, [1,2,1]
ip-type,gpu
</header>
<heuristics-table>
0, g76 , 8, f32, best-performance, static, gemm-config-reshaped, [m,n,k,n]
</heuristics-table>
<heuristic, 0>
b ,0, var, m, ==, num, 10., 0, 1
l ,1,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
</heuristic>
)_";
std::stringstream ss(mlgo_str);
MLGOHeuristics heuristics;
ARM_COMPUTE_EXPECT(!heuristics.reload_from_stream(ss), framework::LogLevel::ERRORS);
}
TEST_CASE(InvalidTreeCycle, framework::DatasetMode::ALL)
{
std::string mlgo_str = R"_(
<header>
gemm-version, [1,2,1]
ip-type,gpu
</header>
<heuristics-table>
0, g76 , 8, f32, best-performance, static, gemm-config-reshaped, [m,n,k,n]
</heuristics-table>
<heuristic, 0>
b ,0, var, m, ==, num, 10., 1, 5
b ,1, var, n, ==, num, 10., 2, 3
l ,2,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
b ,3, var, k, ==, num, 10., 0, 4
l ,4,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
l ,5,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
</heuristic>
)_";
std::stringstream ss(mlgo_str);
MLGOHeuristics heuristics;
ARM_COMPUTE_EXPECT(!heuristics.reload_from_stream(ss), framework::LogLevel::ERRORS);
}
TEST_CASE(InvalidTreeInvalidFeatures, framework::DatasetMode::ALL)
{
std::string mlgo_str = R"_(
<header>
gemm-version, [1,2,1]
ip-type,gpu
</header>
<heuristics-table>
0, g76 , 8, f32, best-performance, static, gemm-config-reshaped, [m,n,k,n]
</heuristics-table>
<heuristic, 0>
b ,0, var, magic_feature, ==, num, 10., 1, 2
l ,1,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
l ,2,gemm-config-reshaped,[4,2,4,2,8,1,0,1,0]
</heuristic>
)_";
std::stringstream ss(mlgo_str);
MLGOHeuristics heuristics;
ARM_COMPUTE_EXPECT(!heuristics.reload_from_stream(ss), framework::LogLevel::ERRORS);
}
TEST_SUITE_END() // InvalidDotmlgoSemanticsShouldReturnInvalidStatus
TEST_CASE(InvalidUsageOfHeuristicsShouldReturnInvalidStatus, framework::DatasetMode::ALL)
{
std::string mlgo_str = R"_(
<header>
gemm-version, [1,2,1]
ip-type,gpu
</header>
<heuristics-table>
0, g76 , 8, f32, best-performance, static, gemm-type, [m,n,k,n]
</heuristics-table>
<heuristic, 0>
b , 0, var, m, ==, num, 10., 1, 2
l , 1, gemm-type, reshaped
b , 2, var, r_mn, >=, num, 2., 3, 6
b , 3, var, n, >=, num, 200., 4, 5
l , 4, gemm-type, reshaped-only-rhs
l , 5, gemm-type, reshaped
l , 6, gemm-type, reshaped-only-rhs
</heuristic>
)_";
std::stringstream ss(mlgo_str);
MLGOHeuristics heuristics;
ARM_COMPUTE_EXPECT(heuristics.reload_from_stream(ss), framework::LogLevel::ERRORS);
// Querying unavailable heuristic type should return invalid Status
ARM_COMPUTE_EXPECT(!heuristics.query_gemm_config_reshaped(Query{ "g76", DataType::F32, 1024, 1024, 100, 3 }).first, framework::LogLevel::ERRORS);
// Querying unavailable ip target should return invalid Status
ARM_COMPUTE_EXPECT(!heuristics.query_gemm_type(Query{ "g77", DataType::F32, 1024, 1024, 100, 3 }).first, framework::LogLevel::ERRORS);
// Querying unavailable data type should return invalid Status
ARM_COMPUTE_EXPECT(!heuristics.query_gemm_config_reshaped_only_rhs(Query{ "g76", DataType::QASYMM8, 1024, 1024, 100, 3 }).first, framework::LogLevel::ERRORS);
}
TEST_SUITE_END() // MLGOHeuristics
TEST_SUITE_END() // UNIT
TEST_SUITE_END() // CL
} // namespace validation
} // namespace test
} // namespace arm_compute
|
