blob: eae34b98eb64fc0ddcd9afe2e1621cfad39b97ac [file] [log] [blame]
Moritz Pflanzerbeabe3b2017-08-31 14:56:32 +01001/*
Sang-Hoon Park0094c022021-01-20 18:16:47 +00002 * Copyright (c) 2016-2021 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"
morgolock51112642020-08-20 14:51:39 +010028#include "arm_compute/core/Window.h"
Sang-Hoon Park68dd25f2020-10-19 16:00:11 +010029#include "src/runtime/CPUUtils.h"
30#include "src/runtime/SchedulerUtils.h"
Moritz Pflanzerbeabe3b2017-08-31 14:56:32 +010031
32namespace arm_compute
33{
34IScheduler::IScheduler()
Pablo Tello7fad9b12018-03-14 17:55:27 +000035 : _cpu_info()
Moritz Pflanzerbeabe3b2017-08-31 14:56:32 +010036{
Sang-Hoon Park68dd25f2020-10-19 16:00:11 +010037 utils::cpu::get_cpu_configuration(_cpu_info);
Georgios Pinitas53d12272018-02-01 20:23:25 +000038 // Work out the best possible number of execution threads
Sang-Hoon Park68dd25f2020-10-19 16:00:11 +010039 _num_threads_hint = utils::cpu::get_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{
Pablo Tello7fad9b12018-03-14 17:55:27 +000044 return _cpu_info;
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;
morgolock51112642020-08-20 14:51:39 +010063 if(hints.split_dimension() == IScheduler::split_dimensions_all)
64 {
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;
77 for(unsigned int ni = 0; ni != n_threads; ++ni)
78 {
79 for(unsigned int mi = 0; mi != m_threads; ++mi)
80 {
81 workloads.push_back(
82 [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);
87
88 win.validate();
89
90 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));
93
94 thread_locator.validate();
95
96 kernel->run_nd(win, info, thread_locator);
97 });
98 }
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
107 if(num_iterations == 0)
108 {
109 return;
110 }
111
112 if(!kernel->is_parallelisable() || num_threads == 1)
113 {
114 ThreadInfo info;
115 info.cpu_info = &_cpu_info;
116 if(tensors.empty())
117 {
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;
128 switch(hints.strategy())
129 {
130 case StrategyHint::STATIC:
131 num_windows = num_threads;
132 break;
133 case StrategyHint::DYNAMIC:
134 {
135 const unsigned int granule_threshold = (hints.threshold() <= 0) ? num_threads : static_cast<unsigned int>(hints.threshold());
136 // Make sure we don't use some windows which are too small as this might create some contention on the ThreadFeeder
137 num_windows = num_iterations > granule_threshold ? granule_threshold : num_iterations;
138 break;
139 }
140 default:
141 ARM_COMPUTE_ERROR("Unknown strategy");
142 }
143 std::vector<IScheduler::Workload> workloads(num_windows);
144 for(unsigned int t = 0; t < num_windows; ++t)
145 {
146 //Capture 't' by copy, all the other variables by reference:
147 workloads[t] = [t, &hints, &max_window, &num_windows, &kernel, &tensors](const ThreadInfo & info)
148 {
149 Window win = max_window.split_window(hints.split_dimension(), t, num_windows);
150 win.validate();
151
152 if(tensors.empty())
153 {
154 kernel->run(win, info);
155 }
156 else
157 {
158 kernel->run_op(tensors, win, info);
159 }
160 };
161 }
162 run_workloads(workloads);
163 }
164 }
Sang-Hoon Park0094c022021-01-20 18:16:47 +0000165#else /* !BARE_METAL */
166 ARM_COMPUTE_UNUSED(kernel, hints, window, tensors);
morgolock51112642020-08-20 14:51:39 +0100167#endif /* !BARE_METAL */
168}
169
Anthony Barbier148b0752018-09-11 14:19:39 +0100170void IScheduler::run_tagged_workloads(std::vector<Workload> &workloads, const char *tag)
171{
172 ARM_COMPUTE_UNUSED(tag);
173 run_workloads(workloads);
174}
175
Moritz Pflanzerbeabe3b2017-08-31 14:56:32 +0100176} // namespace arm_compute