Topologías king como redes de interconexión

Abstract

King topologies are an evolution of the meshes and tori commonly used as interconnection networks for high-performance computing. In order to increase the degree of the latter, king networks add diagonal links in both orientations. This has the effect of improving the performance, increasing the throughput and reducing the latency. This thesis proposes several routing algorithms that satisfy different needs. First, it studies minimum-distance routing for applications requiring short latencies. Next it proposes a misrouting algorithm, that relaxes the minimum distance restriction to improve the load balancing capability in the presence of adverse traffic patterns. In addition, it studies fault-tolerant routing algorithms, and proposes an original algorithm specific for king networks. Lastly, the thesis shows an area and energy cost evaluation to establish that these networks are a viable alternative to traditional networks