Lines Matching refs:a

7 In a dependence graph, the nodes invoke body objects to perform
8 computations and the edges create a partial ordering of these
12 application that could be expressed using a dependence graph.
19    Dependence Graph for Making a Sandwich
28 Dependence graphs are a special case of data flow graphs, where the data
29 passed between nodes are of type oneapi::tbb::flow::continue_msg. Unlike a
30 general data flow graph, nodes in a dependence graph do not spawn a task
32 predecessors they have, count the messages they receive and only spawn a
37 The following figure shows another example of a dependence graph. It has
42 complete before D and F start executing. This is a partial ordering
60 To implement this as a flow graph, continue_node objects are used for
71 The first argument is the graph it belongs to and the second is a
72 function object or lambda expression. Unlike a function_node, a
74 immediately spawn a task whenever its dependencies are met.
90      node_t A(g, [](msg_t){ a(); } );
109 does not start until both B and E are finished. While a task is waiting
117    Execution Timeline for a Dependence Graph
128 calling thread quickly, after incrementing the counter and spawning a
130 lambda expressions and then put a continue_msg to all successor nodes,
139 to wait until a thread is available to execute them.