Searched refs:Graph (Results 1 – 25 of 32) sorted by relevance
12
3 Flow Graph Tips and Tricks9 ../tbb_userguide/Flow-Graph-waiting-tips13 ../tbb_userguide/Flow-Graph-exception-tips
3 Flow Graph Tips for Waiting for and Destroying a Flow Graph
3 Data Flow Graph28 Simple Data Flow Graph38 Flow Graph** shown above:81 node F from **Simple Data Flow Graph** above is implemented as a loop107 the **Simple Data Flow Graph** above, is to introduce an ``input_node``. An142 need to create body that will act like the body of the loop in the **Simple Data Flow Graph**190 **Simple Data Flow Graph** above. In this simple example, there is not
3 Dependence Graph19 Dependence Graph for Making a Sandwich51 Simple Dependence Graph117 Execution Timeline for a Dependence Graph
6 Starting from C++17, the requirements for callable objects passed to algorithms or Flow Graph nodes…7 Previously, the body of the algorithm or Flow Graph node needed to be a Function Object (see `C++ S…13 * **Pointers to member functions** that you can use as the body of the algorithm or the Flow Graph …16 You can use it not only for a Flow Graph but also for algorithms. See the example below: 125 Consider a specific scenario with ``function_node`` within a Flow Graph.165 Before C++17, the ``function_node`` in the Flow Graph required the body to be a Function Object. A …
3 Flow Graph Basics: Graph Object
3 Flow Graph Tips on Nested Parallelism
3 Flow Graph Tips on Making Edges
3 Basic Flow Graph Concepts
3 Estimating Flow Graph Performance16 Graph
3 Flow Graph Basics: Mapping Nodes to Tasks23 **Execution Timeline of a Two Node Graph**
3 Flow Graph Tips for Limiting Resource Consumption
3 Flow Graph Tips for Exception Handling and Cancellation
3 Graph Application Categories
3 Use graph::reset() to Reset a Canceled Graph
3 Flow Graph Basics: Message Passing Protocol
37 **Simple Data Flow Graph**64 **Dependence Graph for Making a Sandwich**
3 Flow Graph Basics: Edges
3 Attach Flow Graph to an Arbitrary Task Arena
3 Flow Graph Basics: Buffering and Forwarding
30 void Graph::create_random_dag(std::size_t number_of_nodes) { in create_random_dag()54 void Graph::print() { in print()63 void Graph::get_root_set(std::vector<Cell*>& root_set) { in get_root_set()
71 class Graph { class
71 Graph g; in main()
23 add_executable(parallel_preorder parallel_preorder.cpp Graph.cpp main.cpp)
2 Examples using oneTBB Flow Graph feature.