-
Notifications
You must be signed in to change notification settings - Fork 787
[SYCL][Graph] Optimize graph enqueue for in-order queues #18792
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] Optimize graph enqueue for in-order queues #18792
Conversation
4c130dc
to
ad6ed0e
Compare
ad6ed0e
to
e8ee455
Compare
e8ee455
to
8393ea8
Compare
b00774f
to
130688f
Compare
30e862e
to
dd8f6d1
Compare
@intel/llvm-gatekeepers Can this PR be merged? The existing failures seem to be CI issues. This PR was green for those jobs before: Intel-Arc jobs:
Cuda UR Job: There were only unrelated changes to the HIP UR adapter made since then. Edit: Nevermind, recently merged commits broke this PR, needs to be rebased. |
@intel/llvm-gatekeepers This PR is ready to merge. The CI failure on PVC is unrelated (I have seen it in other PR's). |
Failing tests are unrelated and tracked by #18932 |
Optimizes the
enqueue()
function of sycl graphs to bypass the scheduler whenever possible and avoid creating events when not needed.enqueue()
to have different paths depending on workload:host-tasks
which requires scheduling multiple graph partitions. The implementation was also changed to avoid adding unnecessary event dependencies to partition executions and avoiding copyingCGData
when possible.host-tasks
. Also updates the handler to only request events from the graphenqueue()
when they are needed.