Library/ManagedCuda/CudaGraph.cs
/// <summary>
/// Creates an empty node and adds it to a graph<para/>
/// Creates a new node which performs no operation, and adds it to to the graph with
/// dependencies specified via dependencies.
/// It is possible for dependencies to be null, in which case the node will be placed
/// at the root of the graph. Dependencies may not have any duplicate entries.
/// <para/>
/// An empty node performs no operation during execution, but can be used for
/// transitive ordering. For example, a phased execution graph with 2 groups of n
/// nodes with a barrier between them can be represented using an empty node and
/// 2*n dependency edges, rather than no empty node and n^2 dependency edges.
/// </summary>
/// <param name="dependencies">can be null</param>
/// <returns>A handle to the new node will be returned.</returns>
Creates an empty node and adds it to a graph
Creates a new node which performs no operation, and adds it to to the graph with
dependencies specified via dependencies.
It is possible for dependencies to be null, in which case the node will be placed
at the root of the graph. Dependencies may not have any duplicate entries.

An empty node performs no operation during execution, but can be used for
transitive ordering. For example, a phased execution graph with 2 groups of n
nodes with a barrier between them can be represented using an empty node and
2*n dependency edges, rather than no empty node and n^2 dependency edges.
Creates an empty node and adds it to a graph Creates a new node which performs no operation and adds it to to the graph with dependencies specified via dependencies . It is possible for dependencies to be null in which case the node will be placed at the root of the graph . Dependencies may not have any duplicate entries . An empty node performs no operation during execution but can be used for transitive ordering . For example a phased execution graph with 2 groups of n nodes with a barrier between them can be represented using an empty node and 2 * n dependency edges rather than no empty node and n^2 dependency edges .
public CUgraphNode AddEmptyNode(CUgraphNode[] dependencies)
        {
            CUgraphNode node = new CUgraphNode();
            SizeT numDependencies = 0;
            if (dependencies != null)
                numDependencies = dependencies.Length;
            res = DriverAPINativeMethods.GraphManagment.cuGraphAddEmptyNode(ref node, _graph, dependencies, numDependencies);
            Debug.WriteLine(String.Format("{0:G}, {1}: {2}", DateTime.Now, "cuGraphAddEmptyNode", res));
            if (res != CUResult.Success) throw new CudaException(res);
            return node;
        }
public CUgraphNode AddEmptyNode ( CUgraphNode [ ] dependencies ) { CUgraphNode node = new CUgraphNode ( ) ; SizeT numDependencies = 0 ; if ( dependencies != null ) numDependencies = dependencies . Length ; res = DriverAPINativeMethods . GraphManagment . cuGraphAddEmptyNode ( ref node , _graph , dependencies , numDependencies ) ; Debug . WriteLine ( String . Format ( " " , DateTime . Now , " " , res ) ) ; if ( res != CUResult . Success ) throw new CudaException ( res ) ; return node ; }
Creates an empty node and adds it to a graph
Creates a new node which performs no operation, and adds it to to the graph with
dependencies specified via dependencies.
Creates an empty node and adds it to a graph Creates a new node which performs no operation and adds it to to the graph with dependencies specified via dependencies .
A handle to the new node will be returned.
A handle to the new node will be returned .
dependencies
CUgraphNode[]
can be null
can be null