Searched refs:edge (Results 1 – 7 of 7) sorted by relevance
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | Flow_Graph_Message_Passing_Protocol.rst | 10 if this occurs the state of the edge between the nodes can change its
12 query its predecessor to see if a message is available. If the edge did
18 Once the edge is in pull mode, when the successor is not busy, it will
23 edge will remain in pull mode.
24 #. If the predecessor has no message, the edge between the nodes will
|
| H A D | use_input_node.rst | 50 it might send a message to squarer immediately after the edge to
51 squarer is connected. Later, when the edge to cuber is connected, cuber
105 The above code is safe because the edge from ``func1`` to ``func2`` is made
106 before the edge from src to ``func1``. If the edge from src to func1 were
|
| H A D | Edges.rst | 13 it and then connect that to the first node with an edge.
41 an edge from ``n`` to ``m``. The node ``n`` is created with unlimited concurrency,
44 Because there is an edge from ``n`` to ``m``, each value ``v``, returned by ``n``, will
|
| H A D | Flow_Graph_Reservation.rst | 25 and the edge connecting the nodes is switched to pull mode.
26 - The reserving input port calls ``try_reserve`` on each edge in pull
28 edge to push state, and tries to reserve the next node connected by
29 an edge in pull state. While the input port's predecessor is in
31 - If each input port successfully reserves an edge in pull state, the
46 input port has at least one edge in a pull state, and will only attempt
54 output edge from push to pull mode. ``broadcast_nodes`` do not buffer
236 - No attempt to pull from ``bn`` is made, because the edge from ``bn``
|
| H A D | communicate_with_nodes.rst | 9 between nodes that are part of the same graph. An edge expresses the
17 If two graphs must communicate, do NOT create an edge between them, but
74 consider m2 to be a predecessor of n1 since no edge exists.
|
| H A D | Flow_Graph_Single_Vs_Broadcast.rst | 16 is connected to the node by an edge in push mode, and which accepts
|
| /oneTBB/examples/parallel_reduce/convex_hull/ |
| H A D | convex_hull.hpp | 131 struct edge { struct
134 edge(Index _p1, Index _p2) : start(_p1), end(_p2){}; in edge() function
|