From e00cb1f1c429eb524f2e0903f986b46fe0d15e1f Mon Sep 17 00:00:00 2001 From: Sylvain Jeaugey Date: Tue, 30 Jan 2018 09:15:58 -0800 Subject: [PATCH] Typos/Clarifications --- doc/PERFORMANCE.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/doc/PERFORMANCE.md b/doc/PERFORMANCE.md index bc01e57..b9afbb4 100644 --- a/doc/PERFORMANCE.md +++ b/doc/PERFORMANCE.md @@ -38,11 +38,11 @@ An allreduce operation, for each element of the N arrays (input i_X and output o **Note : this is independent of the algorithm used (ring, tree, or other) as long as they use point-to-point operations (send/receive).** -A ring would do that in an order which follows the ring : +A ring would do that operation in an order which follows the ring : `i_0 + i_1 + ... + i_{n-1} -> o_{n-1} -> o_0 -> o_1 -> .. -> o_{n-2}` -A tree would do this hierchically : +A tree would do it hierarchically : `(((((i_{n-1} + i_{n-2}) + (i_{n-3} + i_{n-4})) + ... + (i_1 + i_0))))) -> o_0 -> (o_{n/2} -> (o_{3n/4} ...))`