We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
Hi, developers.
In nccl, we have tree/nvlstree for tree based allreduce. I found Here NVIDIA/nccl#209. for 2 node, we can calculate ib bw like : S/t
how about 3 node, n node for tree based allreduce? what's the result for ib bw?
Looking forward to your replay!!!
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Hi, developers.
In nccl, we have tree/nvlstree for tree based allreduce.
I found Here NVIDIA/nccl#209. for 2 node, we can calculate ib bw like : S/t
how about 3 node, n node for tree based allreduce? what's the result for ib bw?
Looking forward to your replay!!!
The text was updated successfully, but these errors were encountered: