Crossed Cubes

Interactive research site

A better map for distributed computation.

Crossed cubes are recursively structured processor networks that shorten communication distance without increasing node degree. This site collects visual studies of their geometry, routing behavior, and potential role in memory-constrained matrix computation.

Labeled CQ3 in Gray-code order, with the three dimension matchings shown in color.

Research areas

Three views of one network.

The demonstrations begin with the graph itself, then follow information as it moves across the network, and finally examine the consequences for distributed matrix workloads.

01

Topology

Visualize crossed-cube dimensions, recursive structure, and the path geometry that distinguishes the network from a hypercube.

02

Communication

Explore routing, path diversity, permutations, broadcast, and reduction through carefully selected interactive studies.

03

Computation

Study communication schedules for matrix computation and how network depth affects buffer size, throughput, and data movement.