Skip to content

simplify graph update #323

@aharon-abramson

Description

@aharon-abramson

The suggested graph update mechanism seems computationally complex: an implementation has to traverse both the modifiable and executable graphs to identify any changes to either inputs or outputs.
I better like the OpenCL approach, where one directly updates a cl_mutable_command_khr handle. We can add an update method to class node. We can also add graph::get_node(size_t index) for obtaining the nodes created during queue recording.

Metadata

Metadata

Assignees

No one assigned

    Labels

    Spec Revision 2Targetting the second revision of the specificationenhancementNew feature or request

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions