From ee3da4e0b75cfb4bb7c16e107d0ad3328f249ed3 Mon Sep 17 00:00:00 2001 From: Sylvain Jeaugey Date: Tue, 30 Jan 2018 09:17:29 -0800 Subject: [PATCH] Clarification [ROCm/rccl-tests commit: eb4c43ff3d37d656efdf2ed75ce49e7f73efa581] --- projects/rccl-tests/doc/PERFORMANCE.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/projects/rccl-tests/doc/PERFORMANCE.md b/projects/rccl-tests/doc/PERFORMANCE.md index b9afbb4ecb..97419ecde9 100644 --- a/projects/rccl-tests/doc/PERFORMANCE.md +++ b/projects/rccl-tests/doc/PERFORMANCE.md @@ -54,7 +54,7 @@ Considering that each rank has a bandwidth to the outside world of _B_, the time `t = (S*2*(n-1)) / (n*B)` Indeed, we have _S_ elements, 2*(n-1) operations per element, and _n_ links of bandwidth _B_ to perform them. -Reordering the elements, we find that +Reordering the equation, we find that `t = (S/B) * (2*(n-1)/n)`