Block-matrix operations using orthogonal trees
Anne Cathrine Elster, Anthony P. Reeves · 1988
Hypercube algorithms are presented for distributed block-matrix operations. These algorithms are based entirely on an interconnection scheme which involves two orthogonal sets of binary trees. This switching topology makes use of all hypercube interconnection links in a synchronized manner.