I don't understand how this works without switches. Is each node designated a column as well as a row so that no messages between different nodes could possibly share a link?
neonachronism
The yellow circles are switches. They route based off the destination in the header.
mpcomplete
In the shortest path the minimum number of switches to go from node j to node i (j > i) would be j - i (taking the direct vertical path)?
acortes
@mpcomplete I believe it should be j - i + 1. Think about 0 going to 0, we still need to pass by one switch. 1 going to 2 requires passing 2 switches.
caiqifang
How can this achieve a N(1) latency? For example from 6 to 7? And can this implementation avoid blocking?
bpr
@caiqifang, this question is addressed in the discussion on the previous slide.
I don't understand how this works without switches. Is each node designated a column as well as a row so that no messages between different nodes could possibly share a link?
The yellow circles are switches. They route based off the destination in the header.
In the shortest path the minimum number of switches to go from node j to node i (j > i) would be j - i (taking the direct vertical path)?
@mpcomplete I believe it should be j - i + 1. Think about 0 going to 0, we still need to pass by one switch. 1 going to 2 requires passing 2 switches.
How can this achieve a N(1) latency? For example from 6 to 7? And can this implementation avoid blocking?
@caiqifang, this question is addressed in the discussion on the previous slide.