blob: ecf84abd2c48e3f6733e3da299a272eb0e70e53a [file] [log] [blame]
Moritz Pflanzerbeabe3b2017-08-31 14:56:32 +01001/*
SiCong Lidba672c2023-04-06 16:30:18 +01002 * Copyright (c) 2016-2023 Arm Limited.
Moritz Pflanzerbeabe3b2017-08-31 14:56:32 +01003 *
4 * SPDX-License-Identifier: MIT
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining a copy
7 * of this software and associated documentation files (the "Software"), to
8 * deal in the Software without restriction, including without limitation the
9 * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
10 * sell copies of the Software, and to permit persons to whom the Software is
11 * furnished to do so, subject to the following conditions:
12 *
13 * The above copyright notice and this permission notice shall be included in all
14 * copies or substantial portions of the Software.
15 *
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
19 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
22 * SOFTWARE.
23 */
24#include "arm_compute/runtime/IScheduler.h"
25
morgolock51112642020-08-20 14:51:39 +010026#include "arm_compute/core/CPP/ICPPKernel.h"
Anthony Barbier148b0752018-09-11 14:19:39 +010027#include "arm_compute/core/Error.h"
Dana Zlotnikd7154db2021-11-10 11:50:58 +020028#include "arm_compute/core/Log.h"
morgolock51112642020-08-20 14:51:39 +010029#include "arm_compute/core/Window.h"
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +010030
Georgios Pinitas08302c12021-06-09 10:08:27 +010031#include "src/common/cpuinfo/CpuInfo.h"
Sang-Hoon Park68dd25f2020-10-19 16:00:11 +010032#include "src/runtime/SchedulerUtils.h"
Moritz Pflanzerbeabe3b2017-08-31 14:56:32 +010033
34namespace arm_compute
35{
36IScheduler::IScheduler()
37{
Georgios Pinitas53d12272018-02-01 20:23:25 +000038 // Work out the best possible number of execution threads
Georgios Pinitas08302c12021-06-09 10:08:27 +010039 _num_threads_hint = cpuinfo::num_threads_hint();
Moritz Pflanzerbeabe3b2017-08-31 14:56:32 +010040}
41
Pablo Tello7fad9b12018-03-14 17:55:27 +000042CPUInfo &IScheduler::cpu_info()
Moritz Pflanzerbeabe3b2017-08-31 14:56:32 +010043{
Michalis Spyrou20fca522021-06-07 14:23:57 +010044 return CPUInfo::get();
Moritz Pflanzerbeabe3b2017-08-31 14:56:32 +010045}
Georgios Pinitas53d12272018-02-01 20:23:25 +000046
Georgios Pinitas06e890b2020-07-09 18:38:34 +010047void IScheduler::set_num_threads_with_affinity(unsigned int num_threads, BindFunc func)
48{
49 ARM_COMPUTE_UNUSED(num_threads, func);
50 ARM_COMPUTE_ERROR("Feature for affinity setting is not implemented");
51}
52
Georgios Pinitas53d12272018-02-01 20:23:25 +000053unsigned int IScheduler::num_threads_hint() const
54{
55 return _num_threads_hint;
56}
morgolock51112642020-08-20 14:51:39 +010057
Sang-Hoon Park0094c022021-01-20 18:16:47 +000058void IScheduler::schedule_common(ICPPKernel *kernel, const Hints &hints, const Window &window, ITensorPack &tensors)
morgolock51112642020-08-20 14:51:39 +010059{
60 ARM_COMPUTE_ERROR_ON_MSG(!kernel, "The child class didn't set the kernel");
morgolock51112642020-08-20 14:51:39 +010061#ifndef BARE_METAL
Sang-Hoon Park0094c022021-01-20 18:16:47 +000062 const Window &max_window = window;
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +010063 if (hints.split_dimension() == IScheduler::split_dimensions_all)
morgolock51112642020-08-20 14:51:39 +010064 {
65 /*
66 * if the split dim is size_t max then this signals we should parallelise over
67 * all dimensions
68 */
69 const std::size_t m = max_window.num_iterations(Window::DimX);
70 const std::size_t n = max_window.num_iterations(Window::DimY);
71
72 //in c++17 this can be swapped for auto [ m_threads, n_threads ] = split_2d(...
73 unsigned m_threads, n_threads;
Sang-Hoon Park68dd25f2020-10-19 16:00:11 +010074 std::tie(m_threads, n_threads) = scheduler_utils::split_2d(this->num_threads(), m, n);
morgolock51112642020-08-20 14:51:39 +010075
76 std::vector<IScheduler::Workload> workloads;
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +010077 for (unsigned int ni = 0; ni != n_threads; ++ni)
morgolock51112642020-08-20 14:51:39 +010078 {
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +010079 for (unsigned int mi = 0; mi != m_threads; ++mi)
morgolock51112642020-08-20 14:51:39 +010080 {
81 workloads.push_back(
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +010082 [ni, mi, m_threads, n_threads, &max_window, &kernel](const ThreadInfo &info)
83 {
84 //narrow the window to our mi-ni workload
85 Window win = max_window.split_window(Window::DimX, mi, m_threads)
86 .split_window(Window::DimY, ni, n_threads);
morgolock51112642020-08-20 14:51:39 +010087
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +010088 win.validate();
morgolock51112642020-08-20 14:51:39 +010089
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +010090 Window thread_locator;
91 thread_locator.set(Window::DimX, Window::Dimension(mi, m_threads));
92 thread_locator.set(Window::DimY, Window::Dimension(ni, n_threads));
morgolock51112642020-08-20 14:51:39 +010093
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +010094 thread_locator.validate();
morgolock51112642020-08-20 14:51:39 +010095
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +010096 kernel->run_nd(win, info, thread_locator);
97 });
morgolock51112642020-08-20 14:51:39 +010098 }
99 }
100 run_workloads(workloads);
101 }
102 else
103 {
104 const unsigned int num_iterations = max_window.num_iterations(hints.split_dimension());
105 const unsigned int num_threads = std::min(num_iterations, this->num_threads());
106
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +0100107 if (num_iterations == 0)
morgolock51112642020-08-20 14:51:39 +0100108 {
109 return;
110 }
111
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +0100112 if (!kernel->is_parallelisable() || num_threads == 1)
morgolock51112642020-08-20 14:51:39 +0100113 {
114 ThreadInfo info;
Michalis Spyrou20fca522021-06-07 14:23:57 +0100115 info.cpu_info = &cpu_info();
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +0100116 if (tensors.empty())
morgolock51112642020-08-20 14:51:39 +0100117 {
118 kernel->run(max_window, info);
119 }
120 else
121 {
122 kernel->run_op(tensors, max_window, info);
123 }
124 }
125 else
126 {
127 unsigned int num_windows = 0;
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +0100128 switch (hints.strategy())
morgolock51112642020-08-20 14:51:39 +0100129 {
130 case StrategyHint::STATIC:
131 num_windows = num_threads;
132 break;
133 case StrategyHint::DYNAMIC:
134 {
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +0100135 const unsigned int granule_threshold =
136 (hints.threshold() <= 0) ? num_threads : static_cast<unsigned int>(hints.threshold());
morgolock51112642020-08-20 14:51:39 +0100137 // Make sure we don't use some windows which are too small as this might create some contention on the ThreadFeeder
138 num_windows = num_iterations > granule_threshold ? granule_threshold : num_iterations;
139 break;
140 }
141 default:
142 ARM_COMPUTE_ERROR("Unknown strategy");
143 }
SiCong Lidba672c2023-04-06 16:30:18 +0100144 // Make sure the smallest window is larger than minimum workload size
Dana Zlotnikd7154db2021-11-10 11:50:58 +0200145 num_windows = adjust_num_of_windows(max_window, hints.split_dimension(), num_windows, *kernel, cpu_info());
146
morgolock51112642020-08-20 14:51:39 +0100147 std::vector<IScheduler::Workload> workloads(num_windows);
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +0100148 for (unsigned int t = 0; t < num_windows; ++t)
morgolock51112642020-08-20 14:51:39 +0100149 {
150 //Capture 't' by copy, all the other variables by reference:
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +0100151 workloads[t] = [t, &hints, &max_window, &num_windows, &kernel, &tensors](const ThreadInfo &info)
morgolock51112642020-08-20 14:51:39 +0100152 {
153 Window win = max_window.split_window(hints.split_dimension(), t, num_windows);
154 win.validate();
155
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +0100156 if (tensors.empty())
morgolock51112642020-08-20 14:51:39 +0100157 {
158 kernel->run(win, info);
159 }
160 else
161 {
162 kernel->run_op(tensors, win, info);
163 }
164 };
165 }
166 run_workloads(workloads);
167 }
168 }
Sang-Hoon Park0094c022021-01-20 18:16:47 +0000169#else /* !BARE_METAL */
170 ARM_COMPUTE_UNUSED(kernel, hints, window, tensors);
morgolock51112642020-08-20 14:51:39 +0100171#endif /* !BARE_METAL */
172}
173
Anthony Barbier148b0752018-09-11 14:19:39 +0100174void IScheduler::run_tagged_workloads(std::vector<Workload> &workloads, const char *tag)
175{
176 ARM_COMPUTE_UNUSED(tag);
177 run_workloads(workloads);
178}
179
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +0100180std::size_t IScheduler::adjust_num_of_windows(const Window &window,
181 std::size_t split_dimension,
182 std::size_t init_num_windows,
183 const ICPPKernel &kernel,
184 const CPUInfo &cpu_info)
Dana Zlotnikd7154db2021-11-10 11:50:58 +0200185{
186 // Mitigation of the narrow split issue, which occurs when the split dimension is too small to split (hence "narrow").
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +0100187 if (window.num_iterations(split_dimension) < init_num_windows)
Dana Zlotnikd7154db2021-11-10 11:50:58 +0200188 {
189 auto recommended_split_dim = Window::DimX;
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +0100190 for (std::size_t dims = Window::DimY; dims <= Window::DimW; ++dims)
Dana Zlotnikd7154db2021-11-10 11:50:58 +0200191 {
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +0100192 if (window.num_iterations(recommended_split_dim) < window.num_iterations(dims))
Dana Zlotnikd7154db2021-11-10 11:50:58 +0200193 {
194 recommended_split_dim = dims;
195 }
196 }
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +0100197 ARM_COMPUTE_LOG_INFO_MSG_WITH_FORMAT_CORE(
198 "%zu dimension is not a suitable dimension to split the workload. Recommended: %zu recommended_split_dim",
199 split_dimension, recommended_split_dim);
Dana Zlotnikd7154db2021-11-10 11:50:58 +0200200 }
201
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +0100202 for (auto t = init_num_windows; t > 0; --t) // Trying the highest number of windows ,init_num_windows, first
Dana Zlotnikd7154db2021-11-10 11:50:58 +0200203 {
204 // Try splitting the workload into t, subject to each subworkload size <= mws.
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +0100205 if ((window.num_iterations(split_dimension) / kernel.get_mws(cpu_info, t)) >= t)
Dana Zlotnikd7154db2021-11-10 11:50:58 +0200206 {
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +0100207 if (t != init_num_windows)
Dana Zlotnikd7154db2021-11-10 11:50:58 +0200208 {
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +0100209 ARM_COMPUTE_LOG_INFO_MSG_CORE(
210 "The scheduler is using a different thread count than the one assigned by the user.");
Dana Zlotnikd7154db2021-11-10 11:50:58 +0200211 }
212 return t;
213 }
214 }
Felix Thomasmathibalanafd38f02023-09-27 17:46:17 +0100215 ARM_COMPUTE_LOG_INFO_MSG_CORE(
216 "The scheduler is using single thread instead of the thread count assigned by the user.");
Dana Zlotnikd7154db2021-11-10 11:50:58 +0200217 return 1; // If the workload is so small that it can't be split, we should run a single thread
218}
219
Moritz Pflanzerbeabe3b2017-08-31 14:56:32 +0100220} // namespace arm_compute