Home
last modified time | relevance | path

Searched refs:concurrency (Results 1 – 25 of 34) sorted by relevance

12

/oneTBB/test/tbb/
H A Dtest_parallel_pipeline.cpp43 static std::size_t concurrency = 0; variable
64 CHECK_MESSAGE(false, "Ran out of buffers, p:"<< concurrency); in fetchNextBuffer()
74 CHECK_MESSAGE(false, "Tried to free a buffer not in our list, p:" << concurrency); in freeBuffer()
193 CHECK_MESSAGE(!middle_my_id(t), "bad id value, p:" << concurrency); in operator ()()
194 CHECK_MESSAGE(!middle_is_ready(t), "Already ready, p:" << concurrency ); in operator ()()
224 CHECK_MESSAGE(!middle_my_id(my_storage), "bad id value, p:" << concurrency); in operator ()()
247 CHECK_MESSAGE(!middle_my_id(*my_storage), "bad id value, p:" << concurrency); in operator ()()
272 CHECK_MESSAGE(output_my_id(c), "unset id value, p:" << concurrency); in operator ()()
273 CHECK_MESSAGE(output_is_ready(c), "not yet ready, p:" << concurrency); in operator ()()
298 CHECK_MESSAGE(output_my_id(*c), "unset id value, p:" << concurrency); in operator ()()
[all …]
H A Dtest_arena_priorities.cpp143 concurrency_type concurrency = std::get<arena_concurrency>(item); in submit_work() local
148 [repeats, &barrier, &tg, priority_value, concurrency]() { in submit_work()
149 for( unsigned i = 0; i < repeats * concurrency; ++i ) { in submit_work()
234 concurrency_type concurrency = projected_concurrency; in test() local
239 concurrency = actual_concurrency = threads_left; in test()
245 concurrency = tbb::task_arena::automatic; in test()
250 tbb::task_arena* arena = allocate_and_construct_arena(concurrency, a_priority); in test()
307 concurrency_type concurrency = 0; in test() local
310 concurrency = std::get<arena_concurrency>(item); in test()
314 unsigned expected_tasks_num = repeats * concurrency; in test()
[all …]
H A Dtest_function_node.cpp55 void buffered_levels( size_t concurrency, Body body ) { in buffered_levels() argument
58 for ( size_t lc = 1; lc <= concurrency; ++lc ) { in buffered_levels()
160 void buffered_levels_with_copy( size_t concurrency ) { in buffered_levels_with_copy() argument
163 for ( size_t lc = 1; lc <= concurrency; ++lc ) { in buffered_levels_with_copy()
251 void concurrency_levels( size_t concurrency, Body body ) { in concurrency_levels() argument
253 for ( size_t lc = 1; lc <= concurrency; ++lc ) { in concurrency_levels()
523 concept can_call_function_node_ctor = requires( tbb::flow::graph& graph, std::size_t concurrency, B…
525 tbb::flow::function_node<Input, Output>(graph, concurrency, body);
526 tbb::flow::function_node<Input, Output>(graph, concurrency, body, priority);
528 tbb::flow::function_node<Input, Output>(tbb::flow::follows(f), concurrency, body);
[all …]
H A Dtest_multifunction_node.cpp54 void buffered_levels( size_t concurrency, Body body ) { in buffered_levels() argument
57 for ( size_t lc = 1; lc <= concurrency; ++lc ) { in buffered_levels()
151 void buffered_levels_with_copy( size_t concurrency ) { in buffered_levels_with_copy() argument
154 for ( size_t lc = 1; lc <= concurrency; ++lc ) { in buffered_levels_with_copy()
238 void concurrency_levels( size_t concurrency, Body body ) { in concurrency_levels() argument
240 for ( size_t lc = 1; lc <= concurrency; ++lc ) { in concurrency_levels()
602 …ll_multifunction_node_ctor = requires( tbb::flow::graph& graph, std::size_t concurrency, Body body,
604 tbb::flow::multifunction_node<Input, Output>(graph, concurrency, body);
605 tbb::flow::multifunction_node<Input, Output>(graph, concurrency, body, priority);
607 tbb::flow::multifunction_node<Input, Output>(tbb::flow::follows(f), concurrency, body);
[all …]
H A Dtest_task_arena.cpp582 int concurrency() { return my_arena.debug_max_concurrency(); } in concurrency() function
598 CHECK_MESSAGE( validator.concurrency()==expect_concurrency, "Unexpected arena size" ); in ValidateAttachedArena()
1769 void test_threads_sleep(int concurrency, int reserved_slots, int num_external_threads) { in test_threads_sleep() argument
1770 tbb::task_arena a(concurrency, reserved_slots); in test_threads_sleep()
1774 utils::SpinBarrier barrier( concurrency - reserved_slots + 1 ); in test_threads_sleep()
1781 for (int i = 0; i < concurrency - reserved_slots; ++i) { in test_threads_sleep()
1791 TestCPUUserTime(concurrency); in test_threads_sleep()
1804 void test_threads_sleep(int concurrency, int reserved_slots) { in test_threads_sleep() argument
1805 test_threads_sleep(concurrency, reserved_slots, reserved_slots); in test_threads_sleep()
1806 test_threads_sleep(concurrency, reserved_slots, 2 * concurrency); in test_threads_sleep()
H A Dtest_async_node.cpp856 concept can_call_async_node_ctor = requires( tbb::flow::graph& graph, std::size_t concurrency,
858 tbb::flow::async_node<Input, Output>(graph, concurrency, body);
859 tbb::flow::async_node<Input, Output>(graph, concurrency, body, priority);
861 tbb::flow::async_node<Input, Output>(tbb::flow::follows(f), concurrency, body);
862 tbb::flow::async_node<Input, Output>(tbb::flow::follows(f), concurrency, body, priority);
/oneTBB/doc/main/reference/
H A Dconstructors_for_nodes.rst44 function_node(follows(...), std::size_t concurrency, Policy = Policy());
45 function_node(precedes(...), std::size_t concurrency, Policy = Policy());
51 multifunction_node(follows(...), std::size_t concurrency, Body body);
52 multifunction_node(precedes(...), std::size_t concurrency, Body body);
55 async_node(follows(...), std::size_t concurrency, Body body);
56 async_node(precedes(...), std::size_t concurrency, Body body);
/oneTBB/doc/main/tbb_userguide/
H A DNodes.rst27 template< typename Body> function_node(graph &g, size_t concurrency, Body body)
42 * - concurrency
43 …- The concurrency limit for the node. You can use the concurrency limit to control how many…
96 concurrency limit of 1. When it receives the message sequence 1, 2 and
103 buffered in the node. When it is legal, based on concurrency limits, a
108 you construct the node with a different concurrency limit, parallelism
123 You can use unlimited as the concurrency limit to instruct the library
126 as 4 or 8, to limit concurrency to at most 4 or 8, respectively. It is
H A Duse_concurrency_limits.rst8 concurrency limit on the node. To cause it to reject messages after it
9 reaches its concurrency limit, you construct it as a "rejecting" node.
15 reached its concurrency limit still accepts incoming messages, but
70 concurrently. The node's concurrency threshold that limits the node to
75 ``function_node`` drops below its concurrency limit, it will pull new
H A DContainers.rst18 concurrency, thus restricting parallel speedup.
21 Containers provided by oneTBB offer a much higher level of concurrency,
39 additional concurrency that they enable outweighs their slower
H A DEdges.rst41 an edge from ``n`` to ``m``. The node ``n`` is created with unlimited concurrency,
42 while ``m`` has a concurrency limit of 1. The invocations of ``n`` can all
H A Davoiding_data_races.rst8 that you want the library to enforce. Similarly, the concurrency limits
56 allowed concurrency in ``f`` from unlimited to 1, forcing each value to be
H A DMapping_Nodes2Tasks.rst12 has unlimited concurrency, these tasks can execute concurrently if there
33 successor of n. Unlike node n, m has been constructed with a concurrency
H A DIterating_Over_a_Concurrent_Queue_for_Debugging.rst28 concurrency safe.
H A DGuiding_Task_Scheduler_Execution.rst26 - The level of ``task_arena`` concurrency
98 concurrency of the ``tbb::task_arena``:
H A Dattach_flow_graph_to_arena.rst9 restricting part of computation units, or limiting arena concurrency. In some
H A DData_Flow_Graph.rst78 with an unlimited concurrency. The summer node updates the sum through a
80 parallel. It is therefore created with a concurrency limit of 1. The
H A Dcreate_token_based_system.rst135 concurrency in the graph.
141 concurrency in the system. Since you can pair the token with an input at
H A DPredefined_Node_Types.rst29 …ric input and output types. Executes a user body, and has controllable concurrency level and buffe…
33 … generic output types. It executes a user body, and has controllable concurrency level and buffe…
/oneTBB/test/common/
H A Dcommon_arena_constraints.h100 int concurrency{-1};
106 , concurrency{src.concurrency}
112 concurrency = src.concurrency;
202 current_node_info.concurrency = hwloc_bitmap_weight(current_node_info.cpuset); in system_info()
203 if(current_node_info.concurrency) { in system_info()
211 current_node_info.concurrency = hwloc_bitmap_weight(process_cpuset); in system_info()
254 cki.concurrency = hwloc_bitmap_weight(cki.cpuset); in system_info()
262 cpu_kind_infos[0].concurrency = hwloc_bitmap_weight(process_cpuset); in system_info()
H A Dgraph_utils.h799 void test_limited_lightweight_execution(unsigned N, unsigned concurrency) {
800 CHECK_MESSAGE(concurrency != tbb::flow::unlimited,
803 NodeType node(g, concurrency, limited_lightweight_checker_body</*NoExcept*/true>());
806 utils::SpinBarrier barrier(N - concurrency);
810 …CHECK_MESSAGE(g_lightweight_count == concurrency, "Body needs to be executed as lightweight once");
811 …CHECK_MESSAGE(g_task_count == N - concurrency, "Body needs to be executed as not lightweight N - 1…
817 void test_limited_lightweight_execution_with_throwing_body(unsigned N, unsigned concurrency) {
818 CHECK_MESSAGE(concurrency != tbb::flow::unlimited,
821 NodeType node(g, concurrency, limited_lightweight_checker_body</*NoExcept*/false>());
/oneTBB/examples/task_arena/
H A DREADME.md6 | fractal |The example calculates two classical Mandelbrot fractals with different concurrency limi…
/oneTBB/doc/main/tbb_userguide/Migration_Guide/
H A DTask_Scheduler_Init.rst18 …returns the maximum concurrency that will be created by *default* in implicit or explicit ``task_a…
29 Setting the maximum concurrency
34 limits the maximum concurrency of the parallel algorithm running inside ``task_arena``
/oneTBB/include/oneapi/tbb/
H A Dflow_graph.h76 enum concurrency { unlimited = 0, serial = 1 }; enum
784 __TBB_NOINLINE_SYM function_node( graph &g, size_t concurrency, in __TBB_requires()
795 : function_node(g, concurrency, body, Policy(), a_priority) {} in __TBB_requires()
809 : function_node(nodes, concurrency, body, Policy(), a_priority) {} in __TBB_requires()
878 graph &g, size_t concurrency, in __TBB_requires()
880 ) : graph_node(g), input_impl_type(g, concurrency, body, a_priority) { in __TBB_requires()
2938 graph &g, size_t concurrency, in __TBB_requires()
2941 g, concurrency, in __TBB_requires()
2954 : async_node(g, concurrency, body, Policy(), a_priority) {} in __TBB_requires()
2960 const node_set<Args...>& nodes, size_t concurrency, Body body, in __TBB_requires()
[all …]
/oneTBB/src/tbb/
H A Dtcm_adaptor.cpp110 int update_concurrency(uint32_t concurrency) { in update_concurrency() argument
111 return my_arena.update_concurrency(concurrency); in update_concurrency()

12