Post #2557972
2026-05-11 15:19 UTC
This article answers some questions I had about actually programming the Connection Machines. Mostly I was curious about routing and contention.
https://dash.harvard.edu/server/api/core/bitstreams/7312037d-d17c-6bd4-e053-0100007fdf3b/content
Replies (1)
-
@theohonohan@graphics.social 2026-05-11 15:19
"A Hamiltonian cycle can be constructed by moving across cube dimensions according to the transition sequence in a binary-reflected Gray code. Translating such a cycle to another source node by performing an exclusive-or operation on every node address by the source node index, assuming the first cycle has node zero as its source, creates 2^n = N paths."