preprints.org > computer science and mathematics > hardware and architecture > doi: 10.20944/preprints202306.1262.v1

Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Version 1 : Received: 15 June 2023 / Approved: 19 June 2023 / Online: 19 June 2023 (02:38:59 CEST)

Multi-level direct networks fueled by the evolving technology of active optical cables and increasing pin-bandwidth achieve reduced diameters and cost, with high-radix switches. These networks, like Dragonfly, are becoming the preferred aspirants for extreme high-performance parallel machines such as exa-scale computing. In this paper, we introduce a Hyper Z-Tree topology, which deploys the Z-Tree, a variant of fat-tree, as a computing node of a Generalized Hypercube (GHC) configuration. The resulting configuration provides higher bisection bandwidth, lower latency for some applications and higher throughput. Furthermore, the levels of the fat tree offer several path diversities across the GHC dimensions, hence conceding a more fault tolerant architecture. To profit from these path diversities, we propose two adaptive routing algorithms, which are extensions to the routing algorithm suggested in HyperX topology. These two algorithms exhibit better latencies and throughput than the HyperX.

Adaptive routing; deterministic routing; connectivity; Hypercube,; at-tree, deadlock; high switch-radix

Computer Science and Mathematics, Hardware and Architecture

* All users must log in before leaving a comment