Cristobal Camarero

Learn More
Current High-Performance Computing (HPC) and data center networks rely on large-radix routers. Hamming graphs (Cartesian products of complete graphs) and dragonflies (two-level direct networks with nodes organized in groups) are some direct topologies proposed for such networks. The original definition of the dragonfly topology is very loose, with several(More)
A construction of 2-quasi-perfect Lee codes is given over the space Z n p for p prime, p ≡ ±5 (mod 12) and n = 2[ p 4 ]. It is known that there are infinitely many such primes. Golomb and Welch conjectured that perfect codes for the Lee-metric do not exist for dimension n ≥ 3 and radius r ≥ 2. This conjecture was proved to be true for large radii as well as(More)
—Dragonfly networks have been recently proposed for the interconnection network of forthcoming exascale supercom-puters. Relying on large-radix routers, they build a topology with low diameter and high throughput, divided into multiple groups of routers. While minimal routing is appropriate for uniform traffic patterns, adversarial traffic patterns can(More)
Twisted torus topologies have been proposed as an alternative to toroidal rectangular networks, improving distance parameters and providing network symmetry. However, twisting is apparently less amenable to task mapping algorithms of real life applications. In this paper we make an analytical study of different mapping and concentration techniques on 2D(More)