Lines Matching refs:is

8 It's possible to create graphs that are highly scalable, but it is also possible to
14 edges. When a node in the graph receives a message, a task is spawned to
22 where a sequence of values is processed as each value passes through the
23 nodes in the graph. In this example, the sequence is created by a
27 completely processed, sum is equal to the sum of the sequence of squares
47 this example, a dependence graph is used to establish a partial ordering
54 together. This is a partial ordering because, for example, it doesn't
74 jar, are shared between ordered steps, it is not explicit in the graph.
75 Instead, only the required ordering of steps is explicit in a dependence
84 the runtime library spawns tasks to exploit the parallelism that is
90 is legal to execute in parallel, but allows the runtime library to
94 The support for graph parallelism is contained within the namespace
95 ``oneapi::tbb::flow`` and is defined in the ``flow_graph.h`` header file.