Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[SYCL][Graph] Implementation of whole graph update #366

Closed
wants to merge 7 commits into from

Conversation

fabiomestre
Copy link
Collaborator

No description provided.

Copy link
Collaborator

@EwanC EwanC left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

A few comments, but looking good.

I think we could also have tests for the following cases:

  • Test update using a graph with a nested sub-graph in it.
  • Test update in the case where there's no update to the inputs with the new input graph to make sure it's not an error, as we've not specified any error.

sycl/source/detail/graph_impl.cpp Outdated Show resolved Hide resolved
sycl/test-e2e/Graph/Update/whole_update_double_buffer.cpp Outdated Show resolved Hide resolved
sycl/unittests/Extensions/CommandGraph/Update.cpp Outdated Show resolved Hide resolved
sycl/unittests/Extensions/CommandGraph/Update.cpp Outdated Show resolved Hide resolved
sycl/test-e2e/Graph/Update/whole_update_dynamic_param.cpp Outdated Show resolved Hide resolved
Copy link
Collaborator

@Bensuo Bensuo left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

LGTM, just some minor comments!

sycl/source/detail/graph_impl.cpp Outdated Show resolved Hide resolved
sycl/source/detail/graph_impl.cpp Outdated Show resolved Hide resolved
sycl/test-e2e/Graph/Update/whole_update_delay.cpp Outdated Show resolved Hide resolved
sycl/unittests/Extensions/CommandGraph/Update.cpp Outdated Show resolved Hide resolved
sycl/unittests/Extensions/CommandGraph/Update.cpp Outdated Show resolved Hide resolved
Copy link
Collaborator

@EwanC EwanC left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

LGTM, nice work

sycl/test-e2e/Graph/Inputs/whole_update_double_buffer.cpp Outdated Show resolved Hide resolved
Comment on lines 1173 to 1184
throw sycl::exception(sycl::make_error_code(errc::invalid),
"Mismatch found in the number of nodes. The graphs "
"must have a matching topology.");
} else {
for (uint32_t i = 0; i < MNodeStorage.size(); ++i) {
if (MNodeStorage[i]->MSuccessors.size() !=
GraphImpl->MNodeStorage[i]->MSuccessors.size() ||
MNodeStorage[i]->MPredecessors.size() !=
GraphImpl->MNodeStorage[i]->MPredecessors.size()) {
throw sycl::exception(sycl::make_error_code(errc::invalid),
"Mismatch found in the number of edges. The "
"graphs must have a matching topology.");
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Same nit as before I think these error messages could be more explicit that this is the update operation.

@fabiomestre
Copy link
Collaborator Author

@fabiomestre fabiomestre closed this Apr 5, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants